/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/ps5-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:20:54,712 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:20:54,713 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:20:54,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:20:54,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:20:54,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:20:54,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:20:54,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:20:54,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:20:54,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:20:54,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:20:54,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:20:54,761 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:20:54,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:20:54,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:20:54,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:20:54,769 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:20:54,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:20:54,776 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:20:54,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:20:54,782 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:20:54,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:20:54,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:20:54,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:20:54,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:20:54,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:20:54,789 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:20:54,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:20:54,790 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:20:54,790 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:20:54,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:20:54,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:20:54,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:20:54,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:20:54,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:20:54,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:20:54,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:20:54,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:20:54,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:20:54,794 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:20:54,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:20:54,796 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:20:54,796 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:20:54,802 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:20:54,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:20:54,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:20:54,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:20:54,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:20:54,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:20:54,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:20:54,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:20:54,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:20:54,805 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:20:54,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:20:54,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:20:54,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:20:54,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:20:54,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:20:54,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:20:54,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:20:54,805 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:20:54,805 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:20:54,806 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:20:54,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:20:54,806 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:20:54,806 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:20:54,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:20:54,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:20:54,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:20:54,988 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:20:54,988 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:20:54,989 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound20.c [2022-04-08 14:20:55,030 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1a8651ac/52ceb8163c4d47a6b9f150bc6e2f6db5/FLAG71e896bc2 [2022-04-08 14:20:55,396 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:20:55,397 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound20.c [2022-04-08 14:20:55,401 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1a8651ac/52ceb8163c4d47a6b9f150bc6e2f6db5/FLAG71e896bc2 [2022-04-08 14:20:55,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1a8651ac/52ceb8163c4d47a6b9f150bc6e2f6db5 [2022-04-08 14:20:55,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:20:55,415 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:20:55,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:20:55,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:20:55,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:20:55,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:20:55" (1/1) ... [2022-04-08 14:20:55,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d15d3c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:55, skipping insertion in model container [2022-04-08 14:20:55,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:20:55" (1/1) ... [2022-04-08 14:20:55,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:20:55,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:20:55,559 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/ps5-ll_unwindbound20.c[458,471] [2022-04-08 14:20:55,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:20:55,594 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:20:55,606 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/ps5-ll_unwindbound20.c[458,471] [2022-04-08 14:20:55,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:20:55,632 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:20:55,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:55 WrapperNode [2022-04-08 14:20:55,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:20:55,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:20:55,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:20:55,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:20:55,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:55" (1/1) ... [2022-04-08 14:20:55,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:55" (1/1) ... [2022-04-08 14:20:55,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:55" (1/1) ... [2022-04-08 14:20:55,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:55" (1/1) ... [2022-04-08 14:20:55,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:55" (1/1) ... [2022-04-08 14:20:55,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:55" (1/1) ... [2022-04-08 14:20:55,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:55" (1/1) ... [2022-04-08 14:20:55,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:20:55,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:20:55,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:20:55,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:20:55,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:55" (1/1) ... [2022-04-08 14:20:55,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:20:55,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:20:55,685 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:20:55,690 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:20:55,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:20:55,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:20:55,716 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:20:55,716 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 14:20:55,717 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 14:20:55,717 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:20:55,717 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:20:55,717 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:20:55,718 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:20:55,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:20:55,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 14:20:55,718 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 14:20:55,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 14:20:55,719 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:20:55,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:20:55,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:20:55,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:20:55,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:20:55,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:20:55,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:20:55,758 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:20:55,759 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:20:55,861 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:20:55,865 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:20:55,865 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:20:55,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:20:55 BoogieIcfgContainer [2022-04-08 14:20:55,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:20:55,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:20:55,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:20:55,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:20:55,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:20:55" (1/3) ... [2022-04-08 14:20:55,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50165563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:20:55, skipping insertion in model container [2022-04-08 14:20:55,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:55" (2/3) ... [2022-04-08 14:20:55,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50165563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:20:55, skipping insertion in model container [2022-04-08 14:20:55,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:20:55" (3/3) ... [2022-04-08 14:20:55,883 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_unwindbound20.c [2022-04-08 14:20:55,886 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:20:55,886 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:20:55,910 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:20:55,914 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:20:55,914 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:20:55,932 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:20:55,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 14:20:55,936 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:20:55,936 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:20:55,936 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:20:55,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:20:55,940 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-08 14:20:55,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:20:55,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [8998935] [2022-04-08 14:20:55,951 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:20:55,951 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 2 times [2022-04-08 14:20:55,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:20:55,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969672949] [2022-04-08 14:20:55,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:20:55,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:20:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:20:56,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:20:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:20:56,107 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:20:56,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 14:20:56,108 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-08 14:20:56,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 14:20:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:20:56,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:20:56,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:20:56,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:20:56,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 14:20:56,120 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:20:56,120 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:20:56,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 14:20:56,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-08 14:20:56,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-08 14:20:56,121 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:20:56,121 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:20:56,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:20:56,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:20:56,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:20:56,122 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 14:20:56,123 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:20:56,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-08 14:20:56,123 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {33#false} is VALID [2022-04-08 14:20:56,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-08 14:20:56,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-08 14:20:56,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 14:20:56,124 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:20:56,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:20:56,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969672949] [2022-04-08 14:20:56,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969672949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:20:56,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:20:56,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:20:56,128 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:20:56,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [8998935] [2022-04-08 14:20:56,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [8998935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:20:56,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:20:56,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:20:56,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768520086] [2022-04-08 14:20:56,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:20:56,134 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:20:56,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:20:56,138 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:20:56,165 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:20:56,165 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 14:20:56,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:20:56,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 14:20:56,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:20:56,184 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:20:56,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:20:56,321 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-08 14:20:56,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 14:20:56,322 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:20:56,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:20:56,323 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:20:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-08 14:20:56,329 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:20:56,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-08 14:20:56,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-08 14:20:56,414 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:20:56,421 INFO L225 Difference]: With dead ends: 50 [2022-04-08 14:20:56,421 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 14:20:56,423 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:20:56,426 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:20:56,427 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.0s Time] [2022-04-08 14:20:56,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 14:20:56,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-08 14:20:56,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:20:56,454 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:20:56,454 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:20:56,455 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:20:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:20:56,463 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 14:20:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 14:20:56,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:20:56,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:20:56,464 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:20:56,464 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:20:56,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:20:56,469 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 14:20:56,469 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 14:20:56,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:20:56,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:20:56,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:20:56,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:20:56,470 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:20:56,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-08 14:20:56,472 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-08 14:20:56,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:20:56,472 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-08 14:20:56,472 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:20:56,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-08 14:20:56,505 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:20:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 14:20:56,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 14:20:56,506 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:20:56,506 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:20:56,506 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:20:56,506 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:20:56,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:20:56,507 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-08 14:20:56,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:20:56,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [395275771] [2022-04-08 14:20:56,508 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:20:56,508 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 2 times [2022-04-08 14:20:56,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:20:56,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714636322] [2022-04-08 14:20:56,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:20:56,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:20:56,522 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:20:56,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [326331124] [2022-04-08 14:20:56,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:20:56,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:20:56,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:20:56,524 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:20:56,552 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:20:56,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 14:20:56,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:20:56,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 14:20:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:20:56,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:20:56,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2022-04-08 14:20:56,745 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:20:56,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:20:56,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#(<= ~counter~0 0)} {242#true} #61#return; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:20:56,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#(<= ~counter~0 0)} call #t~ret6 := main(); {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:20:56,747 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:20:56,747 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:20:56,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(<= ~counter~0 0)} ~cond := #in~cond; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:20:56,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(<= ~counter~0 0)} assume !(0 == ~cond); {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:20:56,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:20:56,749 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:20:56,749 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:20:56,749 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:20:56,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#(<= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {243#false} is VALID [2022-04-08 14:20:56,750 INFO L272 TraceCheckUtils]: 14: Hoare triple {243#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {243#false} is VALID [2022-04-08 14:20:56,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID [2022-04-08 14:20:56,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID [2022-04-08 14:20:56,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#false} assume !false; {243#false} is VALID [2022-04-08 14:20:56,751 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:20:56,751 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:20:56,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:20:56,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714636322] [2022-04-08 14:20:56,752 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:20:56,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326331124] [2022-04-08 14:20:56,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326331124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:20:56,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:20:56,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:20:56,753 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:20:56,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [395275771] [2022-04-08 14:20:56,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [395275771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:20:56,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:20:56,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:20:56,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124190102] [2022-04-08 14:20:56,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:20:56,755 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:20:56,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:20:56,756 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:20:56,769 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:20:56,769 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:20:56,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:20:56,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:20:56,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:20:56,772 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:20:56,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:20:56,826 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 14:20:56,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:20:56,826 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:20:56,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:20:56,827 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:20:56,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-08 14:20:56,831 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:20:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-08 14:20:56,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-08 14:20:56,862 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:20:56,863 INFO L225 Difference]: With dead ends: 34 [2022-04-08 14:20:56,863 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 14:20:56,863 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:20:56,864 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:20:56,864 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:20:56,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 14:20:56,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 14:20:56,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:20:56,875 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:20:56,875 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:20:56,875 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:20:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:20:56,877 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 14:20:56,877 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 14:20:56,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:20:56,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:20:56,877 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:20:56,878 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:20:56,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:20:56,879 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 14:20:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 14:20:56,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:20:56,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:20:56,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:20:56,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:20:56,880 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:20:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-08 14:20:56,881 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-08 14:20:56,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:20:56,881 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-08 14:20:56,881 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:20:56,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-08 14:20:56,907 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:20:56,907 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 14:20:56,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 14:20:56,909 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:20:56,912 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:20:56,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 14:20:57,125 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:20:57,125 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:20:57,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:20:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-08 14:20:57,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:20:57,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [353781660] [2022-04-08 14:20:57,127 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:20:57,127 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 2 times [2022-04-08 14:20:57,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:20:57,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594242745] [2022-04-08 14:20:57,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:20:57,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:20:57,137 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:20:57,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [319701394] [2022-04-08 14:20:57,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:20:57,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:20:57,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:20:57,139 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:20:57,140 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:20:57,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 14:20:57,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:20:57,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:20:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:20:57,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:20:57,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2022-04-08 14:20:57,266 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:20:57,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-08 14:20:57,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #61#return; {471#true} is VALID [2022-04-08 14:20:57,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret6 := main(); {471#true} is VALID [2022-04-08 14:20:57,266 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:20:57,266 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:20:57,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#true} ~cond := #in~cond; {471#true} is VALID [2022-04-08 14:20:57,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#true} assume !(0 == ~cond); {471#true} is VALID [2022-04-08 14:20:57,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-08 14:20:57,267 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#true} {471#true} #53#return; {471#true} is VALID [2022-04-08 14:20:57,270 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:20:57,270 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:20:57,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:20:57,272 INFO L272 TraceCheckUtils]: 14: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {519#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:20:57,272 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:20:57,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {472#false} is VALID [2022-04-08 14:20:57,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-04-08 14:20:57,273 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:20:57,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:20:57,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:20:57,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594242745] [2022-04-08 14:20:57,273 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:20:57,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319701394] [2022-04-08 14:20:57,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319701394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:20:57,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:20:57,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:20:57,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:20:57,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [353781660] [2022-04-08 14:20:57,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [353781660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:20:57,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:20:57,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:20:57,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610373301] [2022-04-08 14:20:57,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:20:57,275 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:20:57,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:20:57,275 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:20:57,291 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:20:57,291 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:20:57,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:20:57,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:20:57,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:20:57,292 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:20:57,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:20:57,488 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 14:20:57,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:20:57,488 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:20:57,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:20:57,488 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:20:57,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 14:20:57,489 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:20:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 14:20:57,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-08 14:20:57,524 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:20:57,526 INFO L225 Difference]: With dead ends: 36 [2022-04-08 14:20:57,526 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 14:20:57,527 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:20:57,533 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:20:57,534 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:20:57,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 14:20:57,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 14:20:57,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:20:57,547 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:20:57,547 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:20:57,547 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:20:57,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:20:57,549 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-08 14:20:57,549 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 14:20:57,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:20:57,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:20:57,549 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:20:57,549 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:20:57,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:20:57,551 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-08 14:20:57,551 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 14:20:57,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:20:57,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:20:57,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:20:57,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:20:57,551 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:20:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-08 14:20:57,552 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-08 14:20:57,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:20:57,553 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-08 14:20:57,553 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:20:57,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-08 14:20:57,577 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:20:57,577 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 14:20:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:20:57,578 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:20:57,578 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:20:57,598 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:20:57,781 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:20:57,782 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:20:57,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:20:57,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-08 14:20:57,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:20:57,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1913824571] [2022-04-08 14:20:57,939 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:20:57,939 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:20:57,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 2 times [2022-04-08 14:20:57,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:20:57,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244034953] [2022-04-08 14:20:57,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:20:57,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:20:57,952 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:20:57,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [899893291] [2022-04-08 14:20:57,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:20:57,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:20:57,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:20:57,953 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:20:57,954 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:20:58,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:20:58,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:20:58,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:20:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:20:58,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:20:58,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-08 14:20:58,193 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:20:58,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:20:58,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {739#(<= ~counter~0 0)} {731#true} #61#return; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:20:58,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {739#(<= ~counter~0 0)} call #t~ret6 := main(); {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:20:58,194 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:20:58,195 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:20:58,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {739#(<= ~counter~0 0)} ~cond := #in~cond; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:20:58,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {739#(<= ~counter~0 0)} assume !(0 == ~cond); {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:20:58,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:20:58,196 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:20:58,197 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:20:58,197 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:20:58,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:20:58,198 INFO L272 TraceCheckUtils]: 14: Hoare triple {773#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:20:58,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#(<= ~counter~0 1)} ~cond := #in~cond; {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:20:58,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#(<= ~counter~0 1)} assume !(0 == ~cond); {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:20:58,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#(<= ~counter~0 1)} assume true; {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:20:58,200 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:20:58,200 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 + ~x~0; {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:20:58,200 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:20:58,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {798#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {732#false} is VALID [2022-04-08 14:20:58,201 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {732#false} is VALID [2022-04-08 14:20:58,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-08 14:20:58,201 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-08 14:20:58,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-08 14:20:58,201 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:20:58,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:20:58,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-08 14:20:58,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-08 14:20:58,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-08 14:20:58,358 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {732#false} is VALID [2022-04-08 14:20:58,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {732#false} is VALID [2022-04-08 14:20:58,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {830#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {826#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:20:58,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {830#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {830#(< ~counter~0 20)} is VALID [2022-04-08 14:20:58,361 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {731#true} {830#(< ~counter~0 20)} #55#return; {830#(< ~counter~0 20)} is VALID [2022-04-08 14:20:58,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-08 14:20:58,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-08 14:20:58,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-08 14:20:58,361 INFO L272 TraceCheckUtils]: 14: Hoare triple {830#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {731#true} is VALID [2022-04-08 14:20:58,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {830#(< ~counter~0 20)} is VALID [2022-04-08 14:20:58,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {830#(< ~counter~0 20)} is VALID [2022-04-08 14:20:58,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {855#(< ~counter~0 19)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {855#(< ~counter~0 19)} is VALID [2022-04-08 14:20:58,363 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {731#true} {855#(< ~counter~0 19)} #53#return; {855#(< ~counter~0 19)} is VALID [2022-04-08 14:20:58,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-08 14:20:58,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-08 14:20:58,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-08 14:20:58,363 INFO L272 TraceCheckUtils]: 6: Hoare triple {855#(< ~counter~0 19)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {731#true} is VALID [2022-04-08 14:20:58,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#(< ~counter~0 19)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {855#(< ~counter~0 19)} is VALID [2022-04-08 14:20:58,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#(< ~counter~0 19)} call #t~ret6 := main(); {855#(< ~counter~0 19)} is VALID [2022-04-08 14:20:58,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#(< ~counter~0 19)} {731#true} #61#return; {855#(< ~counter~0 19)} is VALID [2022-04-08 14:20:58,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#(< ~counter~0 19)} assume true; {855#(< ~counter~0 19)} is VALID [2022-04-08 14:20:58,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {855#(< ~counter~0 19)} is VALID [2022-04-08 14:20:58,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-08 14:20:58,367 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:20:58,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:20:58,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244034953] [2022-04-08 14:20:58,367 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:20:58,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899893291] [2022-04-08 14:20:58,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899893291] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:20:58,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:20:58,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 14:20:58,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:20:58,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1913824571] [2022-04-08 14:20:58,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1913824571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:20:58,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:20:58,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:20:58,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999872663] [2022-04-08 14:20:58,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:20:58,368 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:20:58,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:20:58,369 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:20:58,387 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:20:58,387 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:20:58,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:20:58,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:20:58,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:20:58,388 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:20:58,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:20:58,481 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-08 14:20:58,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 14:20:58,481 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:20:58,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:20:58,481 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:20:58,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-08 14:20:58,483 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:20:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-08 14:20:58,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-08 14:20:58,518 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:20:58,519 INFO L225 Difference]: With dead ends: 42 [2022-04-08 14:20:58,519 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 14:20:58,519 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:20:58,520 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:20:58,520 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:20:58,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 14:20:58,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 14:20:58,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:20:58,537 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:20:58,537 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:20:58,538 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:20:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:20:58,539 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 14:20:58,539 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 14:20:58,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:20:58,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:20:58,540 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:20:58,540 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:20:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:20:58,541 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 14:20:58,541 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 14:20:58,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:20:58,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:20:58,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:20:58,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:20:58,542 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:20:58,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-08 14:20:58,543 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2022-04-08 14:20:58,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:20:58,543 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-08 14:20:58,543 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:20:58,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-08 14:20:58,585 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:20:58,586 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 14:20:58,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:20:58,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:20:58,586 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:20:58,607 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:20:58,803 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:20:58,803 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:20:58,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:20:58,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-08 14:20:58,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:20:58,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [827275235] [2022-04-08 14:20:58,931 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:20:58,931 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:20:58,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 2 times [2022-04-08 14:20:58,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:20:58,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994271927] [2022-04-08 14:20:58,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:20:58,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:20:58,942 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:20:58,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [993860625] [2022-04-08 14:20:58,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:20:58,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:20:58,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:20:58,943 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:20:58,944 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:20:58,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:20:58,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:20:58,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:20:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:20:59,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:20:59,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-08 14:20:59,120 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:20:59,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:20:59,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-08 14:20:59,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-08 14:20:59,120 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:20:59,121 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:20:59,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 14:20:59,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 14:20:59,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:20:59,121 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-08 14:20:59,127 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:20:59,128 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:20:59,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:20:59,128 INFO L272 TraceCheckUtils]: 14: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1116#true} is VALID [2022-04-08 14:20:59,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 14:20:59,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 14:20:59,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:20:59,129 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:20:59,130 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 + ~x~0; {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-08 14:20:59,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-08 14:20:59,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-08 14:20:59,135 INFO L272 TraceCheckUtils]: 22: Hoare triple {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:20:59,136 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:20:59,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-08 14:20:59,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-08 14:20:59,136 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:20:59,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:20:59,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-08 14:20:59,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-08 14:20:59,267 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:20:59,268 INFO L272 TraceCheckUtils]: 22: Hoare triple {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:20:59,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(#t~post5 < 20);havoc #t~post5; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 14:20:59,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 14:21:01,335 WARN L290 TraceCheckUtils]: 19: Hoare triple {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 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 + ~x~0; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is UNKNOWN [2022-04-08 14:21:01,349 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1116#true} {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #55#return; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 14:21:01,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:21:01,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 14:21:01,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 14:21:01,350 INFO L272 TraceCheckUtils]: 14: Hoare triple {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1116#true} is VALID [2022-04-08 14:21:01,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(#t~post5 < 20);havoc #t~post5; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 14:21:01,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 14:21:01,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 14:21:01,360 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-08 14:21:01,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:21:01,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 14:21:01,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 14:21:01,361 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:21:01,361 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:21:01,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-08 14:21:01,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-08 14:21:01,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:21:01,361 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:21:01,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-08 14:21:01,362 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:21:01,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:21:01,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994271927] [2022-04-08 14:21:01,362 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:21:01,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993860625] [2022-04-08 14:21:01,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993860625] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 14:21:01,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:21:01,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 14:21:01,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:21:01,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [827275235] [2022-04-08 14:21:01,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [827275235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:21:01,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:21:01,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:21:01,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530335184] [2022-04-08 14:21:01,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:21:01,363 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:21:01,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:21:01,364 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:21:02,356 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:21:02,356 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:21:02,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:02,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:21:02,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 14:21:02,357 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:21:02,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:02,494 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-08 14:21:02,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:21:02,494 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:21:02,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:21:02,494 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:21:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:21:02,495 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:21:02,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:21:02,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 14:21:04,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:21:04,613 INFO L225 Difference]: With dead ends: 40 [2022-04-08 14:21:04,613 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 14:21:04,614 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:21:04,614 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:21:04,614 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:21:04,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 14:21:04,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 14:21:04,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:21:04,635 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:21:04,636 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:21:04,636 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:21:04,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:04,637 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-08 14:21:04,637 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-08 14:21:04,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:04,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:04,638 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:21:04,638 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:21:04,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:04,639 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-08 14:21:04,639 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-08 14:21:04,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:04,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:04,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:21:04,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:21:04,640 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:21:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-08 14:21:04,640 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2022-04-08 14:21:04,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:21:04,641 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-08 14:21:04,641 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:21:04,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-08 14:21:05,240 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:21:05,241 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-08 14:21:05,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 14:21:05,241 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:21:05,241 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:21:05,246 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:21:05,442 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:21:05,442 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:21:05,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:21:05,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-08 14:21:05,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:05,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2037219268] [2022-04-08 14:21:05,539 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:21:05,539 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:21:05,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 2 times [2022-04-08 14:21:05,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:21:05,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761948581] [2022-04-08 14:21:05,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:21:05,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:21:05,560 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:21:05,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1877008773] [2022-04-08 14:21:05,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:21:05,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:21:05,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:21:05,561 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:21:05,562 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:21:05,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:21:05,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:21:05,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 14:21:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:21:05,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:21:05,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-08 14:21:05,924 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:21:05,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 14:21:05,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} #61#return; {1504#true} is VALID [2022-04-08 14:21:05,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} call #t~ret6 := main(); {1504#true} is VALID [2022-04-08 14:21:05,925 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:21:05,925 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:21:05,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 14:21:05,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 14:21:05,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 14:21:05,925 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1504#true} #53#return; {1504#true} is VALID [2022-04-08 14:21:05,925 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:21:05,926 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:21:05,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:21:05,926 INFO L272 TraceCheckUtils]: 14: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1504#true} is VALID [2022-04-08 14:21:05,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 14:21:05,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 14:21:05,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 14:21:05,927 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:21:05,928 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 + ~x~0; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:21:05,928 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:21:05,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:21:05,928 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 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1504#true} is VALID [2022-04-08 14:21:05,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 14:21:05,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 14:21:05,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 14:21:05,929 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:21:05,930 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:21:05,930 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 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1504#true} is VALID [2022-04-08 14:21:05,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 14:21:05,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 14:21:05,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 14:21:05,931 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:21:05,931 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:21:05,932 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:21:05,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {1615#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1505#false} is VALID [2022-04-08 14:21:05,932 INFO L290 TraceCheckUtils]: 36: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-08 14:21:05,932 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:21:05,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:21:06,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:21:06,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761948581] [2022-04-08 14:21:06,264 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:21:06,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877008773] [2022-04-08 14:21:06,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877008773] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:21:06,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:21:06,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 14:21:06,264 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:21:06,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2037219268] [2022-04-08 14:21:06,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2037219268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:21:06,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:21:06,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:21:06,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938966238] [2022-04-08 14:21:06,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:21:06,265 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:21:06,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:21:06,265 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:21:06,289 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:21:06,289 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:21:06,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:06,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:21:06,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:21:06,290 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:21:06,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:06,519 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-08 14:21:06,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 14:21:06,519 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:21:06,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:21:06,519 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:21:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-08 14:21:06,521 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:21:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-08 14:21:06,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-08 14:21:06,567 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:21:06,568 INFO L225 Difference]: With dead ends: 44 [2022-04-08 14:21:06,568 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 14:21:06,568 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:21:06,568 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:21:06,569 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:21:06,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 14:21:06,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-08 14:21:06,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:21:06,592 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:21:06,592 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:21:06,592 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:21:06,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:06,594 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-08 14:21:06,594 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 14:21:06,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:06,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:06,594 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:21:06,594 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:21:06,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:06,596 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-08 14:21:06,596 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 14:21:06,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:06,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:06,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:21:06,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:21:06,596 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:21:06,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-08 14:21:06,597 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 37 [2022-04-08 14:21:06,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:21:06,597 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-08 14:21:06,597 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:21:06,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-08 14:21:07,682 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:21:07,682 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 14:21:07,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 14:21:07,683 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:21:07,683 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:21:07,698 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:21:07,895 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:21:07,895 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:21:07,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:21:07,896 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 1 times [2022-04-08 14:21:07,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:07,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1942393611] [2022-04-08 14:21:07,990 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:21:07,990 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:21:07,990 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 2 times [2022-04-08 14:21:07,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:21:07,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101888798] [2022-04-08 14:21:07,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:21:07,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:21:07,999 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:21:07,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [393222123] [2022-04-08 14:21:07,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:21:07,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:21:07,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:21:08,002 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:21:08,003 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:21:08,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:21:08,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:21:08,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 14:21:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:21:08,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:21:08,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-08 14:21:08,214 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:21:08,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:08,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1933#(<= ~counter~0 0)} {1925#true} #61#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:08,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {1933#(<= ~counter~0 0)} call #t~ret6 := main(); {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:08,216 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:21:08,216 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:21:08,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#(<= ~counter~0 0)} ~cond := #in~cond; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:08,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#(<= ~counter~0 0)} assume !(0 == ~cond); {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:08,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:08,217 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:21:08,218 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:21:08,218 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:21:08,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {1967#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:08,219 INFO L272 TraceCheckUtils]: 14: Hoare triple {1967#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:08,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {1967#(<= ~counter~0 1)} ~cond := #in~cond; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:08,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {1967#(<= ~counter~0 1)} assume !(0 == ~cond); {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:08,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {1967#(<= ~counter~0 1)} assume true; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:08,220 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:21:08,221 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 + ~x~0; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:08,221 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:21:08,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {1992#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:08,222 INFO L272 TraceCheckUtils]: 22: Hoare triple {1992#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:08,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {1992#(<= ~counter~0 2)} ~cond := #in~cond; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:08,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {1992#(<= ~counter~0 2)} assume !(0 == ~cond); {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:08,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {1992#(<= ~counter~0 2)} assume true; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:08,223 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:21:08,224 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 + ~x~0; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:08,224 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:21:08,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {2017#(<= |main_#t~post5| 2)} assume !(#t~post5 < 20);havoc #t~post5; {1926#false} is VALID [2022-04-08 14:21:08,225 INFO L272 TraceCheckUtils]: 30: Hoare triple {1926#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1926#false} is VALID [2022-04-08 14:21:08,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-08 14:21:08,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {1926#false} assume !(0 == ~cond); {1926#false} is VALID [2022-04-08 14:21:08,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {1926#false} assume true; {1926#false} is VALID [2022-04-08 14:21:08,225 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1926#false} {1926#false} #57#return; {1926#false} is VALID [2022-04-08 14:21:08,225 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:21:08,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-08 14:21:08,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-08 14:21:08,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-08 14:21:08,226 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:21:08,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:21:08,421 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-08 14:21:08,421 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-08 14:21:08,421 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-08 14:21:08,421 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:21:08,421 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1925#true} {1926#false} #57#return; {1926#false} is VALID [2022-04-08 14:21:08,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 14:21:08,422 INFO L290 TraceCheckUtils]: 32: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 14:21:08,422 INFO L290 TraceCheckUtils]: 31: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 14:21:08,422 INFO L272 TraceCheckUtils]: 30: Hoare triple {1926#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1925#true} is VALID [2022-04-08 14:21:08,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {1926#false} is VALID [2022-04-08 14:21:08,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {2079#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2075#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:21:08,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {2079#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2079#(< ~counter~0 20)} is VALID [2022-04-08 14:21:08,428 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1925#true} {2079#(< ~counter~0 20)} #55#return; {2079#(< ~counter~0 20)} is VALID [2022-04-08 14:21:08,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 14:21:08,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 14:21:08,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 14:21:08,428 INFO L272 TraceCheckUtils]: 22: Hoare triple {2079#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1925#true} is VALID [2022-04-08 14:21:08,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {2079#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {2079#(< ~counter~0 20)} is VALID [2022-04-08 14:21:08,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {2104#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2079#(< ~counter~0 20)} is VALID [2022-04-08 14:21:08,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {2104#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2104#(< ~counter~0 19)} is VALID [2022-04-08 14:21:08,430 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1925#true} {2104#(< ~counter~0 19)} #55#return; {2104#(< ~counter~0 19)} is VALID [2022-04-08 14:21:08,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 14:21:08,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 14:21:08,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 14:21:08,430 INFO L272 TraceCheckUtils]: 14: Hoare triple {2104#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1925#true} is VALID [2022-04-08 14:21:08,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {2104#(< ~counter~0 19)} is VALID [2022-04-08 14:21:08,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {2129#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2104#(< ~counter~0 19)} is VALID [2022-04-08 14:21:08,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {2129#(< ~counter~0 18)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2129#(< ~counter~0 18)} is VALID [2022-04-08 14:21:08,431 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1925#true} {2129#(< ~counter~0 18)} #53#return; {2129#(< ~counter~0 18)} is VALID [2022-04-08 14:21:08,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 14:21:08,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 14:21:08,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 14:21:08,432 INFO L272 TraceCheckUtils]: 6: Hoare triple {2129#(< ~counter~0 18)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1925#true} is VALID [2022-04-08 14:21:08,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {2129#(< ~counter~0 18)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2129#(< ~counter~0 18)} is VALID [2022-04-08 14:21:08,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {2129#(< ~counter~0 18)} call #t~ret6 := main(); {2129#(< ~counter~0 18)} is VALID [2022-04-08 14:21:08,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2129#(< ~counter~0 18)} {1925#true} #61#return; {2129#(< ~counter~0 18)} is VALID [2022-04-08 14:21:08,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {2129#(< ~counter~0 18)} assume true; {2129#(< ~counter~0 18)} is VALID [2022-04-08 14:21:08,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2129#(< ~counter~0 18)} is VALID [2022-04-08 14:21:08,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-08 14:21:08,434 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:21:08,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:21:08,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101888798] [2022-04-08 14:21:08,434 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:21:08,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393222123] [2022-04-08 14:21:08,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393222123] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:21:08,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:21:08,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 14:21:08,435 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:21:08,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1942393611] [2022-04-08 14:21:08,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1942393611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:21:08,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:21:08,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:21:08,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072067074] [2022-04-08 14:21:08,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:21:08,435 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:21:08,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:21:08,436 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:21:08,460 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:21:08,460 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 14:21:08,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:08,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 14:21:08,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:21:08,461 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:21:08,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:08,621 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-04-08 14:21:08,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:21:08,622 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:21:08,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:21:08,623 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:21:08,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-08 14:21:08,625 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:21:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-08 14:21:08,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-08 14:21:08,671 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:21:08,672 INFO L225 Difference]: With dead ends: 54 [2022-04-08 14:21:08,672 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 14:21:08,672 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:21:08,673 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:21:08,673 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:21:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 14:21:08,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-08 14:21:08,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:21:08,710 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:21:08,710 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:21:08,711 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:21:08,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:08,713 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-08 14:21:08,713 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 14:21:08,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:08,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:08,713 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:21:08,713 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:21:08,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:08,714 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-08 14:21:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 14:21:08,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:08,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:08,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:21:08,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:21:08,715 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:21:08,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-08 14:21:08,716 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2022-04-08 14:21:08,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:21:08,716 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-08 14:21:08,716 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:21:08,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-08 14:21:09,015 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:21:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 14:21:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 14:21:09,016 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:21:09,016 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:21:09,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 14:21:09,216 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:21:09,217 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:21:09,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:21:09,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 3 times [2022-04-08 14:21:09,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:09,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [868651553] [2022-04-08 14:21:09,314 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:21:09,314 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:21:09,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 4 times [2022-04-08 14:21:09,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:21:09,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346084741] [2022-04-08 14:21:09,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:21:09,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:21:09,323 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:21:09,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1921287112] [2022-04-08 14:21:09,323 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:21:09,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:21:09,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:21:09,324 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:21:09,325 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:21:09,354 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:21:09,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:21:09,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 14:21:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:21:09,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:21:09,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {2456#true} call ULTIMATE.init(); {2456#true} is VALID [2022-04-08 14:21:09,662 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:21:09,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:21:09,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2456#true} {2456#true} #61#return; {2456#true} is VALID [2022-04-08 14:21:09,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {2456#true} call #t~ret6 := main(); {2456#true} is VALID [2022-04-08 14:21:09,662 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:21:09,662 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:21:09,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 14:21:09,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 14:21:09,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:21:09,663 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2456#true} {2456#true} #53#return; {2456#true} is VALID [2022-04-08 14:21:09,663 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:21:09,663 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:21:09,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:21:09,664 INFO L272 TraceCheckUtils]: 14: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2456#true} is VALID [2022-04-08 14:21:09,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 14:21:09,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 14:21:09,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:21:09,665 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:21:09,665 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 + ~x~0; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:21:09,666 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:21:09,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:21:09,666 INFO L272 TraceCheckUtils]: 22: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2456#true} is VALID [2022-04-08 14:21:09,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 14:21:09,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 14:21:09,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:21:09,667 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:21:09,667 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 + ~x~0; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:21:09,668 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:21:09,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:21:09,668 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 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2456#true} is VALID [2022-04-08 14:21:09,668 INFO L290 TraceCheckUtils]: 31: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 14:21:09,668 INFO L290 TraceCheckUtils]: 32: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 14:21:09,668 INFO L290 TraceCheckUtils]: 33: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:21:09,669 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:21:09,670 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:21:09,670 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 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2456#true} is VALID [2022-04-08 14:21:09,670 INFO L290 TraceCheckUtils]: 37: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 14:21:09,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 14:21:09,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:21:09,670 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:21:09,671 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:21:09,672 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:21:09,672 INFO L290 TraceCheckUtils]: 43: Hoare triple {2592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2457#false} is VALID [2022-04-08 14:21:09,672 INFO L290 TraceCheckUtils]: 44: Hoare triple {2457#false} assume !false; {2457#false} is VALID [2022-04-08 14:21:09,672 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:21:09,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:21:09,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:21:09,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346084741] [2022-04-08 14:21:09,959 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:21:09,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921287112] [2022-04-08 14:21:09,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921287112] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:21:09,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:21:09,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 14:21:09,959 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:21:09,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [868651553] [2022-04-08 14:21:09,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [868651553] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:21:09,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:21:09,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:21:09,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741948827] [2022-04-08 14:21:09,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:21:09,960 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:21:09,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:21:09,961 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:21:09,986 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:21:09,986 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:21:09,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:09,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:21:09,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 14:21:09,987 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:21:10,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:10,331 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-08 14:21:10,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:21:10,331 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:21:10,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:21:10,332 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:21:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-08 14:21:10,333 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:21:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-08 14:21:10,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-08 14:21:10,372 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:21:10,373 INFO L225 Difference]: With dead ends: 52 [2022-04-08 14:21:10,373 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 14:21:10,373 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-08 14:21:10,373 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:21:10,373 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:21:10,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 14:21:10,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-08 14:21:10,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:21:10,412 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:21:10,412 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:21:10,414 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:21:10,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:10,415 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-08 14:21:10,415 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-08 14:21:10,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:10,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:10,415 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:21:10,415 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:21:10,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:10,416 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-08 14:21:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-08 14:21:10,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:10,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:10,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:21:10,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:21:10,422 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:21:10,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-04-08 14:21:10,423 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 45 [2022-04-08 14:21:10,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:21:10,424 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-04-08 14:21:10,424 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:21:10,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 49 transitions. [2022-04-08 14:21:10,677 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:21:10,677 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-08 14:21:10,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 14:21:10,678 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:21:10,678 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:21:10,695 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:21:10,879 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:21:10,879 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:21:10,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:21:10,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 3 times [2022-04-08 14:21:10,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:10,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1429844197] [2022-04-08 14:21:10,975 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:21:10,975 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:21:10,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 4 times [2022-04-08 14:21:10,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:21:10,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376513413] [2022-04-08 14:21:10,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:21:10,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:21:10,984 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:21:10,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1146739498] [2022-04-08 14:21:10,985 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:21:10,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:21:10,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:21:10,985 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:21:10,986 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:21:11,022 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:21:11,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:21:11,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:21:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:21:11,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:21:11,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-08 14:21:11,238 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:21:11,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:11,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2958#(<= ~counter~0 0)} {2950#true} #61#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:11,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {2958#(<= ~counter~0 0)} call #t~ret6 := main(); {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:11,239 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:21:11,240 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:21:11,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {2958#(<= ~counter~0 0)} ~cond := #in~cond; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:11,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(<= ~counter~0 0)} assume !(0 == ~cond); {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:11,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:11,241 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:21:11,241 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:21:11,242 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:21:11,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {2992#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:11,243 INFO L272 TraceCheckUtils]: 14: Hoare triple {2992#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:11,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {2992#(<= ~counter~0 1)} ~cond := #in~cond; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:11,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {2992#(<= ~counter~0 1)} assume !(0 == ~cond); {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:11,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {2992#(<= ~counter~0 1)} assume true; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:11,244 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:21:11,244 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 + ~x~0; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:11,245 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:21:11,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {3017#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:11,245 INFO L272 TraceCheckUtils]: 22: Hoare triple {3017#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:11,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {3017#(<= ~counter~0 2)} ~cond := #in~cond; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:11,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {3017#(<= ~counter~0 2)} assume !(0 == ~cond); {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:11,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {3017#(<= ~counter~0 2)} assume true; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:11,246 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:21:11,247 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 + ~x~0; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:11,247 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:21:11,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {3042#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:11,248 INFO L272 TraceCheckUtils]: 30: Hoare triple {3042#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:11,248 INFO L290 TraceCheckUtils]: 31: Hoare triple {3042#(<= ~counter~0 3)} ~cond := #in~cond; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:11,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {3042#(<= ~counter~0 3)} assume !(0 == ~cond); {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:11,249 INFO L290 TraceCheckUtils]: 33: Hoare triple {3042#(<= ~counter~0 3)} assume true; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:11,249 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:21:11,249 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 + ~x~0; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:11,250 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:21:11,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {3067#(<= |main_#t~post5| 3)} assume !(#t~post5 < 20);havoc #t~post5; {2951#false} is VALID [2022-04-08 14:21:11,250 INFO L272 TraceCheckUtils]: 38: Hoare triple {2951#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2951#false} is VALID [2022-04-08 14:21:11,250 INFO L290 TraceCheckUtils]: 39: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-08 14:21:11,250 INFO L290 TraceCheckUtils]: 40: Hoare triple {2951#false} assume !(0 == ~cond); {2951#false} is VALID [2022-04-08 14:21:11,250 INFO L290 TraceCheckUtils]: 41: Hoare triple {2951#false} assume true; {2951#false} is VALID [2022-04-08 14:21:11,251 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2951#false} {2951#false} #57#return; {2951#false} is VALID [2022-04-08 14:21:11,251 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:21:11,251 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-08 14:21:11,251 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-08 14:21:11,251 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-08 14:21:11,251 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:21:11,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:21:11,472 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-08 14:21:11,472 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-08 14:21:11,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-08 14:21:11,472 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:21:11,472 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2950#true} {2951#false} #57#return; {2951#false} is VALID [2022-04-08 14:21:11,473 INFO L290 TraceCheckUtils]: 41: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 14:21:11,473 INFO L290 TraceCheckUtils]: 40: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 14:21:11,473 INFO L290 TraceCheckUtils]: 39: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 14:21:11,473 INFO L272 TraceCheckUtils]: 38: Hoare triple {2951#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2950#true} is VALID [2022-04-08 14:21:11,474 INFO L290 TraceCheckUtils]: 37: Hoare triple {3125#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {2951#false} is VALID [2022-04-08 14:21:11,474 INFO L290 TraceCheckUtils]: 36: Hoare triple {3129#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3125#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:21:11,475 INFO L290 TraceCheckUtils]: 35: Hoare triple {3129#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3129#(< ~counter~0 20)} is VALID [2022-04-08 14:21:11,475 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2950#true} {3129#(< ~counter~0 20)} #55#return; {3129#(< ~counter~0 20)} is VALID [2022-04-08 14:21:11,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 14:21:11,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 14:21:11,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 14:21:11,475 INFO L272 TraceCheckUtils]: 30: Hoare triple {3129#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2950#true} is VALID [2022-04-08 14:21:11,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {3129#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {3129#(< ~counter~0 20)} is VALID [2022-04-08 14:21:11,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {3154#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3129#(< ~counter~0 20)} is VALID [2022-04-08 14:21:11,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {3154#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3154#(< ~counter~0 19)} is VALID [2022-04-08 14:21:11,477 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2950#true} {3154#(< ~counter~0 19)} #55#return; {3154#(< ~counter~0 19)} is VALID [2022-04-08 14:21:11,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 14:21:11,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 14:21:11,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 14:21:11,477 INFO L272 TraceCheckUtils]: 22: Hoare triple {3154#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2950#true} is VALID [2022-04-08 14:21:11,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {3154#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {3154#(< ~counter~0 19)} is VALID [2022-04-08 14:21:11,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {3179#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3154#(< ~counter~0 19)} is VALID [2022-04-08 14:21:11,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {3179#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3179#(< ~counter~0 18)} is VALID [2022-04-08 14:21:11,479 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2950#true} {3179#(< ~counter~0 18)} #55#return; {3179#(< ~counter~0 18)} is VALID [2022-04-08 14:21:11,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 14:21:11,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 14:21:11,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 14:21:11,479 INFO L272 TraceCheckUtils]: 14: Hoare triple {3179#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2950#true} is VALID [2022-04-08 14:21:11,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {3179#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {3179#(< ~counter~0 18)} is VALID [2022-04-08 14:21:11,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {3204#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3179#(< ~counter~0 18)} is VALID [2022-04-08 14:21:11,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {3204#(< ~counter~0 17)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3204#(< ~counter~0 17)} is VALID [2022-04-08 14:21:11,481 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2950#true} {3204#(< ~counter~0 17)} #53#return; {3204#(< ~counter~0 17)} is VALID [2022-04-08 14:21:11,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 14:21:11,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 14:21:11,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 14:21:11,481 INFO L272 TraceCheckUtils]: 6: Hoare triple {3204#(< ~counter~0 17)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2950#true} is VALID [2022-04-08 14:21:11,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {3204#(< ~counter~0 17)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3204#(< ~counter~0 17)} is VALID [2022-04-08 14:21:11,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {3204#(< ~counter~0 17)} call #t~ret6 := main(); {3204#(< ~counter~0 17)} is VALID [2022-04-08 14:21:11,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3204#(< ~counter~0 17)} {2950#true} #61#return; {3204#(< ~counter~0 17)} is VALID [2022-04-08 14:21:11,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#(< ~counter~0 17)} assume true; {3204#(< ~counter~0 17)} is VALID [2022-04-08 14:21:11,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {2950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3204#(< ~counter~0 17)} is VALID [2022-04-08 14:21:11,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-08 14:21:11,483 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:21:11,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:21:11,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376513413] [2022-04-08 14:21:11,483 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:21:11,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146739498] [2022-04-08 14:21:11,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146739498] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:21:11,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:21:11,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 14:21:11,484 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:21:11,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1429844197] [2022-04-08 14:21:11,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1429844197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:21:11,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:21:11,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:21:11,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675988691] [2022-04-08 14:21:11,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:21:11,484 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:21:11,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:21:11,485 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:21:11,522 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:21:11,522 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:21:11,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:11,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:21:11,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:21:11,523 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:21:11,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:11,713 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-04-08 14:21:11,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 14:21:11,713 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:21:11,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:21:11,713 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:21:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-08 14:21:11,715 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:21:11,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-08 14:21:11,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-08 14:21:11,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:21:11,756 INFO L225 Difference]: With dead ends: 62 [2022-04-08 14:21:11,756 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 14:21:11,757 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:21:11,757 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:21:11,757 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:21:11,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 14:21:11,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-08 14:21:11,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:21:11,805 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:21:11,805 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:21:11,806 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:21:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:11,808 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-08 14:21:11,808 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-08 14:21:11,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:11,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:11,808 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:21:11,808 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:21:11,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:11,814 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-08 14:21:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-08 14:21:11,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:11,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:11,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:21:11,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:21:11,815 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:21:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-08 14:21:11,819 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2022-04-08 14:21:11,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:21:11,819 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-08 14:21:11,819 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:21:11,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2022-04-08 14:21:12,078 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:21:12,079 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-08 14:21:12,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-08 14:21:12,079 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:21:12,079 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:21:12,095 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:21:12,283 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:21:12,283 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:21:12,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:21:12,284 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 5 times [2022-04-08 14:21:12,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:12,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [510129145] [2022-04-08 14:21:12,400 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:21:12,400 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:21:12,400 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 6 times [2022-04-08 14:21:12,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:21:12,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967960871] [2022-04-08 14:21:12,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:21:12,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:21:12,409 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:21:12,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1527641259] [2022-04-08 14:21:12,410 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:21:12,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:21:12,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:21:12,410 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:21:12,411 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:21:12,782 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 14:21:12,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:21:12,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 14:21:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:21:12,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:21:13,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {3581#true} call ULTIMATE.init(); {3581#true} is VALID [2022-04-08 14:21:13,100 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:21:13,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:21:13,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3581#true} {3581#true} #61#return; {3581#true} is VALID [2022-04-08 14:21:13,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {3581#true} call #t~ret6 := main(); {3581#true} is VALID [2022-04-08 14:21:13,100 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:21:13,100 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:21:13,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:21:13,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:21:13,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:21:13,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3581#true} {3581#true} #53#return; {3581#true} is VALID [2022-04-08 14:21:13,103 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:21:13,103 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:21:13,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:21:13,103 INFO L272 TraceCheckUtils]: 14: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3581#true} is VALID [2022-04-08 14:21:13,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:21:13,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:21:13,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:21:13,104 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:21:13,105 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 + ~x~0; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:21:13,105 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:21:13,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:21:13,105 INFO L272 TraceCheckUtils]: 22: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3581#true} is VALID [2022-04-08 14:21:13,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:21:13,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:21:13,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:21:13,106 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:21:13,107 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 + ~x~0; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:21:13,107 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:21:13,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:21:13,107 INFO L272 TraceCheckUtils]: 30: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3581#true} is VALID [2022-04-08 14:21:13,107 INFO L290 TraceCheckUtils]: 31: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:21:13,108 INFO L290 TraceCheckUtils]: 32: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:21:13,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:21:13,108 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:21:13,108 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 + ~x~0; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 14:21:13,109 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:21:13,109 INFO L290 TraceCheckUtils]: 37: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 14:21:13,109 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 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3581#true} is VALID [2022-04-08 14:21:13,109 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:21:13,109 INFO L290 TraceCheckUtils]: 40: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:21:13,110 INFO L290 TraceCheckUtils]: 41: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:21:13,110 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:21:13,111 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:21:13,111 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 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3581#true} is VALID [2022-04-08 14:21:13,111 INFO L290 TraceCheckUtils]: 45: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:21:13,111 INFO L290 TraceCheckUtils]: 46: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:21:13,111 INFO L290 TraceCheckUtils]: 47: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:21:13,111 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:21:13,113 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:21:13,113 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:21:13,114 INFO L290 TraceCheckUtils]: 51: Hoare triple {3742#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3582#false} is VALID [2022-04-08 14:21:13,114 INFO L290 TraceCheckUtils]: 52: Hoare triple {3582#false} assume !false; {3582#false} is VALID [2022-04-08 14:21:13,114 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:21:13,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:21:13,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:21:13,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967960871] [2022-04-08 14:21:13,366 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:21:13,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527641259] [2022-04-08 14:21:13,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527641259] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:21:13,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:21:13,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 14:21:13,367 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:21:13,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [510129145] [2022-04-08 14:21:13,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [510129145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:21:13,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:21:13,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 14:21:13,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280774055] [2022-04-08 14:21:13,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:21:13,367 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:21:13,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:21:13,368 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:21:13,407 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:21:13,408 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 14:21:13,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:13,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 14:21:13,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:21:13,408 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:21:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:13,809 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-08 14:21:13,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 14:21:13,809 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:21:13,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:21:13,809 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:21:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-08 14:21:13,811 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:21:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-08 14:21:13,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-08 14:21:13,849 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:21:13,850 INFO L225 Difference]: With dead ends: 60 [2022-04-08 14:21:13,850 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 14:21:13,851 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:21:13,851 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:21:13,851 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:21:13,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 14:21:13,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-08 14:21:13,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:21:13,900 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:21:13,900 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:21:13,900 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:21:13,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:13,901 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-08 14:21:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-08 14:21:13,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:13,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:13,902 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:21:13,902 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:21:13,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:13,903 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-08 14:21:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-08 14:21:13,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:13,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:13,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:21:13,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:21:13,903 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:21:13,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-08 14:21:13,904 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-08 14:21:13,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:21:13,904 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-08 14:21:13,904 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:21:13,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 57 transitions. [2022-04-08 14:21:14,399 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:21:14,399 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-08 14:21:14,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 14:21:14,400 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:21:14,400 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:21:14,405 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:21:14,604 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:21:14,605 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:21:14,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:21:14,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 5 times [2022-04-08 14:21:14,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:14,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1213444408] [2022-04-08 14:21:14,699 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:21:14,700 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:21:14,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 6 times [2022-04-08 14:21:14,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:21:14,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024524318] [2022-04-08 14:21:14,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:21:14,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:21:14,710 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:21:14,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2114565369] [2022-04-08 14:21:14,710 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:21:14,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:21:14,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:21:14,711 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:21:14,737 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:21:15,094 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 14:21:15,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:21:15,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 14:21:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:21:15,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:21:15,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-08 14:21:15,346 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:21:15,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:15,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4156#(<= ~counter~0 0)} {4148#true} #61#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:15,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {4156#(<= ~counter~0 0)} call #t~ret6 := main(); {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:15,348 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:21:15,348 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:21:15,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {4156#(<= ~counter~0 0)} ~cond := #in~cond; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:15,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {4156#(<= ~counter~0 0)} assume !(0 == ~cond); {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:15,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:15,350 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:21:15,350 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:21:15,350 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:21:15,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {4190#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:15,351 INFO L272 TraceCheckUtils]: 14: Hoare triple {4190#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:15,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {4190#(<= ~counter~0 1)} ~cond := #in~cond; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:15,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {4190#(<= ~counter~0 1)} assume !(0 == ~cond); {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:15,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {4190#(<= ~counter~0 1)} assume true; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:15,353 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:21:15,353 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 + ~x~0; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:15,353 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:21:15,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {4215#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:15,354 INFO L272 TraceCheckUtils]: 22: Hoare triple {4215#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:15,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {4215#(<= ~counter~0 2)} ~cond := #in~cond; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:15,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {4215#(<= ~counter~0 2)} assume !(0 == ~cond); {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:15,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {4215#(<= ~counter~0 2)} assume true; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:15,355 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:21:15,356 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 + ~x~0; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:15,356 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:21:15,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {4240#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:15,357 INFO L272 TraceCheckUtils]: 30: Hoare triple {4240#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:15,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {4240#(<= ~counter~0 3)} ~cond := #in~cond; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:15,360 INFO L290 TraceCheckUtils]: 32: Hoare triple {4240#(<= ~counter~0 3)} assume !(0 == ~cond); {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:15,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {4240#(<= ~counter~0 3)} assume true; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:15,362 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:21:15,362 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 + ~x~0; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:15,363 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:21:15,366 INFO L290 TraceCheckUtils]: 37: Hoare triple {4265#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:15,366 INFO L272 TraceCheckUtils]: 38: Hoare triple {4265#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:15,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {4265#(<= ~counter~0 4)} ~cond := #in~cond; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:15,367 INFO L290 TraceCheckUtils]: 40: Hoare triple {4265#(<= ~counter~0 4)} assume !(0 == ~cond); {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:15,367 INFO L290 TraceCheckUtils]: 41: Hoare triple {4265#(<= ~counter~0 4)} assume true; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:15,367 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:21:15,368 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 + ~x~0; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:15,368 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:21:15,368 INFO L290 TraceCheckUtils]: 45: Hoare triple {4290#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {4149#false} is VALID [2022-04-08 14:21:15,368 INFO L272 TraceCheckUtils]: 46: Hoare triple {4149#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4149#false} is VALID [2022-04-08 14:21:15,369 INFO L290 TraceCheckUtils]: 47: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-08 14:21:15,369 INFO L290 TraceCheckUtils]: 48: Hoare triple {4149#false} assume !(0 == ~cond); {4149#false} is VALID [2022-04-08 14:21:15,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {4149#false} assume true; {4149#false} is VALID [2022-04-08 14:21:15,369 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4149#false} {4149#false} #57#return; {4149#false} is VALID [2022-04-08 14:21:15,369 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:21:15,369 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-08 14:21:15,369 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-08 14:21:15,369 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-08 14:21:15,369 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:21:15,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:21:15,620 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-08 14:21:15,620 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-08 14:21:15,620 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-08 14:21:15,620 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:21:15,620 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4148#true} {4149#false} #57#return; {4149#false} is VALID [2022-04-08 14:21:15,620 INFO L290 TraceCheckUtils]: 49: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:21:15,620 INFO L290 TraceCheckUtils]: 48: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:21:15,620 INFO L290 TraceCheckUtils]: 47: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:21:15,620 INFO L272 TraceCheckUtils]: 46: Hoare triple {4149#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4148#true} is VALID [2022-04-08 14:21:15,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {4348#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {4149#false} is VALID [2022-04-08 14:21:15,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {4352#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4348#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:21:15,621 INFO L290 TraceCheckUtils]: 43: Hoare triple {4352#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4352#(< ~counter~0 20)} is VALID [2022-04-08 14:21:15,622 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4148#true} {4352#(< ~counter~0 20)} #55#return; {4352#(< ~counter~0 20)} is VALID [2022-04-08 14:21:15,622 INFO L290 TraceCheckUtils]: 41: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:21:15,622 INFO L290 TraceCheckUtils]: 40: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:21:15,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:21:15,622 INFO L272 TraceCheckUtils]: 38: Hoare triple {4352#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4148#true} is VALID [2022-04-08 14:21:15,622 INFO L290 TraceCheckUtils]: 37: Hoare triple {4352#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {4352#(< ~counter~0 20)} is VALID [2022-04-08 14:21:15,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {4377#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4352#(< ~counter~0 20)} is VALID [2022-04-08 14:21:15,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {4377#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4377#(< ~counter~0 19)} is VALID [2022-04-08 14:21:15,623 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4148#true} {4377#(< ~counter~0 19)} #55#return; {4377#(< ~counter~0 19)} is VALID [2022-04-08 14:21:15,624 INFO L290 TraceCheckUtils]: 33: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:21:15,624 INFO L290 TraceCheckUtils]: 32: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:21:15,624 INFO L290 TraceCheckUtils]: 31: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:21:15,624 INFO L272 TraceCheckUtils]: 30: Hoare triple {4377#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4148#true} is VALID [2022-04-08 14:21:15,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {4377#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {4377#(< ~counter~0 19)} is VALID [2022-04-08 14:21:15,629 INFO L290 TraceCheckUtils]: 28: Hoare triple {4402#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4377#(< ~counter~0 19)} is VALID [2022-04-08 14:21:15,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {4402#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4402#(< ~counter~0 18)} is VALID [2022-04-08 14:21:15,629 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4148#true} {4402#(< ~counter~0 18)} #55#return; {4402#(< ~counter~0 18)} is VALID [2022-04-08 14:21:15,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:21:15,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:21:15,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:21:15,630 INFO L272 TraceCheckUtils]: 22: Hoare triple {4402#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4148#true} is VALID [2022-04-08 14:21:15,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {4402#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {4402#(< ~counter~0 18)} is VALID [2022-04-08 14:21:15,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {4427#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4402#(< ~counter~0 18)} is VALID [2022-04-08 14:21:15,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {4427#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4427#(< ~counter~0 17)} is VALID [2022-04-08 14:21:15,631 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4148#true} {4427#(< ~counter~0 17)} #55#return; {4427#(< ~counter~0 17)} is VALID [2022-04-08 14:21:15,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:21:15,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:21:15,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:21:15,631 INFO L272 TraceCheckUtils]: 14: Hoare triple {4427#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4148#true} is VALID [2022-04-08 14:21:15,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {4427#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {4427#(< ~counter~0 17)} is VALID [2022-04-08 14:21:15,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {4452#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4427#(< ~counter~0 17)} is VALID [2022-04-08 14:21:15,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {4452#(< ~counter~0 16)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4452#(< ~counter~0 16)} is VALID [2022-04-08 14:21:15,632 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4148#true} {4452#(< ~counter~0 16)} #53#return; {4452#(< ~counter~0 16)} is VALID [2022-04-08 14:21:15,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:21:15,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:21:15,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:21:15,633 INFO L272 TraceCheckUtils]: 6: Hoare triple {4452#(< ~counter~0 16)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4148#true} is VALID [2022-04-08 14:21:15,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {4452#(< ~counter~0 16)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4452#(< ~counter~0 16)} is VALID [2022-04-08 14:21:15,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {4452#(< ~counter~0 16)} call #t~ret6 := main(); {4452#(< ~counter~0 16)} is VALID [2022-04-08 14:21:15,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4452#(< ~counter~0 16)} {4148#true} #61#return; {4452#(< ~counter~0 16)} is VALID [2022-04-08 14:21:15,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {4452#(< ~counter~0 16)} assume true; {4452#(< ~counter~0 16)} is VALID [2022-04-08 14:21:15,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4452#(< ~counter~0 16)} is VALID [2022-04-08 14:21:15,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-08 14:21:15,640 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:21:15,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:21:15,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024524318] [2022-04-08 14:21:15,640 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:21:15,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114565369] [2022-04-08 14:21:15,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114565369] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:21:15,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:21:15,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 14:21:15,641 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:21:15,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1213444408] [2022-04-08 14:21:15,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1213444408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:21:15,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:21:15,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:21:15,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913934867] [2022-04-08 14:21:15,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:21:15,642 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:21:15,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:21:15,642 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:21:15,678 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:21:15,678 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:21:15,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:15,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:21:15,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:21:15,679 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:21:15,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:15,864 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-04-08 14:21:15,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 14:21:15,865 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:21:15,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:21:15,865 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:21:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-08 14:21:15,866 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:21:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-08 14:21:15,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2022-04-08 14:21:15,912 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:21:15,913 INFO L225 Difference]: With dead ends: 70 [2022-04-08 14:21:15,913 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 14:21:15,914 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:21:15,914 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:21:15,914 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:21:15,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 14:21:15,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-08 14:21:15,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:21:15,963 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:21:15,963 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:21:15,964 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:21:15,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:15,965 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-08 14:21:15,965 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-08 14:21:15,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:15,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:15,965 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:21:15,965 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:21:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:15,966 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-08 14:21:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-08 14:21:15,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:15,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:15,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:21:15,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:21:15,966 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:21:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-08 14:21:15,967 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2022-04-08 14:21:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:21:15,967 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-08 14:21:15,968 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:21:15,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions. [2022-04-08 14:21:16,257 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:21:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-08 14:21:16,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 14:21:16,257 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:21:16,258 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:21:16,262 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:21:16,458 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:21:16,458 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:21:16,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:21:16,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 7 times [2022-04-08 14:21:16,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:16,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [621640888] [2022-04-08 14:21:16,575 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:21:16,575 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:21:16,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 8 times [2022-04-08 14:21:16,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:21:16,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583259878] [2022-04-08 14:21:16,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:21:16,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:21:16,585 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:21:16,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1746687462] [2022-04-08 14:21:16,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:21:16,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:21:16,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:21:16,586 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:21:16,587 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:21:17,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:21:17,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:21:17,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-08 14:21:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:21:17,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:21:17,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {4879#true} call ULTIMATE.init(); {4879#true} is VALID [2022-04-08 14:21:17,560 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:21:17,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:21:17,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4879#true} {4879#true} #61#return; {4879#true} is VALID [2022-04-08 14:21:17,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {4879#true} call #t~ret6 := main(); {4879#true} is VALID [2022-04-08 14:21:17,560 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:21:17,560 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:21:17,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:21:17,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:21:17,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:21:17,561 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4879#true} {4879#true} #53#return; {4879#true} is VALID [2022-04-08 14:21:17,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {4879#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:21:17,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:21:17,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:21:17,562 INFO L272 TraceCheckUtils]: 14: Hoare triple {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 14:21:17,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:21:17,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:21:17,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:21:17,562 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4879#true} {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #55#return; {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:21:17,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:21:17,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:21:17,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:21:17,564 INFO L272 TraceCheckUtils]: 22: Hoare triple {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 14:21:17,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#true} ~cond := #in~cond; {4955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:21:17,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {4955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:21:17,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:21:17,565 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:21:17,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 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 + ~x~0; {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} is VALID [2022-04-08 14:21:17,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} is VALID [2022-04-08 14:21:17,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} is VALID [2022-04-08 14:21:17,566 INFO L272 TraceCheckUtils]: 30: Hoare triple {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 14:21:17,567 INFO L290 TraceCheckUtils]: 31: Hoare triple {4879#true} ~cond := #in~cond; {4955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:21:17,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {4955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:21:17,567 INFO L290 TraceCheckUtils]: 33: Hoare triple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:21:17,568 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} #55#return; {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} is VALID [2022-04-08 14:21:17,569 INFO L290 TraceCheckUtils]: 35: Hoare triple {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~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 + ~x~0; {4994#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (+ (* (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (* (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0)))) (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:21:17,569 INFO L290 TraceCheckUtils]: 36: Hoare triple {4994#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (+ (* (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (* (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0)))) (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4994#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (+ (* (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (* (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0)))) (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:21:17,570 INFO L290 TraceCheckUtils]: 37: Hoare triple {4994#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (+ (* (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (* (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0)))) (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {4994#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (+ (* (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (* (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0)))) (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:21:17,570 INFO L272 TraceCheckUtils]: 38: Hoare triple {4994#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (+ (* (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (* (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0)))) (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 14:21:17,570 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#true} ~cond := #in~cond; {4955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:21:17,571 INFO L290 TraceCheckUtils]: 40: Hoare triple {4955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:21:17,571 INFO L290 TraceCheckUtils]: 41: Hoare triple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:21:17,572 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} {4994#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (+ (* (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (* (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0)))) (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} #55#return; {5016#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:21:17,572 INFO L290 TraceCheckUtils]: 43: Hoare triple {5016#(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 + ~x~0; {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:21:17,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:21:17,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:21:17,573 INFO L272 TraceCheckUtils]: 46: Hoare triple {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 14:21:17,573 INFO L290 TraceCheckUtils]: 47: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:21:17,573 INFO L290 TraceCheckUtils]: 48: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:21:17,573 INFO L290 TraceCheckUtils]: 49: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:21:17,573 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4879#true} {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #55#return; {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:21:17,574 INFO L290 TraceCheckUtils]: 51: Hoare triple {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {5045#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 14:21:17,574 INFO L272 TraceCheckUtils]: 52: Hoare triple {5045#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 14:21:17,574 INFO L290 TraceCheckUtils]: 53: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:21:17,574 INFO L290 TraceCheckUtils]: 54: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:21:17,574 INFO L290 TraceCheckUtils]: 55: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:21:17,575 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4879#true} {5045#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #57#return; {5045#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 14:21:17,575 INFO L272 TraceCheckUtils]: 57: Hoare triple {5045#(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)); {5064#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:21:17,575 INFO L290 TraceCheckUtils]: 58: Hoare triple {5064#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5068#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:21:17,576 INFO L290 TraceCheckUtils]: 59: Hoare triple {5068#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4880#false} is VALID [2022-04-08 14:21:17,576 INFO L290 TraceCheckUtils]: 60: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2022-04-08 14:21:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 61 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-04-08 14:21:17,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:21:18,790 INFO L290 TraceCheckUtils]: 60: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2022-04-08 14:21:18,791 INFO L290 TraceCheckUtils]: 59: Hoare triple {5068#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4880#false} is VALID [2022-04-08 14:21:18,791 INFO L290 TraceCheckUtils]: 58: Hoare triple {5064#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5068#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:21:18,791 INFO L272 TraceCheckUtils]: 57: Hoare triple {5084#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5064#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:21:18,792 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4879#true} {5084#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} #57#return; {5084#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} is VALID [2022-04-08 14:21:18,792 INFO L290 TraceCheckUtils]: 55: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:21:18,792 INFO L290 TraceCheckUtils]: 54: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:21:18,792 INFO L290 TraceCheckUtils]: 53: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:21:18,792 INFO L272 TraceCheckUtils]: 52: Hoare triple {5084#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 14:21:18,806 INFO L290 TraceCheckUtils]: 51: Hoare triple {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} assume !(~c~0 < ~k~0); {5084#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} is VALID [2022-04-08 14:21:18,807 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4879#true} {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} #55#return; {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} is VALID [2022-04-08 14:21:18,807 INFO L290 TraceCheckUtils]: 49: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:21:18,807 INFO L290 TraceCheckUtils]: 48: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:21:18,807 INFO L290 TraceCheckUtils]: 47: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:21:18,807 INFO L272 TraceCheckUtils]: 46: Hoare triple {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 14:21:18,808 INFO L290 TraceCheckUtils]: 45: Hoare triple {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} is VALID [2022-04-08 14:21:18,808 INFO L290 TraceCheckUtils]: 44: Hoare triple {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} is VALID [2022-04-08 14:21:18,810 INFO L290 TraceCheckUtils]: 43: Hoare triple {5128#(or (not (< main_~c~0 main_~k~0)) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} is VALID [2022-04-08 14:21:18,829 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} {5132#(or (not (< main_~c~0 main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} #55#return; {5128#(or (not (< main_~c~0 main_~k~0)) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} is VALID [2022-04-08 14:21:18,829 INFO L290 TraceCheckUtils]: 41: Hoare triple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:21:18,830 INFO L290 TraceCheckUtils]: 40: Hoare triple {5142#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:21:18,830 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#true} ~cond := #in~cond; {5142#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:21:18,830 INFO L272 TraceCheckUtils]: 38: Hoare triple {5132#(or (not (< main_~c~0 main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 14:21:18,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {5132#(or (not (< main_~c~0 main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} assume !!(#t~post5 < 20);havoc #t~post5; {5132#(or (not (< main_~c~0 main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} is VALID [2022-04-08 14:21:18,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {5132#(or (not (< main_~c~0 main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5132#(or (not (< main_~c~0 main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} is VALID [2022-04-08 14:21:19,160 INFO L290 TraceCheckUtils]: 35: Hoare triple {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5132#(or (not (< main_~c~0 main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} is VALID [2022-04-08 14:21:19,161 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4879#true} {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} #55#return; {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} is VALID [2022-04-08 14:21:19,161 INFO L290 TraceCheckUtils]: 33: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:21:19,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:21:19,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:21:19,161 INFO L272 TraceCheckUtils]: 30: Hoare triple {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 14:21:19,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} assume !!(#t~post5 < 20);havoc #t~post5; {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} is VALID [2022-04-08 14:21:19,163 INFO L290 TraceCheckUtils]: 28: Hoare triple {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} is VALID [2022-04-08 14:21:21,165 WARN L290 TraceCheckUtils]: 27: Hoare triple {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} is UNKNOWN [2022-04-08 14:21:21,166 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4879#true} {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} #55#return; {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} is VALID [2022-04-08 14:21:21,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:21:21,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:21:21,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:21:21,166 INFO L272 TraceCheckUtils]: 22: Hoare triple {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 14:21:21,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} is VALID [2022-04-08 14:21:21,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} is VALID [2022-04-08 14:21:23,226 WARN L290 TraceCheckUtils]: 19: Hoare triple {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) 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 + ~x~0; {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} is UNKNOWN [2022-04-08 14:21:23,227 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4879#true} {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} #55#return; {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} is VALID [2022-04-08 14:21:23,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:21:23,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:21:23,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:21:23,227 INFO L272 TraceCheckUtils]: 14: Hoare triple {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 14:21:23,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} is VALID [2022-04-08 14:21:23,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} is VALID [2022-04-08 14:21:23,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {4879#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} is VALID [2022-04-08 14:21:23,230 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4879#true} {4879#true} #53#return; {4879#true} is VALID [2022-04-08 14:21:23,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:21:23,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:21:23,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:21:23,230 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:21:23,230 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:21:23,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {4879#true} call #t~ret6 := main(); {4879#true} is VALID [2022-04-08 14:21:23,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4879#true} {4879#true} #61#return; {4879#true} is VALID [2022-04-08 14:21:23,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:21:23,231 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:21:23,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {4879#true} call ULTIMATE.init(); {4879#true} is VALID [2022-04-08 14:21:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 20 proven. 47 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 14:21:23,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:21:23,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583259878] [2022-04-08 14:21:23,231 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:21:23,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746687462] [2022-04-08 14:21:23,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746687462] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:21:23,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:21:23,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-08 14:21:23,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:21:23,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [621640888] [2022-04-08 14:21:23,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [621640888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:21:23,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:21:23,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 14:21:23,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601099807] [2022-04-08 14:21:23,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:21:23,233 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 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:21:23,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:21:23,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 14:21:23,271 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:21:23,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 14:21:23,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:23,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 14:21:23,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-04-08 14:21:23,271 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 14:21:24,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:24,197 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-08 14:21:24,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 14:21:24,197 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 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:21:24,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:21:24,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 14:21:24,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2022-04-08 14:21:24,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 14:21:24,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2022-04-08 14:21:24,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 61 transitions. [2022-04-08 14:21:24,255 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:21:24,256 INFO L225 Difference]: With dead ends: 68 [2022-04-08 14:21:24,257 INFO L226 Difference]: Without dead ends: 62 [2022-04-08 14:21:24,257 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:21:24,257 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 14 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 14:21:24,257 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 255 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 14:21:24,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-08 14:21:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-08 14:21:24,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:21:24,313 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:21:24,313 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:21:24,313 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:21:24,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:24,315 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-08 14:21:24,315 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-08 14:21:24,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:24,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:24,315 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:21:24,315 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:21:24,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:24,316 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-08 14:21:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-08 14:21:24,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:24,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:24,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:21:24,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:21:24,317 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:21:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-08 14:21:24,318 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 61 [2022-04-08 14:21:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:21:24,318 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-08 14:21:24,318 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 14:21:24,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2022-04-08 14:21:24,621 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:21:24,622 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-08 14:21:24,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 14:21:24,623 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:21:24,623 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:21:24,630 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:21:24,824 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:21:24,824 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:21:24,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:21:24,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 7 times [2022-04-08 14:21:24,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:24,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2120267434] [2022-04-08 14:21:24,906 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:21:24,906 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:21:24,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 8 times [2022-04-08 14:21:24,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:21:24,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521856707] [2022-04-08 14:21:24,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:21:24,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:21:24,918 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:21:24,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2130371635] [2022-04-08 14:21:24,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:21:24,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:21:24,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:21:24,919 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:21:24,920 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:21:24,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:21:24,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:21:24,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 14:21:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:21:24,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:21:25,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {5655#true} call ULTIMATE.init(); {5655#true} is VALID [2022-04-08 14:21:25,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {5655#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; {5663#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:25,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {5663#(<= ~counter~0 0)} assume true; {5663#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:25,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5663#(<= ~counter~0 0)} {5655#true} #61#return; {5663#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:25,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {5663#(<= ~counter~0 0)} call #t~ret6 := main(); {5663#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:25,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {5663#(<= ~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; {5663#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:25,252 INFO L272 TraceCheckUtils]: 6: Hoare triple {5663#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5663#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:25,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {5663#(<= ~counter~0 0)} ~cond := #in~cond; {5663#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:25,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {5663#(<= ~counter~0 0)} assume !(0 == ~cond); {5663#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:25,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {5663#(<= ~counter~0 0)} assume true; {5663#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:25,253 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5663#(<= ~counter~0 0)} {5663#(<= ~counter~0 0)} #53#return; {5663#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:25,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {5663#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5663#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:25,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {5663#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5697#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:25,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {5697#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {5697#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:25,254 INFO L272 TraceCheckUtils]: 14: Hoare triple {5697#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5697#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:25,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {5697#(<= ~counter~0 1)} ~cond := #in~cond; {5697#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:25,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {5697#(<= ~counter~0 1)} assume !(0 == ~cond); {5697#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:25,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {5697#(<= ~counter~0 1)} assume true; {5697#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:25,255 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5697#(<= ~counter~0 1)} {5697#(<= ~counter~0 1)} #55#return; {5697#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:25,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {5697#(<= ~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 + ~x~0; {5697#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:25,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {5697#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5722#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:25,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {5722#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {5722#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:25,257 INFO L272 TraceCheckUtils]: 22: Hoare triple {5722#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5722#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:25,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {5722#(<= ~counter~0 2)} ~cond := #in~cond; {5722#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:25,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {5722#(<= ~counter~0 2)} assume !(0 == ~cond); {5722#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:25,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {5722#(<= ~counter~0 2)} assume true; {5722#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:25,258 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5722#(<= ~counter~0 2)} {5722#(<= ~counter~0 2)} #55#return; {5722#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:25,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {5722#(<= ~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 + ~x~0; {5722#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:25,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {5722#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5747#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:25,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {5747#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {5747#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:25,259 INFO L272 TraceCheckUtils]: 30: Hoare triple {5747#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5747#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:25,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {5747#(<= ~counter~0 3)} ~cond := #in~cond; {5747#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:25,260 INFO L290 TraceCheckUtils]: 32: Hoare triple {5747#(<= ~counter~0 3)} assume !(0 == ~cond); {5747#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:25,260 INFO L290 TraceCheckUtils]: 33: Hoare triple {5747#(<= ~counter~0 3)} assume true; {5747#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:25,260 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5747#(<= ~counter~0 3)} {5747#(<= ~counter~0 3)} #55#return; {5747#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:25,261 INFO L290 TraceCheckUtils]: 35: Hoare triple {5747#(<= ~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 + ~x~0; {5747#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:25,261 INFO L290 TraceCheckUtils]: 36: Hoare triple {5747#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5772#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:25,261 INFO L290 TraceCheckUtils]: 37: Hoare triple {5772#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {5772#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:25,262 INFO L272 TraceCheckUtils]: 38: Hoare triple {5772#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5772#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:25,262 INFO L290 TraceCheckUtils]: 39: Hoare triple {5772#(<= ~counter~0 4)} ~cond := #in~cond; {5772#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:25,262 INFO L290 TraceCheckUtils]: 40: Hoare triple {5772#(<= ~counter~0 4)} assume !(0 == ~cond); {5772#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:25,263 INFO L290 TraceCheckUtils]: 41: Hoare triple {5772#(<= ~counter~0 4)} assume true; {5772#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:25,263 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5772#(<= ~counter~0 4)} {5772#(<= ~counter~0 4)} #55#return; {5772#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:25,263 INFO L290 TraceCheckUtils]: 43: Hoare triple {5772#(<= ~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 + ~x~0; {5772#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:25,264 INFO L290 TraceCheckUtils]: 44: Hoare triple {5772#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5797#(<= ~counter~0 5)} is VALID [2022-04-08 14:21:25,264 INFO L290 TraceCheckUtils]: 45: Hoare triple {5797#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {5797#(<= ~counter~0 5)} is VALID [2022-04-08 14:21:25,264 INFO L272 TraceCheckUtils]: 46: Hoare triple {5797#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5797#(<= ~counter~0 5)} is VALID [2022-04-08 14:21:25,265 INFO L290 TraceCheckUtils]: 47: Hoare triple {5797#(<= ~counter~0 5)} ~cond := #in~cond; {5797#(<= ~counter~0 5)} is VALID [2022-04-08 14:21:25,265 INFO L290 TraceCheckUtils]: 48: Hoare triple {5797#(<= ~counter~0 5)} assume !(0 == ~cond); {5797#(<= ~counter~0 5)} is VALID [2022-04-08 14:21:25,265 INFO L290 TraceCheckUtils]: 49: Hoare triple {5797#(<= ~counter~0 5)} assume true; {5797#(<= ~counter~0 5)} is VALID [2022-04-08 14:21:25,265 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5797#(<= ~counter~0 5)} {5797#(<= ~counter~0 5)} #55#return; {5797#(<= ~counter~0 5)} is VALID [2022-04-08 14:21:25,266 INFO L290 TraceCheckUtils]: 51: Hoare triple {5797#(<= ~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 + ~x~0; {5797#(<= ~counter~0 5)} is VALID [2022-04-08 14:21:25,266 INFO L290 TraceCheckUtils]: 52: Hoare triple {5797#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5822#(<= |main_#t~post5| 5)} is VALID [2022-04-08 14:21:25,266 INFO L290 TraceCheckUtils]: 53: Hoare triple {5822#(<= |main_#t~post5| 5)} assume !(#t~post5 < 20);havoc #t~post5; {5656#false} is VALID [2022-04-08 14:21:25,266 INFO L272 TraceCheckUtils]: 54: Hoare triple {5656#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5656#false} is VALID [2022-04-08 14:21:25,267 INFO L290 TraceCheckUtils]: 55: Hoare triple {5656#false} ~cond := #in~cond; {5656#false} is VALID [2022-04-08 14:21:25,267 INFO L290 TraceCheckUtils]: 56: Hoare triple {5656#false} assume !(0 == ~cond); {5656#false} is VALID [2022-04-08 14:21:25,267 INFO L290 TraceCheckUtils]: 57: Hoare triple {5656#false} assume true; {5656#false} is VALID [2022-04-08 14:21:25,267 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5656#false} {5656#false} #57#return; {5656#false} is VALID [2022-04-08 14:21:25,267 INFO L272 TraceCheckUtils]: 59: Hoare triple {5656#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5656#false} is VALID [2022-04-08 14:21:25,267 INFO L290 TraceCheckUtils]: 60: Hoare triple {5656#false} ~cond := #in~cond; {5656#false} is VALID [2022-04-08 14:21:25,267 INFO L290 TraceCheckUtils]: 61: Hoare triple {5656#false} assume 0 == ~cond; {5656#false} is VALID [2022-04-08 14:21:25,267 INFO L290 TraceCheckUtils]: 62: Hoare triple {5656#false} assume !false; {5656#false} is VALID [2022-04-08 14:21:25,267 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:21:25,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:21:25,565 INFO L290 TraceCheckUtils]: 62: Hoare triple {5656#false} assume !false; {5656#false} is VALID [2022-04-08 14:21:25,565 INFO L290 TraceCheckUtils]: 61: Hoare triple {5656#false} assume 0 == ~cond; {5656#false} is VALID [2022-04-08 14:21:25,565 INFO L290 TraceCheckUtils]: 60: Hoare triple {5656#false} ~cond := #in~cond; {5656#false} is VALID [2022-04-08 14:21:25,565 INFO L272 TraceCheckUtils]: 59: Hoare triple {5656#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5656#false} is VALID [2022-04-08 14:21:25,565 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5655#true} {5656#false} #57#return; {5656#false} is VALID [2022-04-08 14:21:25,565 INFO L290 TraceCheckUtils]: 57: Hoare triple {5655#true} assume true; {5655#true} is VALID [2022-04-08 14:21:25,565 INFO L290 TraceCheckUtils]: 56: Hoare triple {5655#true} assume !(0 == ~cond); {5655#true} is VALID [2022-04-08 14:21:25,565 INFO L290 TraceCheckUtils]: 55: Hoare triple {5655#true} ~cond := #in~cond; {5655#true} is VALID [2022-04-08 14:21:25,565 INFO L272 TraceCheckUtils]: 54: Hoare triple {5656#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5655#true} is VALID [2022-04-08 14:21:25,566 INFO L290 TraceCheckUtils]: 53: Hoare triple {5880#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {5656#false} is VALID [2022-04-08 14:21:25,566 INFO L290 TraceCheckUtils]: 52: Hoare triple {5884#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5880#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:21:25,566 INFO L290 TraceCheckUtils]: 51: Hoare triple {5884#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5884#(< ~counter~0 20)} is VALID [2022-04-08 14:21:25,567 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5655#true} {5884#(< ~counter~0 20)} #55#return; {5884#(< ~counter~0 20)} is VALID [2022-04-08 14:21:25,567 INFO L290 TraceCheckUtils]: 49: Hoare triple {5655#true} assume true; {5655#true} is VALID [2022-04-08 14:21:25,567 INFO L290 TraceCheckUtils]: 48: Hoare triple {5655#true} assume !(0 == ~cond); {5655#true} is VALID [2022-04-08 14:21:25,567 INFO L290 TraceCheckUtils]: 47: Hoare triple {5655#true} ~cond := #in~cond; {5655#true} is VALID [2022-04-08 14:21:25,567 INFO L272 TraceCheckUtils]: 46: Hoare triple {5884#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5655#true} is VALID [2022-04-08 14:21:25,567 INFO L290 TraceCheckUtils]: 45: Hoare triple {5884#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {5884#(< ~counter~0 20)} is VALID [2022-04-08 14:21:25,568 INFO L290 TraceCheckUtils]: 44: Hoare triple {5909#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5884#(< ~counter~0 20)} is VALID [2022-04-08 14:21:25,571 INFO L290 TraceCheckUtils]: 43: Hoare triple {5909#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5909#(< ~counter~0 19)} is VALID [2022-04-08 14:21:25,571 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5655#true} {5909#(< ~counter~0 19)} #55#return; {5909#(< ~counter~0 19)} is VALID [2022-04-08 14:21:25,571 INFO L290 TraceCheckUtils]: 41: Hoare triple {5655#true} assume true; {5655#true} is VALID [2022-04-08 14:21:25,571 INFO L290 TraceCheckUtils]: 40: Hoare triple {5655#true} assume !(0 == ~cond); {5655#true} is VALID [2022-04-08 14:21:25,571 INFO L290 TraceCheckUtils]: 39: Hoare triple {5655#true} ~cond := #in~cond; {5655#true} is VALID [2022-04-08 14:21:25,572 INFO L272 TraceCheckUtils]: 38: Hoare triple {5909#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5655#true} is VALID [2022-04-08 14:21:25,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {5909#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {5909#(< ~counter~0 19)} is VALID [2022-04-08 14:21:25,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {5934#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5909#(< ~counter~0 19)} is VALID [2022-04-08 14:21:25,573 INFO L290 TraceCheckUtils]: 35: Hoare triple {5934#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5934#(< ~counter~0 18)} is VALID [2022-04-08 14:21:25,573 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5655#true} {5934#(< ~counter~0 18)} #55#return; {5934#(< ~counter~0 18)} is VALID [2022-04-08 14:21:25,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {5655#true} assume true; {5655#true} is VALID [2022-04-08 14:21:25,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {5655#true} assume !(0 == ~cond); {5655#true} is VALID [2022-04-08 14:21:25,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {5655#true} ~cond := #in~cond; {5655#true} is VALID [2022-04-08 14:21:25,573 INFO L272 TraceCheckUtils]: 30: Hoare triple {5934#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5655#true} is VALID [2022-04-08 14:21:25,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {5934#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {5934#(< ~counter~0 18)} is VALID [2022-04-08 14:21:25,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {5959#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5934#(< ~counter~0 18)} is VALID [2022-04-08 14:21:25,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {5959#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5959#(< ~counter~0 17)} is VALID [2022-04-08 14:21:25,575 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5655#true} {5959#(< ~counter~0 17)} #55#return; {5959#(< ~counter~0 17)} is VALID [2022-04-08 14:21:25,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {5655#true} assume true; {5655#true} is VALID [2022-04-08 14:21:25,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {5655#true} assume !(0 == ~cond); {5655#true} is VALID [2022-04-08 14:21:25,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {5655#true} ~cond := #in~cond; {5655#true} is VALID [2022-04-08 14:21:25,575 INFO L272 TraceCheckUtils]: 22: Hoare triple {5959#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5655#true} is VALID [2022-04-08 14:21:25,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {5959#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {5959#(< ~counter~0 17)} is VALID [2022-04-08 14:21:25,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {5984#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5959#(< ~counter~0 17)} is VALID [2022-04-08 14:21:25,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {5984#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5984#(< ~counter~0 16)} is VALID [2022-04-08 14:21:25,576 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5655#true} {5984#(< ~counter~0 16)} #55#return; {5984#(< ~counter~0 16)} is VALID [2022-04-08 14:21:25,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {5655#true} assume true; {5655#true} is VALID [2022-04-08 14:21:25,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {5655#true} assume !(0 == ~cond); {5655#true} is VALID [2022-04-08 14:21:25,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {5655#true} ~cond := #in~cond; {5655#true} is VALID [2022-04-08 14:21:25,577 INFO L272 TraceCheckUtils]: 14: Hoare triple {5984#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5655#true} is VALID [2022-04-08 14:21:25,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {5984#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {5984#(< ~counter~0 16)} is VALID [2022-04-08 14:21:25,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {6009#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5984#(< ~counter~0 16)} is VALID [2022-04-08 14:21:25,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {6009#(< ~counter~0 15)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6009#(< ~counter~0 15)} is VALID [2022-04-08 14:21:25,578 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5655#true} {6009#(< ~counter~0 15)} #53#return; {6009#(< ~counter~0 15)} is VALID [2022-04-08 14:21:25,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {5655#true} assume true; {5655#true} is VALID [2022-04-08 14:21:25,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {5655#true} assume !(0 == ~cond); {5655#true} is VALID [2022-04-08 14:21:25,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {5655#true} ~cond := #in~cond; {5655#true} is VALID [2022-04-08 14:21:25,578 INFO L272 TraceCheckUtils]: 6: Hoare triple {6009#(< ~counter~0 15)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5655#true} is VALID [2022-04-08 14:21:25,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {6009#(< ~counter~0 15)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {6009#(< ~counter~0 15)} is VALID [2022-04-08 14:21:25,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {6009#(< ~counter~0 15)} call #t~ret6 := main(); {6009#(< ~counter~0 15)} is VALID [2022-04-08 14:21:25,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6009#(< ~counter~0 15)} {5655#true} #61#return; {6009#(< ~counter~0 15)} is VALID [2022-04-08 14:21:25,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {6009#(< ~counter~0 15)} assume true; {6009#(< ~counter~0 15)} is VALID [2022-04-08 14:21:25,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {5655#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; {6009#(< ~counter~0 15)} is VALID [2022-04-08 14:21:25,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {5655#true} call ULTIMATE.init(); {5655#true} is VALID [2022-04-08 14:21:25,580 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:21:25,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:21:25,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521856707] [2022-04-08 14:21:25,580 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:21:25,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130371635] [2022-04-08 14:21:25,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130371635] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:21:25,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:21:25,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 14:21:25,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:21:25,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2120267434] [2022-04-08 14:21:25,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2120267434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:21:25,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:21:25,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 14:21:25,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009293292] [2022-04-08 14:21:25,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:21:25,581 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:21:25,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:21:25,582 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:21:25,622 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:21:25,622 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 14:21:25,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:25,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 14:21:25,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:21:25,622 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:21:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:25,858 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-04-08 14:21:25,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 14:21:25,858 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:21:25,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:21:25,859 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:21:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-08 14:21:25,860 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:21:25,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-08 14:21:25,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 78 transitions. [2022-04-08 14:21:25,922 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:21:25,922 INFO L225 Difference]: With dead ends: 78 [2022-04-08 14:21:25,922 INFO L226 Difference]: Without dead ends: 68 [2022-04-08 14:21:25,923 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:21:25,923 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:21:25,923 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 129 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:21:25,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-08 14:21:25,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-08 14:21:25,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:21:25,987 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:21:25,987 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:21:25,987 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:21:25,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:25,989 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-08 14:21:25,989 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-08 14:21:25,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:25,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:25,990 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:21:25,990 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:21:25,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:25,991 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-08 14:21:25,991 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-08 14:21:25,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:25,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:25,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:21:25,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:21:25,991 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:21:25,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2022-04-08 14:21:25,992 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 63 [2022-04-08 14:21:25,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:21:25,992 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2022-04-08 14:21:25,993 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:21:25,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 70 transitions. [2022-04-08 14:21:26,444 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:21:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-08 14:21:26,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 14:21:26,445 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:21:26,445 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:21:26,460 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:21:26,645 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:21:26,645 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:21:26,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:21:26,646 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 9 times [2022-04-08 14:21:26,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:26,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1289968877] [2022-04-08 14:21:26,758 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:21:26,758 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:21:26,759 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 10 times [2022-04-08 14:21:26,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:21:26,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491965051] [2022-04-08 14:21:26,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:21:26,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:21:26,776 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:21:26,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1803527770] [2022-04-08 14:21:26,777 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:21:26,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:21:26,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:21:26,778 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:21:26,779 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:21:26,815 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:21:26,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:21:26,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 14:21:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:21:26,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:21:27,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {6486#true} call ULTIMATE.init(); {6486#true} is VALID [2022-04-08 14:21:27,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {6486#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; {6486#true} is VALID [2022-04-08 14:21:27,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-08 14:21:27,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6486#true} {6486#true} #61#return; {6486#true} is VALID [2022-04-08 14:21:27,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {6486#true} call #t~ret6 := main(); {6486#true} is VALID [2022-04-08 14:21:27,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {6486#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; {6486#true} is VALID [2022-04-08 14:21:27,186 INFO L272 TraceCheckUtils]: 6: Hoare triple {6486#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6486#true} is VALID [2022-04-08 14:21:27,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-08 14:21:27,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-08 14:21:27,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-08 14:21:27,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6486#true} {6486#true} #53#return; {6486#true} is VALID [2022-04-08 14:21:27,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {6486#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:21:27,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {6524#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:21:27,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {6524#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {6524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:21:27,187 INFO L272 TraceCheckUtils]: 14: Hoare triple {6524#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6486#true} is VALID [2022-04-08 14:21:27,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-08 14:21:27,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-08 14:21:27,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-08 14:21:27,188 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6486#true} {6524#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {6524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:21:27,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {6524#(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 + ~x~0; {6549#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:21:27,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {6549#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6549#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:21:27,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {6549#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {6549#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:21:27,189 INFO L272 TraceCheckUtils]: 22: Hoare triple {6549#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6486#true} is VALID [2022-04-08 14:21:27,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-08 14:21:27,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-08 14:21:27,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-08 14:21:27,190 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6486#true} {6549#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {6549#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:21:27,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {6549#(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 + ~x~0; {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 14:21:27,191 INFO L290 TraceCheckUtils]: 28: Hoare triple {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 14:21:27,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 14:21:27,191 INFO L272 TraceCheckUtils]: 30: Hoare triple {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6486#true} is VALID [2022-04-08 14:21:27,191 INFO L290 TraceCheckUtils]: 31: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-08 14:21:27,191 INFO L290 TraceCheckUtils]: 32: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-08 14:21:27,191 INFO L290 TraceCheckUtils]: 33: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-08 14:21:27,192 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6486#true} {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #55#return; {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 14:21:27,192 INFO L290 TraceCheckUtils]: 35: Hoare triple {6574#(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 + ~x~0; {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 14:21:27,192 INFO L290 TraceCheckUtils]: 36: Hoare triple {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 14:21:27,193 INFO L290 TraceCheckUtils]: 37: Hoare triple {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 14:21:27,193 INFO L272 TraceCheckUtils]: 38: Hoare triple {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6486#true} is VALID [2022-04-08 14:21:27,193 INFO L290 TraceCheckUtils]: 39: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-08 14:21:27,193 INFO L290 TraceCheckUtils]: 40: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-08 14:21:27,193 INFO L290 TraceCheckUtils]: 41: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-08 14:21:27,194 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6486#true} {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} #55#return; {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 14:21:27,194 INFO L290 TraceCheckUtils]: 43: Hoare triple {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 14:21:27,194 INFO L290 TraceCheckUtils]: 44: Hoare triple {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 14:21:27,195 INFO L290 TraceCheckUtils]: 45: Hoare triple {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 14:21:27,195 INFO L272 TraceCheckUtils]: 46: Hoare triple {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6486#true} is VALID [2022-04-08 14:21:27,195 INFO L290 TraceCheckUtils]: 47: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-08 14:21:27,195 INFO L290 TraceCheckUtils]: 48: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-08 14:21:27,195 INFO L290 TraceCheckUtils]: 49: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-08 14:21:27,195 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6486#true} {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #55#return; {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 14:21:27,196 INFO L290 TraceCheckUtils]: 51: Hoare triple {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 14:21:27,196 INFO L290 TraceCheckUtils]: 52: Hoare triple {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 14:21:27,196 INFO L290 TraceCheckUtils]: 53: Hoare triple {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 14:21:27,196 INFO L272 TraceCheckUtils]: 54: Hoare triple {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6486#true} is VALID [2022-04-08 14:21:27,197 INFO L290 TraceCheckUtils]: 55: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-08 14:21:27,197 INFO L290 TraceCheckUtils]: 56: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-08 14:21:27,197 INFO L290 TraceCheckUtils]: 57: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-08 14:21:27,197 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6486#true} {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #55#return; {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 14:21:27,198 INFO L290 TraceCheckUtils]: 59: Hoare triple {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {6674#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 14:21:27,198 INFO L272 TraceCheckUtils]: 60: Hoare triple {6674#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6486#true} is VALID [2022-04-08 14:21:27,198 INFO L290 TraceCheckUtils]: 61: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-08 14:21:27,198 INFO L290 TraceCheckUtils]: 62: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-08 14:21:27,198 INFO L290 TraceCheckUtils]: 63: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-08 14:21:27,198 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6486#true} {6674#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #57#return; {6674#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 14:21:27,199 INFO L272 TraceCheckUtils]: 65: Hoare triple {6674#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {6693#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:21:27,199 INFO L290 TraceCheckUtils]: 66: Hoare triple {6693#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6697#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:21:27,199 INFO L290 TraceCheckUtils]: 67: Hoare triple {6697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6487#false} is VALID [2022-04-08 14:21:27,199 INFO L290 TraceCheckUtils]: 68: Hoare triple {6487#false} assume !false; {6487#false} is VALID [2022-04-08 14:21:27,200 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:21:27,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:21:27,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:21:27,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491965051] [2022-04-08 14:21:27,447 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:21:27,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803527770] [2022-04-08 14:21:27,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803527770] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:21:27,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:21:27,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 14:21:27,447 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:21:27,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1289968877] [2022-04-08 14:21:27,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1289968877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:21:27,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:21:27,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 14:21:27,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505940241] [2022-04-08 14:21:27,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:21:27,448 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:21:27,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:21:27,448 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:21:27,487 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:21:27,487 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 14:21:27,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:27,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 14:21:27,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:21:27,488 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:21:28,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:28,058 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-08 14:21:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 14:21:28,059 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:21:28,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:21:28,059 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:21:28,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-08 14:21:28,060 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:21:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-08 14:21:28,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-08 14:21:28,110 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:21:28,111 INFO L225 Difference]: With dead ends: 76 [2022-04-08 14:21:28,111 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 14:21:28,112 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:21:28,112 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:21:28,112 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 317 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:21:28,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 14:21:28,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-08 14:21:28,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:21:28,172 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:21:28,172 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:21:28,172 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:21:28,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:28,173 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-08 14:21:28,173 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-08 14:21:28,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:28,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:28,174 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:21:28,174 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:21:28,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:28,175 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-08 14:21:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-08 14:21:28,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:28,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:28,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:21:28,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:21:28,175 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:21:28,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-08 14:21:28,176 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 69 [2022-04-08 14:21:28,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:21:28,176 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-08 14:21:28,176 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:21:28,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions. [2022-04-08 14:21:28,826 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:21:28,826 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-08 14:21:28,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-08 14:21:28,827 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:21:28,827 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:21:28,843 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:21:29,040 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:21:29,040 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:21:29,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:21:29,040 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 9 times [2022-04-08 14:21:29,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:29,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [94276803] [2022-04-08 14:21:29,135 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:21:29,135 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:21:29,135 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 10 times [2022-04-08 14:21:29,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:21:29,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658362903] [2022-04-08 14:21:29,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:21:29,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:21:29,144 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:21:29,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [499497847] [2022-04-08 14:21:29,145 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:21:29,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:21:29,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:21:29,146 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:21:29,147 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:21:29,183 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:21:29,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:21:29,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 14:21:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:21:29,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:21:29,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {7199#true} call ULTIMATE.init(); {7199#true} is VALID [2022-04-08 14:21:29,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {7199#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; {7207#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:29,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {7207#(<= ~counter~0 0)} assume true; {7207#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:29,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7207#(<= ~counter~0 0)} {7199#true} #61#return; {7207#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:29,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {7207#(<= ~counter~0 0)} call #t~ret6 := main(); {7207#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:29,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {7207#(<= ~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; {7207#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:29,515 INFO L272 TraceCheckUtils]: 6: Hoare triple {7207#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7207#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:29,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {7207#(<= ~counter~0 0)} ~cond := #in~cond; {7207#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:29,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {7207#(<= ~counter~0 0)} assume !(0 == ~cond); {7207#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:29,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {7207#(<= ~counter~0 0)} assume true; {7207#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:29,516 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7207#(<= ~counter~0 0)} {7207#(<= ~counter~0 0)} #53#return; {7207#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:29,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {7207#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7207#(<= ~counter~0 0)} is VALID [2022-04-08 14:21:29,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {7207#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7241#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:29,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {7241#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {7241#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:29,517 INFO L272 TraceCheckUtils]: 14: Hoare triple {7241#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7241#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:29,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {7241#(<= ~counter~0 1)} ~cond := #in~cond; {7241#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:29,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {7241#(<= ~counter~0 1)} assume !(0 == ~cond); {7241#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:29,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {7241#(<= ~counter~0 1)} assume true; {7241#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:29,519 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7241#(<= ~counter~0 1)} {7241#(<= ~counter~0 1)} #55#return; {7241#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:29,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {7241#(<= ~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 + ~x~0; {7241#(<= ~counter~0 1)} is VALID [2022-04-08 14:21:29,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {7241#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7266#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:29,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {7266#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {7266#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:29,520 INFO L272 TraceCheckUtils]: 22: Hoare triple {7266#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7266#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:29,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {7266#(<= ~counter~0 2)} ~cond := #in~cond; {7266#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:29,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {7266#(<= ~counter~0 2)} assume !(0 == ~cond); {7266#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:29,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {7266#(<= ~counter~0 2)} assume true; {7266#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:29,521 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7266#(<= ~counter~0 2)} {7266#(<= ~counter~0 2)} #55#return; {7266#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:29,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {7266#(<= ~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 + ~x~0; {7266#(<= ~counter~0 2)} is VALID [2022-04-08 14:21:29,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {7266#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7291#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:29,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {7291#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {7291#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:29,522 INFO L272 TraceCheckUtils]: 30: Hoare triple {7291#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7291#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:29,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {7291#(<= ~counter~0 3)} ~cond := #in~cond; {7291#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:29,523 INFO L290 TraceCheckUtils]: 32: Hoare triple {7291#(<= ~counter~0 3)} assume !(0 == ~cond); {7291#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:29,523 INFO L290 TraceCheckUtils]: 33: Hoare triple {7291#(<= ~counter~0 3)} assume true; {7291#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:29,523 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7291#(<= ~counter~0 3)} {7291#(<= ~counter~0 3)} #55#return; {7291#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:29,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {7291#(<= ~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 + ~x~0; {7291#(<= ~counter~0 3)} is VALID [2022-04-08 14:21:29,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {7291#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7316#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:29,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {7316#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {7316#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:29,525 INFO L272 TraceCheckUtils]: 38: Hoare triple {7316#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7316#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:29,525 INFO L290 TraceCheckUtils]: 39: Hoare triple {7316#(<= ~counter~0 4)} ~cond := #in~cond; {7316#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:29,525 INFO L290 TraceCheckUtils]: 40: Hoare triple {7316#(<= ~counter~0 4)} assume !(0 == ~cond); {7316#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:29,526 INFO L290 TraceCheckUtils]: 41: Hoare triple {7316#(<= ~counter~0 4)} assume true; {7316#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:29,526 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7316#(<= ~counter~0 4)} {7316#(<= ~counter~0 4)} #55#return; {7316#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:29,526 INFO L290 TraceCheckUtils]: 43: Hoare triple {7316#(<= ~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 + ~x~0; {7316#(<= ~counter~0 4)} is VALID [2022-04-08 14:21:29,527 INFO L290 TraceCheckUtils]: 44: Hoare triple {7316#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7341#(<= ~counter~0 5)} is VALID [2022-04-08 14:21:29,527 INFO L290 TraceCheckUtils]: 45: Hoare triple {7341#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {7341#(<= ~counter~0 5)} is VALID [2022-04-08 14:21:29,527 INFO L272 TraceCheckUtils]: 46: Hoare triple {7341#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7341#(<= ~counter~0 5)} is VALID [2022-04-08 14:21:29,528 INFO L290 TraceCheckUtils]: 47: Hoare triple {7341#(<= ~counter~0 5)} ~cond := #in~cond; {7341#(<= ~counter~0 5)} is VALID [2022-04-08 14:21:29,528 INFO L290 TraceCheckUtils]: 48: Hoare triple {7341#(<= ~counter~0 5)} assume !(0 == ~cond); {7341#(<= ~counter~0 5)} is VALID [2022-04-08 14:21:29,528 INFO L290 TraceCheckUtils]: 49: Hoare triple {7341#(<= ~counter~0 5)} assume true; {7341#(<= ~counter~0 5)} is VALID [2022-04-08 14:21:29,528 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7341#(<= ~counter~0 5)} {7341#(<= ~counter~0 5)} #55#return; {7341#(<= ~counter~0 5)} is VALID [2022-04-08 14:21:29,529 INFO L290 TraceCheckUtils]: 51: Hoare triple {7341#(<= ~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 + ~x~0; {7341#(<= ~counter~0 5)} is VALID [2022-04-08 14:21:29,529 INFO L290 TraceCheckUtils]: 52: Hoare triple {7341#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7366#(<= ~counter~0 6)} is VALID [2022-04-08 14:21:29,529 INFO L290 TraceCheckUtils]: 53: Hoare triple {7366#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {7366#(<= ~counter~0 6)} is VALID [2022-04-08 14:21:29,530 INFO L272 TraceCheckUtils]: 54: Hoare triple {7366#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7366#(<= ~counter~0 6)} is VALID [2022-04-08 14:21:29,530 INFO L290 TraceCheckUtils]: 55: Hoare triple {7366#(<= ~counter~0 6)} ~cond := #in~cond; {7366#(<= ~counter~0 6)} is VALID [2022-04-08 14:21:29,530 INFO L290 TraceCheckUtils]: 56: Hoare triple {7366#(<= ~counter~0 6)} assume !(0 == ~cond); {7366#(<= ~counter~0 6)} is VALID [2022-04-08 14:21:29,531 INFO L290 TraceCheckUtils]: 57: Hoare triple {7366#(<= ~counter~0 6)} assume true; {7366#(<= ~counter~0 6)} is VALID [2022-04-08 14:21:29,531 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7366#(<= ~counter~0 6)} {7366#(<= ~counter~0 6)} #55#return; {7366#(<= ~counter~0 6)} is VALID [2022-04-08 14:21:29,531 INFO L290 TraceCheckUtils]: 59: Hoare triple {7366#(<= ~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 + ~x~0; {7366#(<= ~counter~0 6)} is VALID [2022-04-08 14:21:29,532 INFO L290 TraceCheckUtils]: 60: Hoare triple {7366#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7391#(<= |main_#t~post5| 6)} is VALID [2022-04-08 14:21:29,532 INFO L290 TraceCheckUtils]: 61: Hoare triple {7391#(<= |main_#t~post5| 6)} assume !(#t~post5 < 20);havoc #t~post5; {7200#false} is VALID [2022-04-08 14:21:29,532 INFO L272 TraceCheckUtils]: 62: Hoare triple {7200#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7200#false} is VALID [2022-04-08 14:21:29,532 INFO L290 TraceCheckUtils]: 63: Hoare triple {7200#false} ~cond := #in~cond; {7200#false} is VALID [2022-04-08 14:21:29,532 INFO L290 TraceCheckUtils]: 64: Hoare triple {7200#false} assume !(0 == ~cond); {7200#false} is VALID [2022-04-08 14:21:29,532 INFO L290 TraceCheckUtils]: 65: Hoare triple {7200#false} assume true; {7200#false} is VALID [2022-04-08 14:21:29,532 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7200#false} {7200#false} #57#return; {7200#false} is VALID [2022-04-08 14:21:29,532 INFO L272 TraceCheckUtils]: 67: Hoare triple {7200#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7200#false} is VALID [2022-04-08 14:21:29,532 INFO L290 TraceCheckUtils]: 68: Hoare triple {7200#false} ~cond := #in~cond; {7200#false} is VALID [2022-04-08 14:21:29,532 INFO L290 TraceCheckUtils]: 69: Hoare triple {7200#false} assume 0 == ~cond; {7200#false} is VALID [2022-04-08 14:21:29,532 INFO L290 TraceCheckUtils]: 70: Hoare triple {7200#false} assume !false; {7200#false} is VALID [2022-04-08 14:21:29,533 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:21:29,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:21:29,923 INFO L290 TraceCheckUtils]: 70: Hoare triple {7200#false} assume !false; {7200#false} is VALID [2022-04-08 14:21:29,923 INFO L290 TraceCheckUtils]: 69: Hoare triple {7200#false} assume 0 == ~cond; {7200#false} is VALID [2022-04-08 14:21:29,923 INFO L290 TraceCheckUtils]: 68: Hoare triple {7200#false} ~cond := #in~cond; {7200#false} is VALID [2022-04-08 14:21:29,923 INFO L272 TraceCheckUtils]: 67: Hoare triple {7200#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7200#false} is VALID [2022-04-08 14:21:29,924 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7199#true} {7200#false} #57#return; {7200#false} is VALID [2022-04-08 14:21:29,924 INFO L290 TraceCheckUtils]: 65: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-08 14:21:29,924 INFO L290 TraceCheckUtils]: 64: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-08 14:21:29,924 INFO L290 TraceCheckUtils]: 63: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-08 14:21:29,924 INFO L272 TraceCheckUtils]: 62: Hoare triple {7200#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7199#true} is VALID [2022-04-08 14:21:29,924 INFO L290 TraceCheckUtils]: 61: Hoare triple {7449#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {7200#false} is VALID [2022-04-08 14:21:29,924 INFO L290 TraceCheckUtils]: 60: Hoare triple {7453#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7449#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:21:29,925 INFO L290 TraceCheckUtils]: 59: Hoare triple {7453#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7453#(< ~counter~0 20)} is VALID [2022-04-08 14:21:29,925 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7199#true} {7453#(< ~counter~0 20)} #55#return; {7453#(< ~counter~0 20)} is VALID [2022-04-08 14:21:29,925 INFO L290 TraceCheckUtils]: 57: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-08 14:21:29,925 INFO L290 TraceCheckUtils]: 56: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-08 14:21:29,925 INFO L290 TraceCheckUtils]: 55: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-08 14:21:29,925 INFO L272 TraceCheckUtils]: 54: Hoare triple {7453#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7199#true} is VALID [2022-04-08 14:21:29,926 INFO L290 TraceCheckUtils]: 53: Hoare triple {7453#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {7453#(< ~counter~0 20)} is VALID [2022-04-08 14:21:29,926 INFO L290 TraceCheckUtils]: 52: Hoare triple {7478#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7453#(< ~counter~0 20)} is VALID [2022-04-08 14:21:29,926 INFO L290 TraceCheckUtils]: 51: Hoare triple {7478#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7478#(< ~counter~0 19)} is VALID [2022-04-08 14:21:29,927 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7199#true} {7478#(< ~counter~0 19)} #55#return; {7478#(< ~counter~0 19)} is VALID [2022-04-08 14:21:29,927 INFO L290 TraceCheckUtils]: 49: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-08 14:21:29,927 INFO L290 TraceCheckUtils]: 48: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-08 14:21:29,927 INFO L290 TraceCheckUtils]: 47: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-08 14:21:29,927 INFO L272 TraceCheckUtils]: 46: Hoare triple {7478#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7199#true} is VALID [2022-04-08 14:21:29,927 INFO L290 TraceCheckUtils]: 45: Hoare triple {7478#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {7478#(< ~counter~0 19)} is VALID [2022-04-08 14:21:29,928 INFO L290 TraceCheckUtils]: 44: Hoare triple {7503#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7478#(< ~counter~0 19)} is VALID [2022-04-08 14:21:29,928 INFO L290 TraceCheckUtils]: 43: Hoare triple {7503#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7503#(< ~counter~0 18)} is VALID [2022-04-08 14:21:29,928 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7199#true} {7503#(< ~counter~0 18)} #55#return; {7503#(< ~counter~0 18)} is VALID [2022-04-08 14:21:29,929 INFO L290 TraceCheckUtils]: 41: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-08 14:21:29,929 INFO L290 TraceCheckUtils]: 40: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-08 14:21:29,929 INFO L290 TraceCheckUtils]: 39: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-08 14:21:29,929 INFO L272 TraceCheckUtils]: 38: Hoare triple {7503#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7199#true} is VALID [2022-04-08 14:21:29,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {7503#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {7503#(< ~counter~0 18)} is VALID [2022-04-08 14:21:29,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {7528#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7503#(< ~counter~0 18)} is VALID [2022-04-08 14:21:29,930 INFO L290 TraceCheckUtils]: 35: Hoare triple {7528#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7528#(< ~counter~0 17)} is VALID [2022-04-08 14:21:29,930 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7199#true} {7528#(< ~counter~0 17)} #55#return; {7528#(< ~counter~0 17)} is VALID [2022-04-08 14:21:29,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-08 14:21:29,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-08 14:21:29,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-08 14:21:29,930 INFO L272 TraceCheckUtils]: 30: Hoare triple {7528#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7199#true} is VALID [2022-04-08 14:21:29,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {7528#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {7528#(< ~counter~0 17)} is VALID [2022-04-08 14:21:29,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {7553#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7528#(< ~counter~0 17)} is VALID [2022-04-08 14:21:29,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {7553#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7553#(< ~counter~0 16)} is VALID [2022-04-08 14:21:29,932 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7199#true} {7553#(< ~counter~0 16)} #55#return; {7553#(< ~counter~0 16)} is VALID [2022-04-08 14:21:29,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-08 14:21:29,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-08 14:21:29,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-08 14:21:29,932 INFO L272 TraceCheckUtils]: 22: Hoare triple {7553#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7199#true} is VALID [2022-04-08 14:21:29,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {7553#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {7553#(< ~counter~0 16)} is VALID [2022-04-08 14:21:29,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {7578#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7553#(< ~counter~0 16)} is VALID [2022-04-08 14:21:29,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {7578#(< ~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 + ~x~0; {7578#(< ~counter~0 15)} is VALID [2022-04-08 14:21:29,933 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7199#true} {7578#(< ~counter~0 15)} #55#return; {7578#(< ~counter~0 15)} is VALID [2022-04-08 14:21:29,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-08 14:21:29,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-08 14:21:29,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-08 14:21:29,934 INFO L272 TraceCheckUtils]: 14: Hoare triple {7578#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7199#true} is VALID [2022-04-08 14:21:29,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {7578#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {7578#(< ~counter~0 15)} is VALID [2022-04-08 14:21:29,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {7603#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7578#(< ~counter~0 15)} is VALID [2022-04-08 14:21:29,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {7603#(< ~counter~0 14)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7603#(< ~counter~0 14)} is VALID [2022-04-08 14:21:29,935 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7199#true} {7603#(< ~counter~0 14)} #53#return; {7603#(< ~counter~0 14)} is VALID [2022-04-08 14:21:29,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-08 14:21:29,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-08 14:21:29,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-08 14:21:29,935 INFO L272 TraceCheckUtils]: 6: Hoare triple {7603#(< ~counter~0 14)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7199#true} is VALID [2022-04-08 14:21:29,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {7603#(< ~counter~0 14)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {7603#(< ~counter~0 14)} is VALID [2022-04-08 14:21:29,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {7603#(< ~counter~0 14)} call #t~ret6 := main(); {7603#(< ~counter~0 14)} is VALID [2022-04-08 14:21:29,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7603#(< ~counter~0 14)} {7199#true} #61#return; {7603#(< ~counter~0 14)} is VALID [2022-04-08 14:21:29,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {7603#(< ~counter~0 14)} assume true; {7603#(< ~counter~0 14)} is VALID [2022-04-08 14:21:29,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {7199#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; {7603#(< ~counter~0 14)} is VALID [2022-04-08 14:21:29,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {7199#true} call ULTIMATE.init(); {7199#true} is VALID [2022-04-08 14:21:29,937 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:21:29,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:21:29,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658362903] [2022-04-08 14:21:29,938 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:21:29,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499497847] [2022-04-08 14:21:29,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499497847] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:21:29,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:21:29,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 14:21:29,938 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:21:29,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [94276803] [2022-04-08 14:21:29,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [94276803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:21:29,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:21:29,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 14:21:29,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755749125] [2022-04-08 14:21:29,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:21:29,939 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:21:29,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:21:29,939 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:21:29,982 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:21:29,982 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 14:21:29,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:29,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 14:21:29,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:21:29,983 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:21:30,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:30,214 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-04-08 14:21:30,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 14:21:30,214 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:21:30,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:21:30,214 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:21:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-08 14:21:30,216 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:21:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-08 14:21:30,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 86 transitions. [2022-04-08 14:21:30,282 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:21:30,283 INFO L225 Difference]: With dead ends: 86 [2022-04-08 14:21:30,283 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 14:21:30,283 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:21:30,284 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:21:30,284 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 108 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:21:30,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 14:21:30,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-08 14:21:30,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:21:30,369 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:21:30,369 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:21:30,369 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:21:30,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:30,370 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-08 14:21:30,370 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-08 14:21:30,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:30,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:30,372 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:21:30,372 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:21:30,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:30,373 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-08 14:21:30,373 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-08 14:21:30,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:30,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:30,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:21:30,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:21:30,374 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:21:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-04-08 14:21:30,375 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 71 [2022-04-08 14:21:30,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:21:30,375 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-04-08 14:21:30,375 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:21:30,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 78 transitions. [2022-04-08 14:21:31,729 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:21:31,729 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-08 14:21:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-08 14:21:31,730 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:21:31,730 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:21:31,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-08 14:21:31,930 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:21:31,930 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:21:31,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:21:31,930 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 11 times [2022-04-08 14:21:31,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:31,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [679054490] [2022-04-08 14:21:32,009 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:21:32,009 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:21:32,009 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 12 times [2022-04-08 14:21:32,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:21:32,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876935026] [2022-04-08 14:21:32,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:21:32,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:21:32,027 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:21:32,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [344894504] [2022-04-08 14:21:32,027 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:21:32,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:21:32,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:21:32,028 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:21:32,029 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:21:47,802 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 14:21:47,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:21:47,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 14:21:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:21:47,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:21:48,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {8130#true} call ULTIMATE.init(); {8130#true} is VALID [2022-04-08 14:21:48,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {8130#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; {8130#true} is VALID [2022-04-08 14:21:48,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-08 14:21:48,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8130#true} {8130#true} #61#return; {8130#true} is VALID [2022-04-08 14:21:48,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {8130#true} call #t~ret6 := main(); {8130#true} is VALID [2022-04-08 14:21:48,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {8130#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; {8130#true} is VALID [2022-04-08 14:21:48,229 INFO L272 TraceCheckUtils]: 6: Hoare triple {8130#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8130#true} is VALID [2022-04-08 14:21:48,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-08 14:21:48,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-08 14:21:48,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-08 14:21:48,229 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8130#true} {8130#true} #53#return; {8130#true} is VALID [2022-04-08 14:21:48,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {8130#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8168#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:21:48,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {8168#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8168#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:21:48,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {8168#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {8168#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:21:48,230 INFO L272 TraceCheckUtils]: 14: Hoare triple {8168#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-08 14:21:48,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-08 14:21:48,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-08 14:21:48,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-08 14:21:48,231 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8130#true} {8168#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {8168#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:21:48,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {8168#(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 + ~x~0; {8193#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:21:48,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {8193#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8193#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:21:48,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {8193#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {8193#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:21:48,232 INFO L272 TraceCheckUtils]: 22: Hoare triple {8193#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-08 14:21:48,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-08 14:21:48,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-08 14:21:48,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-08 14:21:48,233 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8130#true} {8193#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {8193#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:21:48,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {8193#(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 + ~x~0; {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:21:48,233 INFO L290 TraceCheckUtils]: 28: Hoare triple {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:21:48,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:21:48,234 INFO L272 TraceCheckUtils]: 30: Hoare triple {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-08 14:21:48,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-08 14:21:48,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-08 14:21:48,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-08 14:21:48,234 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8130#true} {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #55#return; {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:21:48,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {8218#(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 + ~x~0; {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 14:21:48,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 14:21:48,235 INFO L290 TraceCheckUtils]: 37: Hoare triple {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 14:21:48,236 INFO L272 TraceCheckUtils]: 38: Hoare triple {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-08 14:21:48,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-08 14:21:48,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-08 14:21:48,236 INFO L290 TraceCheckUtils]: 41: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-08 14:21:48,236 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8130#true} {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #55#return; {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 14:21:48,237 INFO L290 TraceCheckUtils]: 43: Hoare triple {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:21:48,237 INFO L290 TraceCheckUtils]: 44: Hoare triple {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:21:48,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:21:48,237 INFO L272 TraceCheckUtils]: 46: Hoare triple {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-08 14:21:48,237 INFO L290 TraceCheckUtils]: 47: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-08 14:21:48,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-08 14:21:48,238 INFO L290 TraceCheckUtils]: 49: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-08 14:21:48,238 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8130#true} {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #55#return; {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:21:48,238 INFO L290 TraceCheckUtils]: 51: Hoare triple {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:21:48,239 INFO L290 TraceCheckUtils]: 52: Hoare triple {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:21:48,239 INFO L290 TraceCheckUtils]: 53: Hoare triple {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:21:48,239 INFO L272 TraceCheckUtils]: 54: Hoare triple {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-08 14:21:48,239 INFO L290 TraceCheckUtils]: 55: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-08 14:21:48,239 INFO L290 TraceCheckUtils]: 56: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-08 14:21:48,239 INFO L290 TraceCheckUtils]: 57: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-08 14:21:48,240 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8130#true} {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} #55#return; {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:21:48,240 INFO L290 TraceCheckUtils]: 59: Hoare triple {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 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 + ~x~0; {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:21:48,240 INFO L290 TraceCheckUtils]: 60: Hoare triple {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:21:48,241 INFO L290 TraceCheckUtils]: 61: Hoare triple {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:21:48,241 INFO L272 TraceCheckUtils]: 62: Hoare triple {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-08 14:21:48,241 INFO L290 TraceCheckUtils]: 63: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-08 14:21:48,241 INFO L290 TraceCheckUtils]: 64: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-08 14:21:48,241 INFO L290 TraceCheckUtils]: 65: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-08 14:21:48,241 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8130#true} {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #55#return; {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:21:48,242 INFO L290 TraceCheckUtils]: 67: Hoare triple {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {8343#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 14:21:48,242 INFO L272 TraceCheckUtils]: 68: Hoare triple {8343#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-08 14:21:48,242 INFO L290 TraceCheckUtils]: 69: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-08 14:21:48,242 INFO L290 TraceCheckUtils]: 70: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-08 14:21:48,242 INFO L290 TraceCheckUtils]: 71: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-08 14:21:48,243 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8130#true} {8343#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #57#return; {8343#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 14:21:48,243 INFO L272 TraceCheckUtils]: 73: Hoare triple {8343#(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)); {8362#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:21:48,244 INFO L290 TraceCheckUtils]: 74: Hoare triple {8362#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8366#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:21:48,244 INFO L290 TraceCheckUtils]: 75: Hoare triple {8366#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8131#false} is VALID [2022-04-08 14:21:48,244 INFO L290 TraceCheckUtils]: 76: Hoare triple {8131#false} assume !false; {8131#false} is VALID [2022-04-08 14:21:48,244 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:21:48,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:21:48,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:21:48,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876935026] [2022-04-08 14:21:48,500 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:21:48,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344894504] [2022-04-08 14:21:48,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344894504] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:21:48,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:21:48,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 14:21:48,501 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:21:48,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [679054490] [2022-04-08 14:21:48,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [679054490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:21:48,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:21:48,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 14:21:48,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628546959] [2022-04-08 14:21:48,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:21:48,501 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:21:48,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:21:48,502 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:21:48,540 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:21:48,540 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 14:21:48,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:48,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 14:21:48,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-08 14:21:48,541 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:21:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:49,265 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-08 14:21:49,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 14:21:49,265 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:21:49,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:21:49,266 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:21:49,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-08 14:21:49,268 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:21:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-08 14:21:49,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-08 14:21:49,321 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:21:49,322 INFO L225 Difference]: With dead ends: 84 [2022-04-08 14:21:49,322 INFO L226 Difference]: Without dead ends: 78 [2022-04-08 14:21:49,323 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-08 14:21:49,324 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 14:21:49,324 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 371 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 14:21:49,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-08 14:21:49,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-08 14:21:49,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:21:49,396 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:21:49,396 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:21:49,396 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:21:49,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:49,398 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-08 14:21:49,398 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-08 14:21:49,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:49,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:49,399 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:21:49,399 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:21:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:21:49,400 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-08 14:21:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-08 14:21:49,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:21:49,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:21:49,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:21:49,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:21:49,401 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:21:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-08 14:21:49,402 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 77 [2022-04-08 14:21:49,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:21:49,403 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-08 14:21:49,403 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:21:49,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions. [2022-04-08 14:21:49,917 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:21:49,917 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-08 14:21:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 14:21:49,918 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:21:49,918 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:21:49,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 14:21:50,126 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:21:50,127 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:21:50,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:21:50,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 11 times [2022-04-08 14:21:50,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:21:50,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1764340368] [2022-04-08 14:21:50,213 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:21:50,213 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:21:50,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 12 times [2022-04-08 14:21:50,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:21:50,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245992117] [2022-04-08 14:21:50,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:21:50,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:21:50,224 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:21:50,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1096207170] [2022-04-08 14:21:50,230 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:21:50,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:21:50,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:21:50,230 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:21:50,231 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:22:07,422 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 14:22:07,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:22:07,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 14:22:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:22:07,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:22:07,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {8916#true} call ULTIMATE.init(); {8916#true} is VALID [2022-04-08 14:22:07,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {8916#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; {8924#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:07,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {8924#(<= ~counter~0 0)} assume true; {8924#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:07,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8924#(<= ~counter~0 0)} {8916#true} #61#return; {8924#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:07,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {8924#(<= ~counter~0 0)} call #t~ret6 := main(); {8924#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:07,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {8924#(<= ~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; {8924#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:07,772 INFO L272 TraceCheckUtils]: 6: Hoare triple {8924#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8924#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:07,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {8924#(<= ~counter~0 0)} ~cond := #in~cond; {8924#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:07,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {8924#(<= ~counter~0 0)} assume !(0 == ~cond); {8924#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:07,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {8924#(<= ~counter~0 0)} assume true; {8924#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:07,773 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8924#(<= ~counter~0 0)} {8924#(<= ~counter~0 0)} #53#return; {8924#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:07,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {8924#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8924#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:07,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {8924#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8958#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:07,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {8958#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {8958#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:07,774 INFO L272 TraceCheckUtils]: 14: Hoare triple {8958#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8958#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:07,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {8958#(<= ~counter~0 1)} ~cond := #in~cond; {8958#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:07,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {8958#(<= ~counter~0 1)} assume !(0 == ~cond); {8958#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:07,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {8958#(<= ~counter~0 1)} assume true; {8958#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:07,775 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8958#(<= ~counter~0 1)} {8958#(<= ~counter~0 1)} #55#return; {8958#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:07,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {8958#(<= ~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 + ~x~0; {8958#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:07,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {8958#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8983#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:07,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {8983#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {8983#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:07,777 INFO L272 TraceCheckUtils]: 22: Hoare triple {8983#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8983#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:07,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {8983#(<= ~counter~0 2)} ~cond := #in~cond; {8983#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:07,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {8983#(<= ~counter~0 2)} assume !(0 == ~cond); {8983#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:07,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {8983#(<= ~counter~0 2)} assume true; {8983#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:07,778 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8983#(<= ~counter~0 2)} {8983#(<= ~counter~0 2)} #55#return; {8983#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:07,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {8983#(<= ~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 + ~x~0; {8983#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:07,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {8983#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9008#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:07,779 INFO L290 TraceCheckUtils]: 29: Hoare triple {9008#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {9008#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:07,779 INFO L272 TraceCheckUtils]: 30: Hoare triple {9008#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9008#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:07,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {9008#(<= ~counter~0 3)} ~cond := #in~cond; {9008#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:07,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {9008#(<= ~counter~0 3)} assume !(0 == ~cond); {9008#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:07,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {9008#(<= ~counter~0 3)} assume true; {9008#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:07,780 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9008#(<= ~counter~0 3)} {9008#(<= ~counter~0 3)} #55#return; {9008#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:07,781 INFO L290 TraceCheckUtils]: 35: Hoare triple {9008#(<= ~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 + ~x~0; {9008#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:07,781 INFO L290 TraceCheckUtils]: 36: Hoare triple {9008#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9033#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:07,781 INFO L290 TraceCheckUtils]: 37: Hoare triple {9033#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {9033#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:07,782 INFO L272 TraceCheckUtils]: 38: Hoare triple {9033#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9033#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:07,782 INFO L290 TraceCheckUtils]: 39: Hoare triple {9033#(<= ~counter~0 4)} ~cond := #in~cond; {9033#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:07,782 INFO L290 TraceCheckUtils]: 40: Hoare triple {9033#(<= ~counter~0 4)} assume !(0 == ~cond); {9033#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:07,783 INFO L290 TraceCheckUtils]: 41: Hoare triple {9033#(<= ~counter~0 4)} assume true; {9033#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:07,783 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9033#(<= ~counter~0 4)} {9033#(<= ~counter~0 4)} #55#return; {9033#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:07,783 INFO L290 TraceCheckUtils]: 43: Hoare triple {9033#(<= ~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 + ~x~0; {9033#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:07,784 INFO L290 TraceCheckUtils]: 44: Hoare triple {9033#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9058#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:07,784 INFO L290 TraceCheckUtils]: 45: Hoare triple {9058#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {9058#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:07,784 INFO L272 TraceCheckUtils]: 46: Hoare triple {9058#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9058#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:07,785 INFO L290 TraceCheckUtils]: 47: Hoare triple {9058#(<= ~counter~0 5)} ~cond := #in~cond; {9058#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:07,785 INFO L290 TraceCheckUtils]: 48: Hoare triple {9058#(<= ~counter~0 5)} assume !(0 == ~cond); {9058#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:07,785 INFO L290 TraceCheckUtils]: 49: Hoare triple {9058#(<= ~counter~0 5)} assume true; {9058#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:07,785 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9058#(<= ~counter~0 5)} {9058#(<= ~counter~0 5)} #55#return; {9058#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:07,786 INFO L290 TraceCheckUtils]: 51: Hoare triple {9058#(<= ~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 + ~x~0; {9058#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:07,786 INFO L290 TraceCheckUtils]: 52: Hoare triple {9058#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9083#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:07,786 INFO L290 TraceCheckUtils]: 53: Hoare triple {9083#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {9083#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:07,787 INFO L272 TraceCheckUtils]: 54: Hoare triple {9083#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9083#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:07,787 INFO L290 TraceCheckUtils]: 55: Hoare triple {9083#(<= ~counter~0 6)} ~cond := #in~cond; {9083#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:07,787 INFO L290 TraceCheckUtils]: 56: Hoare triple {9083#(<= ~counter~0 6)} assume !(0 == ~cond); {9083#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:07,788 INFO L290 TraceCheckUtils]: 57: Hoare triple {9083#(<= ~counter~0 6)} assume true; {9083#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:07,788 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9083#(<= ~counter~0 6)} {9083#(<= ~counter~0 6)} #55#return; {9083#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:07,788 INFO L290 TraceCheckUtils]: 59: Hoare triple {9083#(<= ~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 + ~x~0; {9083#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:07,789 INFO L290 TraceCheckUtils]: 60: Hoare triple {9083#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9108#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:07,789 INFO L290 TraceCheckUtils]: 61: Hoare triple {9108#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {9108#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:07,789 INFO L272 TraceCheckUtils]: 62: Hoare triple {9108#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9108#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:07,790 INFO L290 TraceCheckUtils]: 63: Hoare triple {9108#(<= ~counter~0 7)} ~cond := #in~cond; {9108#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:07,790 INFO L290 TraceCheckUtils]: 64: Hoare triple {9108#(<= ~counter~0 7)} assume !(0 == ~cond); {9108#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:07,790 INFO L290 TraceCheckUtils]: 65: Hoare triple {9108#(<= ~counter~0 7)} assume true; {9108#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:07,790 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9108#(<= ~counter~0 7)} {9108#(<= ~counter~0 7)} #55#return; {9108#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:07,791 INFO L290 TraceCheckUtils]: 67: Hoare triple {9108#(<= ~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 + ~x~0; {9108#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:07,791 INFO L290 TraceCheckUtils]: 68: Hoare triple {9108#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9133#(<= |main_#t~post5| 7)} is VALID [2022-04-08 14:22:07,791 INFO L290 TraceCheckUtils]: 69: Hoare triple {9133#(<= |main_#t~post5| 7)} assume !(#t~post5 < 20);havoc #t~post5; {8917#false} is VALID [2022-04-08 14:22:07,791 INFO L272 TraceCheckUtils]: 70: Hoare triple {8917#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8917#false} is VALID [2022-04-08 14:22:07,792 INFO L290 TraceCheckUtils]: 71: Hoare triple {8917#false} ~cond := #in~cond; {8917#false} is VALID [2022-04-08 14:22:07,792 INFO L290 TraceCheckUtils]: 72: Hoare triple {8917#false} assume !(0 == ~cond); {8917#false} is VALID [2022-04-08 14:22:07,792 INFO L290 TraceCheckUtils]: 73: Hoare triple {8917#false} assume true; {8917#false} is VALID [2022-04-08 14:22:07,792 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8917#false} {8917#false} #57#return; {8917#false} is VALID [2022-04-08 14:22:07,792 INFO L272 TraceCheckUtils]: 75: Hoare triple {8917#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8917#false} is VALID [2022-04-08 14:22:07,792 INFO L290 TraceCheckUtils]: 76: Hoare triple {8917#false} ~cond := #in~cond; {8917#false} is VALID [2022-04-08 14:22:07,792 INFO L290 TraceCheckUtils]: 77: Hoare triple {8917#false} assume 0 == ~cond; {8917#false} is VALID [2022-04-08 14:22:07,792 INFO L290 TraceCheckUtils]: 78: Hoare triple {8917#false} assume !false; {8917#false} is VALID [2022-04-08 14:22:07,792 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:22:07,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:22:08,198 INFO L290 TraceCheckUtils]: 78: Hoare triple {8917#false} assume !false; {8917#false} is VALID [2022-04-08 14:22:08,198 INFO L290 TraceCheckUtils]: 77: Hoare triple {8917#false} assume 0 == ~cond; {8917#false} is VALID [2022-04-08 14:22:08,198 INFO L290 TraceCheckUtils]: 76: Hoare triple {8917#false} ~cond := #in~cond; {8917#false} is VALID [2022-04-08 14:22:08,198 INFO L272 TraceCheckUtils]: 75: Hoare triple {8917#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8917#false} is VALID [2022-04-08 14:22:08,199 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8916#true} {8917#false} #57#return; {8917#false} is VALID [2022-04-08 14:22:08,199 INFO L290 TraceCheckUtils]: 73: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-08 14:22:08,199 INFO L290 TraceCheckUtils]: 72: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-08 14:22:08,199 INFO L290 TraceCheckUtils]: 71: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-08 14:22:08,199 INFO L272 TraceCheckUtils]: 70: Hoare triple {8917#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-08 14:22:08,199 INFO L290 TraceCheckUtils]: 69: Hoare triple {9191#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {8917#false} is VALID [2022-04-08 14:22:08,199 INFO L290 TraceCheckUtils]: 68: Hoare triple {9195#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9191#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:22:08,200 INFO L290 TraceCheckUtils]: 67: Hoare triple {9195#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9195#(< ~counter~0 20)} is VALID [2022-04-08 14:22:08,200 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8916#true} {9195#(< ~counter~0 20)} #55#return; {9195#(< ~counter~0 20)} is VALID [2022-04-08 14:22:08,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-08 14:22:08,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-08 14:22:08,200 INFO L290 TraceCheckUtils]: 63: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-08 14:22:08,200 INFO L272 TraceCheckUtils]: 62: Hoare triple {9195#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-08 14:22:08,201 INFO L290 TraceCheckUtils]: 61: Hoare triple {9195#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {9195#(< ~counter~0 20)} is VALID [2022-04-08 14:22:08,201 INFO L290 TraceCheckUtils]: 60: Hoare triple {9220#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9195#(< ~counter~0 20)} is VALID [2022-04-08 14:22:08,202 INFO L290 TraceCheckUtils]: 59: Hoare triple {9220#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9220#(< ~counter~0 19)} is VALID [2022-04-08 14:22:08,202 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8916#true} {9220#(< ~counter~0 19)} #55#return; {9220#(< ~counter~0 19)} is VALID [2022-04-08 14:22:08,202 INFO L290 TraceCheckUtils]: 57: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-08 14:22:08,202 INFO L290 TraceCheckUtils]: 56: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-08 14:22:08,202 INFO L290 TraceCheckUtils]: 55: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-08 14:22:08,202 INFO L272 TraceCheckUtils]: 54: Hoare triple {9220#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-08 14:22:08,203 INFO L290 TraceCheckUtils]: 53: Hoare triple {9220#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {9220#(< ~counter~0 19)} is VALID [2022-04-08 14:22:08,203 INFO L290 TraceCheckUtils]: 52: Hoare triple {9245#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9220#(< ~counter~0 19)} is VALID [2022-04-08 14:22:08,203 INFO L290 TraceCheckUtils]: 51: Hoare triple {9245#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9245#(< ~counter~0 18)} is VALID [2022-04-08 14:22:08,204 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8916#true} {9245#(< ~counter~0 18)} #55#return; {9245#(< ~counter~0 18)} is VALID [2022-04-08 14:22:08,204 INFO L290 TraceCheckUtils]: 49: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-08 14:22:08,204 INFO L290 TraceCheckUtils]: 48: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-08 14:22:08,204 INFO L290 TraceCheckUtils]: 47: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-08 14:22:08,204 INFO L272 TraceCheckUtils]: 46: Hoare triple {9245#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-08 14:22:08,204 INFO L290 TraceCheckUtils]: 45: Hoare triple {9245#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {9245#(< ~counter~0 18)} is VALID [2022-04-08 14:22:08,205 INFO L290 TraceCheckUtils]: 44: Hoare triple {9270#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9245#(< ~counter~0 18)} is VALID [2022-04-08 14:22:08,205 INFO L290 TraceCheckUtils]: 43: Hoare triple {9270#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9270#(< ~counter~0 17)} is VALID [2022-04-08 14:22:08,205 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8916#true} {9270#(< ~counter~0 17)} #55#return; {9270#(< ~counter~0 17)} is VALID [2022-04-08 14:22:08,205 INFO L290 TraceCheckUtils]: 41: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-08 14:22:08,206 INFO L290 TraceCheckUtils]: 40: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-08 14:22:08,206 INFO L290 TraceCheckUtils]: 39: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-08 14:22:08,206 INFO L272 TraceCheckUtils]: 38: Hoare triple {9270#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-08 14:22:08,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {9270#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {9270#(< ~counter~0 17)} is VALID [2022-04-08 14:22:08,206 INFO L290 TraceCheckUtils]: 36: Hoare triple {9295#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9270#(< ~counter~0 17)} is VALID [2022-04-08 14:22:08,207 INFO L290 TraceCheckUtils]: 35: Hoare triple {9295#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9295#(< ~counter~0 16)} is VALID [2022-04-08 14:22:08,207 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8916#true} {9295#(< ~counter~0 16)} #55#return; {9295#(< ~counter~0 16)} is VALID [2022-04-08 14:22:08,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-08 14:22:08,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-08 14:22:08,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-08 14:22:08,207 INFO L272 TraceCheckUtils]: 30: Hoare triple {9295#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-08 14:22:08,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {9295#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {9295#(< ~counter~0 16)} is VALID [2022-04-08 14:22:08,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {9320#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9295#(< ~counter~0 16)} is VALID [2022-04-08 14:22:08,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {9320#(< ~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 + ~x~0; {9320#(< ~counter~0 15)} is VALID [2022-04-08 14:22:08,209 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8916#true} {9320#(< ~counter~0 15)} #55#return; {9320#(< ~counter~0 15)} is VALID [2022-04-08 14:22:08,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-08 14:22:08,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-08 14:22:08,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-08 14:22:08,209 INFO L272 TraceCheckUtils]: 22: Hoare triple {9320#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-08 14:22:08,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {9320#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {9320#(< ~counter~0 15)} is VALID [2022-04-08 14:22:08,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {9345#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9320#(< ~counter~0 15)} is VALID [2022-04-08 14:22:08,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {9345#(< ~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 + ~x~0; {9345#(< ~counter~0 14)} is VALID [2022-04-08 14:22:08,210 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8916#true} {9345#(< ~counter~0 14)} #55#return; {9345#(< ~counter~0 14)} is VALID [2022-04-08 14:22:08,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-08 14:22:08,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-08 14:22:08,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-08 14:22:08,211 INFO L272 TraceCheckUtils]: 14: Hoare triple {9345#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-08 14:22:08,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {9345#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {9345#(< ~counter~0 14)} is VALID [2022-04-08 14:22:08,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {9370#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9345#(< ~counter~0 14)} is VALID [2022-04-08 14:22:08,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {9370#(< ~counter~0 13)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9370#(< ~counter~0 13)} is VALID [2022-04-08 14:22:08,212 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8916#true} {9370#(< ~counter~0 13)} #53#return; {9370#(< ~counter~0 13)} is VALID [2022-04-08 14:22:08,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-08 14:22:08,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-08 14:22:08,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-08 14:22:08,212 INFO L272 TraceCheckUtils]: 6: Hoare triple {9370#(< ~counter~0 13)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8916#true} is VALID [2022-04-08 14:22:08,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {9370#(< ~counter~0 13)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {9370#(< ~counter~0 13)} is VALID [2022-04-08 14:22:08,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {9370#(< ~counter~0 13)} call #t~ret6 := main(); {9370#(< ~counter~0 13)} is VALID [2022-04-08 14:22:08,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9370#(< ~counter~0 13)} {8916#true} #61#return; {9370#(< ~counter~0 13)} is VALID [2022-04-08 14:22:08,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {9370#(< ~counter~0 13)} assume true; {9370#(< ~counter~0 13)} is VALID [2022-04-08 14:22:08,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {8916#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; {9370#(< ~counter~0 13)} is VALID [2022-04-08 14:22:08,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {8916#true} call ULTIMATE.init(); {8916#true} is VALID [2022-04-08 14:22:08,215 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:22:08,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:22:08,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245992117] [2022-04-08 14:22:08,215 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:22:08,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096207170] [2022-04-08 14:22:08,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096207170] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:22:08,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:22:08,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 14:22:08,219 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:22:08,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1764340368] [2022-04-08 14:22:08,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1764340368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:22:08,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:22:08,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 14:22:08,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459231645] [2022-04-08 14:22:08,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:22:08,219 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:22:08,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:22:08,222 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:22:08,272 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:22:08,272 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 14:22:08,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:22:08,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 14:22:08,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 14:22:08,273 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:22:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:22:08,587 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-04-08 14:22:08,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 14:22:08,588 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:22:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:22:08,588 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:22:08,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-08 14:22:08,589 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:22:08,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-08 14:22:08,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 94 transitions. [2022-04-08 14:22:08,659 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:22:08,660 INFO L225 Difference]: With dead ends: 94 [2022-04-08 14:22:08,660 INFO L226 Difference]: Without dead ends: 84 [2022-04-08 14:22:08,660 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:22:08,661 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:22:08,661 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 123 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:22:08,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-08 14:22:08,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-08 14:22:08,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:22:08,747 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:22:08,747 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:22:08,747 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:22:08,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:22:08,751 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-08 14:22:08,751 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-08 14:22:08,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:22:08,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:22:08,752 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:22:08,752 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:22:08,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:22:08,753 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-08 14:22:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-08 14:22:08,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:22:08,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:22:08,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:22:08,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:22:08,754 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:22:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-04-08 14:22:08,756 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2022-04-08 14:22:08,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:22:08,758 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-04-08 14:22:08,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:22:08,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 86 transitions. [2022-04-08 14:22:09,343 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:22:09,344 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-08 14:22:09,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-08 14:22:09,344 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:22:09,344 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:22:09,357 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:22:09,553 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:22:09,553 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:22:09,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:22:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 13 times [2022-04-08 14:22:09,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:22:09,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1979786378] [2022-04-08 14:22:09,639 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:22:09,639 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:22:09,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 14 times [2022-04-08 14:22:09,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:22:09,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059493496] [2022-04-08 14:22:09,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:22:09,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:22:09,650 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:22:09,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [976755018] [2022-04-08 14:22:09,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:22:09,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:22:09,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:22:09,651 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:22:09,652 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:22:15,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:22:15,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:22:15,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 14:22:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:22:15,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:22:15,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {9947#true} call ULTIMATE.init(); {9947#true} is VALID [2022-04-08 14:22:15,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {9947#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; {9947#true} is VALID [2022-04-08 14:22:15,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-08 14:22:15,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9947#true} {9947#true} #61#return; {9947#true} is VALID [2022-04-08 14:22:15,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {9947#true} call #t~ret6 := main(); {9947#true} is VALID [2022-04-08 14:22:15,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {9947#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; {9947#true} is VALID [2022-04-08 14:22:15,991 INFO L272 TraceCheckUtils]: 6: Hoare triple {9947#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {9947#true} is VALID [2022-04-08 14:22:15,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-08 14:22:15,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-08 14:22:15,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-08 14:22:15,991 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9947#true} {9947#true} #53#return; {9947#true} is VALID [2022-04-08 14:22:15,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {9947#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9985#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:22:15,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {9985#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9985#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:22:15,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {9985#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {9985#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:22:15,992 INFO L272 TraceCheckUtils]: 14: Hoare triple {9985#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-08 14:22:15,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-08 14:22:15,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-08 14:22:15,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-08 14:22:15,993 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9947#true} {9985#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {9985#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:22:15,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {9985#(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 + ~x~0; {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:22:15,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:22:15,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:22:15,994 INFO L272 TraceCheckUtils]: 22: Hoare triple {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-08 14:22:15,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-08 14:22:15,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-08 14:22:15,994 INFO L290 TraceCheckUtils]: 25: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-08 14:22:15,995 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9947#true} {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:22:15,995 INFO L290 TraceCheckUtils]: 27: Hoare triple {10010#(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 + ~x~0; {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:22:15,995 INFO L290 TraceCheckUtils]: 28: Hoare triple {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:22:15,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:22:15,996 INFO L272 TraceCheckUtils]: 30: Hoare triple {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-08 14:22:15,996 INFO L290 TraceCheckUtils]: 31: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-08 14:22:15,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-08 14:22:15,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-08 14:22:15,996 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9947#true} {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:22:15,997 INFO L290 TraceCheckUtils]: 35: Hoare triple {10035#(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 + ~x~0; {10060#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:22:15,997 INFO L290 TraceCheckUtils]: 36: Hoare triple {10060#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10060#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:22:15,997 INFO L290 TraceCheckUtils]: 37: Hoare triple {10060#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {10060#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:22:15,998 INFO L272 TraceCheckUtils]: 38: Hoare triple {10060#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-08 14:22:15,998 INFO L290 TraceCheckUtils]: 39: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-08 14:22:15,998 INFO L290 TraceCheckUtils]: 40: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-08 14:22:15,998 INFO L290 TraceCheckUtils]: 41: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-08 14:22:15,998 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9947#true} {10060#(and (= main_~y~0 3) (= main_~c~0 3))} #55#return; {10060#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:22:15,999 INFO L290 TraceCheckUtils]: 43: Hoare triple {10060#(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 + ~x~0; {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:22:15,999 INFO L290 TraceCheckUtils]: 44: Hoare triple {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:22:15,999 INFO L290 TraceCheckUtils]: 45: Hoare triple {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:22:15,999 INFO L272 TraceCheckUtils]: 46: Hoare triple {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-08 14:22:16,005 INFO L290 TraceCheckUtils]: 47: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-08 14:22:16,005 INFO L290 TraceCheckUtils]: 48: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-08 14:22:16,005 INFO L290 TraceCheckUtils]: 49: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-08 14:22:16,006 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9947#true} {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #55#return; {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:22:16,006 INFO L290 TraceCheckUtils]: 51: Hoare triple {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 14:22:16,007 INFO L290 TraceCheckUtils]: 52: Hoare triple {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 14:22:16,007 INFO L290 TraceCheckUtils]: 53: Hoare triple {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 14:22:16,007 INFO L272 TraceCheckUtils]: 54: Hoare triple {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-08 14:22:16,007 INFO L290 TraceCheckUtils]: 55: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-08 14:22:16,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-08 14:22:16,007 INFO L290 TraceCheckUtils]: 57: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-08 14:22:16,008 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9947#true} {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #55#return; {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 14:22:16,008 INFO L290 TraceCheckUtils]: 59: Hoare triple {10110#(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 + ~x~0; {10135#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:22:16,009 INFO L290 TraceCheckUtils]: 60: Hoare triple {10135#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10135#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:22:16,009 INFO L290 TraceCheckUtils]: 61: Hoare triple {10135#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {10135#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:22:16,009 INFO L272 TraceCheckUtils]: 62: Hoare triple {10135#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-08 14:22:16,009 INFO L290 TraceCheckUtils]: 63: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-08 14:22:16,009 INFO L290 TraceCheckUtils]: 64: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-08 14:22:16,009 INFO L290 TraceCheckUtils]: 65: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-08 14:22:16,010 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9947#true} {10135#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {10135#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:22:16,010 INFO L290 TraceCheckUtils]: 67: Hoare triple {10135#(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 + ~x~0; {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 14:22:16,010 INFO L290 TraceCheckUtils]: 68: Hoare triple {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 14:22:16,011 INFO L290 TraceCheckUtils]: 69: Hoare triple {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 14:22:16,011 INFO L272 TraceCheckUtils]: 70: Hoare triple {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-08 14:22:16,011 INFO L290 TraceCheckUtils]: 71: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-08 14:22:16,011 INFO L290 TraceCheckUtils]: 72: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-08 14:22:16,011 INFO L290 TraceCheckUtils]: 73: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-08 14:22:16,012 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9947#true} {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #55#return; {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 14:22:16,012 INFO L290 TraceCheckUtils]: 75: Hoare triple {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {10185#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 14:22:16,012 INFO L272 TraceCheckUtils]: 76: Hoare triple {10185#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-08 14:22:16,012 INFO L290 TraceCheckUtils]: 77: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-08 14:22:16,013 INFO L290 TraceCheckUtils]: 78: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-08 14:22:16,013 INFO L290 TraceCheckUtils]: 79: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-08 14:22:16,013 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9947#true} {10185#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #57#return; {10185#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 14:22:16,014 INFO L272 TraceCheckUtils]: 81: Hoare triple {10185#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10204#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:22:16,014 INFO L290 TraceCheckUtils]: 82: Hoare triple {10204#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10208#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:22:16,014 INFO L290 TraceCheckUtils]: 83: Hoare triple {10208#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9948#false} is VALID [2022-04-08 14:22:16,014 INFO L290 TraceCheckUtils]: 84: Hoare triple {9948#false} assume !false; {9948#false} is VALID [2022-04-08 14:22:16,015 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:22:16,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:22:16,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:22:16,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059493496] [2022-04-08 14:22:16,378 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:22:16,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976755018] [2022-04-08 14:22:16,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976755018] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:22:16,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:22:16,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 14:22:16,379 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:22:16,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1979786378] [2022-04-08 14:22:16,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1979786378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:22:16,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:22:16,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 14:22:16,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388251714] [2022-04-08 14:22:16,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:22:16,380 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:22:16,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:22:16,380 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:22:16,421 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:22:16,421 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 14:22:16,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:22:16,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 14:22:16,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:22:16,421 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:22:17,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:22:17,290 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-08 14:22:17,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 14:22:17,290 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:22:17,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:22:17,291 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:22:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-08 14:22:17,292 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:22:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-08 14:22:17,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2022-04-08 14:22:17,349 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:22:17,350 INFO L225 Difference]: With dead ends: 92 [2022-04-08 14:22:17,350 INFO L226 Difference]: Without dead ends: 86 [2022-04-08 14:22:17,351 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:22:17,351 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:22:17,351 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:22:17,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-08 14:22:17,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-08 14:22:17,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:22:17,437 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:22:17,437 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:22:17,437 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:22:17,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:22:17,438 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-08 14:22:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-08 14:22:17,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:22:17,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:22:17,438 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:22:17,439 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:22:17,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:22:17,440 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-08 14:22:17,440 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-08 14:22:17,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:22:17,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:22:17,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:22:17,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:22:17,440 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:22:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-04-08 14:22:17,441 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 85 [2022-04-08 14:22:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:22:17,441 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-04-08 14:22:17,441 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:22:17,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 89 transitions. [2022-04-08 14:22:17,836 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:22:17,837 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-08 14:22:17,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-08 14:22:17,843 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:22:17,843 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:22:17,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-08 14:22:18,049 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:22:18,050 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:22:18,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:22:18,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 13 times [2022-04-08 14:22:18,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:22:18,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [610330694] [2022-04-08 14:22:18,127 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:22:18,127 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:22:18,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 14 times [2022-04-08 14:22:18,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:22:18,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026488795] [2022-04-08 14:22:18,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:22:18,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:22:18,137 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:22:18,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1463644851] [2022-04-08 14:22:18,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:22:18,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:22:18,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:22:18,138 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:22:18,139 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:22:18,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:22:18,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:22:18,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 14:22:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:22:18,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:22:18,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {10806#true} call ULTIMATE.init(); {10806#true} is VALID [2022-04-08 14:22:18,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {10806#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; {10814#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:18,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {10814#(<= ~counter~0 0)} assume true; {10814#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:18,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10814#(<= ~counter~0 0)} {10806#true} #61#return; {10814#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:18,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {10814#(<= ~counter~0 0)} call #t~ret6 := main(); {10814#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:18,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {10814#(<= ~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; {10814#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:18,582 INFO L272 TraceCheckUtils]: 6: Hoare triple {10814#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10814#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:18,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {10814#(<= ~counter~0 0)} ~cond := #in~cond; {10814#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:18,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {10814#(<= ~counter~0 0)} assume !(0 == ~cond); {10814#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:18,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {10814#(<= ~counter~0 0)} assume true; {10814#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:18,583 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10814#(<= ~counter~0 0)} {10814#(<= ~counter~0 0)} #53#return; {10814#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:18,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {10814#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10814#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:18,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {10814#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10848#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:18,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {10848#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {10848#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:18,585 INFO L272 TraceCheckUtils]: 14: Hoare triple {10848#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10848#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:18,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {10848#(<= ~counter~0 1)} ~cond := #in~cond; {10848#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:18,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {10848#(<= ~counter~0 1)} assume !(0 == ~cond); {10848#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:18,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {10848#(<= ~counter~0 1)} assume true; {10848#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:18,586 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10848#(<= ~counter~0 1)} {10848#(<= ~counter~0 1)} #55#return; {10848#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:18,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {10848#(<= ~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 + ~x~0; {10848#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:18,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {10848#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10873#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:18,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {10873#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {10873#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:18,587 INFO L272 TraceCheckUtils]: 22: Hoare triple {10873#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10873#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:18,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {10873#(<= ~counter~0 2)} ~cond := #in~cond; {10873#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:18,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {10873#(<= ~counter~0 2)} assume !(0 == ~cond); {10873#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:18,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {10873#(<= ~counter~0 2)} assume true; {10873#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:18,588 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10873#(<= ~counter~0 2)} {10873#(<= ~counter~0 2)} #55#return; {10873#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:18,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {10873#(<= ~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 + ~x~0; {10873#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:18,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {10873#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10898#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:18,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {10898#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {10898#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:18,590 INFO L272 TraceCheckUtils]: 30: Hoare triple {10898#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10898#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:18,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {10898#(<= ~counter~0 3)} ~cond := #in~cond; {10898#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:18,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {10898#(<= ~counter~0 3)} assume !(0 == ~cond); {10898#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:18,590 INFO L290 TraceCheckUtils]: 33: Hoare triple {10898#(<= ~counter~0 3)} assume true; {10898#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:18,591 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10898#(<= ~counter~0 3)} {10898#(<= ~counter~0 3)} #55#return; {10898#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:18,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {10898#(<= ~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 + ~x~0; {10898#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:18,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {10898#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10923#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:18,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {10923#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {10923#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:18,592 INFO L272 TraceCheckUtils]: 38: Hoare triple {10923#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10923#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:18,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {10923#(<= ~counter~0 4)} ~cond := #in~cond; {10923#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:18,593 INFO L290 TraceCheckUtils]: 40: Hoare triple {10923#(<= ~counter~0 4)} assume !(0 == ~cond); {10923#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:18,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {10923#(<= ~counter~0 4)} assume true; {10923#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:18,593 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10923#(<= ~counter~0 4)} {10923#(<= ~counter~0 4)} #55#return; {10923#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:18,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {10923#(<= ~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 + ~x~0; {10923#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:18,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {10923#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10948#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:18,594 INFO L290 TraceCheckUtils]: 45: Hoare triple {10948#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {10948#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:18,595 INFO L272 TraceCheckUtils]: 46: Hoare triple {10948#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10948#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:18,595 INFO L290 TraceCheckUtils]: 47: Hoare triple {10948#(<= ~counter~0 5)} ~cond := #in~cond; {10948#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:18,595 INFO L290 TraceCheckUtils]: 48: Hoare triple {10948#(<= ~counter~0 5)} assume !(0 == ~cond); {10948#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:18,595 INFO L290 TraceCheckUtils]: 49: Hoare triple {10948#(<= ~counter~0 5)} assume true; {10948#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:18,596 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10948#(<= ~counter~0 5)} {10948#(<= ~counter~0 5)} #55#return; {10948#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:18,596 INFO L290 TraceCheckUtils]: 51: Hoare triple {10948#(<= ~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 + ~x~0; {10948#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:18,597 INFO L290 TraceCheckUtils]: 52: Hoare triple {10948#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10973#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:18,597 INFO L290 TraceCheckUtils]: 53: Hoare triple {10973#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {10973#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:18,597 INFO L272 TraceCheckUtils]: 54: Hoare triple {10973#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10973#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:18,597 INFO L290 TraceCheckUtils]: 55: Hoare triple {10973#(<= ~counter~0 6)} ~cond := #in~cond; {10973#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:18,598 INFO L290 TraceCheckUtils]: 56: Hoare triple {10973#(<= ~counter~0 6)} assume !(0 == ~cond); {10973#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:18,598 INFO L290 TraceCheckUtils]: 57: Hoare triple {10973#(<= ~counter~0 6)} assume true; {10973#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:18,598 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10973#(<= ~counter~0 6)} {10973#(<= ~counter~0 6)} #55#return; {10973#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:18,599 INFO L290 TraceCheckUtils]: 59: Hoare triple {10973#(<= ~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 + ~x~0; {10973#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:18,599 INFO L290 TraceCheckUtils]: 60: Hoare triple {10973#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10998#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:18,599 INFO L290 TraceCheckUtils]: 61: Hoare triple {10998#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {10998#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:18,600 INFO L272 TraceCheckUtils]: 62: Hoare triple {10998#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10998#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:18,600 INFO L290 TraceCheckUtils]: 63: Hoare triple {10998#(<= ~counter~0 7)} ~cond := #in~cond; {10998#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:18,600 INFO L290 TraceCheckUtils]: 64: Hoare triple {10998#(<= ~counter~0 7)} assume !(0 == ~cond); {10998#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:18,601 INFO L290 TraceCheckUtils]: 65: Hoare triple {10998#(<= ~counter~0 7)} assume true; {10998#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:18,601 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10998#(<= ~counter~0 7)} {10998#(<= ~counter~0 7)} #55#return; {10998#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:18,601 INFO L290 TraceCheckUtils]: 67: Hoare triple {10998#(<= ~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 + ~x~0; {10998#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:18,602 INFO L290 TraceCheckUtils]: 68: Hoare triple {10998#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11023#(<= ~counter~0 8)} is VALID [2022-04-08 14:22:18,602 INFO L290 TraceCheckUtils]: 69: Hoare triple {11023#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {11023#(<= ~counter~0 8)} is VALID [2022-04-08 14:22:18,602 INFO L272 TraceCheckUtils]: 70: Hoare triple {11023#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11023#(<= ~counter~0 8)} is VALID [2022-04-08 14:22:18,603 INFO L290 TraceCheckUtils]: 71: Hoare triple {11023#(<= ~counter~0 8)} ~cond := #in~cond; {11023#(<= ~counter~0 8)} is VALID [2022-04-08 14:22:18,603 INFO L290 TraceCheckUtils]: 72: Hoare triple {11023#(<= ~counter~0 8)} assume !(0 == ~cond); {11023#(<= ~counter~0 8)} is VALID [2022-04-08 14:22:18,603 INFO L290 TraceCheckUtils]: 73: Hoare triple {11023#(<= ~counter~0 8)} assume true; {11023#(<= ~counter~0 8)} is VALID [2022-04-08 14:22:18,603 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11023#(<= ~counter~0 8)} {11023#(<= ~counter~0 8)} #55#return; {11023#(<= ~counter~0 8)} is VALID [2022-04-08 14:22:18,604 INFO L290 TraceCheckUtils]: 75: Hoare triple {11023#(<= ~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 + ~x~0; {11023#(<= ~counter~0 8)} is VALID [2022-04-08 14:22:18,604 INFO L290 TraceCheckUtils]: 76: Hoare triple {11023#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11048#(<= |main_#t~post5| 8)} is VALID [2022-04-08 14:22:18,604 INFO L290 TraceCheckUtils]: 77: Hoare triple {11048#(<= |main_#t~post5| 8)} assume !(#t~post5 < 20);havoc #t~post5; {10807#false} is VALID [2022-04-08 14:22:18,604 INFO L272 TraceCheckUtils]: 78: Hoare triple {10807#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10807#false} is VALID [2022-04-08 14:22:18,604 INFO L290 TraceCheckUtils]: 79: Hoare triple {10807#false} ~cond := #in~cond; {10807#false} is VALID [2022-04-08 14:22:18,605 INFO L290 TraceCheckUtils]: 80: Hoare triple {10807#false} assume !(0 == ~cond); {10807#false} is VALID [2022-04-08 14:22:18,605 INFO L290 TraceCheckUtils]: 81: Hoare triple {10807#false} assume true; {10807#false} is VALID [2022-04-08 14:22:18,605 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10807#false} {10807#false} #57#return; {10807#false} is VALID [2022-04-08 14:22:18,605 INFO L272 TraceCheckUtils]: 83: Hoare triple {10807#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10807#false} is VALID [2022-04-08 14:22:18,605 INFO L290 TraceCheckUtils]: 84: Hoare triple {10807#false} ~cond := #in~cond; {10807#false} is VALID [2022-04-08 14:22:18,605 INFO L290 TraceCheckUtils]: 85: Hoare triple {10807#false} assume 0 == ~cond; {10807#false} is VALID [2022-04-08 14:22:18,605 INFO L290 TraceCheckUtils]: 86: Hoare triple {10807#false} assume !false; {10807#false} is VALID [2022-04-08 14:22:18,605 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:22:18,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:22:19,038 INFO L290 TraceCheckUtils]: 86: Hoare triple {10807#false} assume !false; {10807#false} is VALID [2022-04-08 14:22:19,038 INFO L290 TraceCheckUtils]: 85: Hoare triple {10807#false} assume 0 == ~cond; {10807#false} is VALID [2022-04-08 14:22:19,038 INFO L290 TraceCheckUtils]: 84: Hoare triple {10807#false} ~cond := #in~cond; {10807#false} is VALID [2022-04-08 14:22:19,038 INFO L272 TraceCheckUtils]: 83: Hoare triple {10807#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10807#false} is VALID [2022-04-08 14:22:19,038 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10806#true} {10807#false} #57#return; {10807#false} is VALID [2022-04-08 14:22:19,039 INFO L290 TraceCheckUtils]: 81: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-08 14:22:19,039 INFO L290 TraceCheckUtils]: 80: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-08 14:22:19,039 INFO L290 TraceCheckUtils]: 79: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-08 14:22:19,039 INFO L272 TraceCheckUtils]: 78: Hoare triple {10807#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-08 14:22:19,039 INFO L290 TraceCheckUtils]: 77: Hoare triple {11106#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {10807#false} is VALID [2022-04-08 14:22:19,039 INFO L290 TraceCheckUtils]: 76: Hoare triple {11110#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11106#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:22:19,040 INFO L290 TraceCheckUtils]: 75: Hoare triple {11110#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11110#(< ~counter~0 20)} is VALID [2022-04-08 14:22:19,040 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10806#true} {11110#(< ~counter~0 20)} #55#return; {11110#(< ~counter~0 20)} is VALID [2022-04-08 14:22:19,040 INFO L290 TraceCheckUtils]: 73: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-08 14:22:19,040 INFO L290 TraceCheckUtils]: 72: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-08 14:22:19,040 INFO L290 TraceCheckUtils]: 71: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-08 14:22:19,040 INFO L272 TraceCheckUtils]: 70: Hoare triple {11110#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-08 14:22:19,041 INFO L290 TraceCheckUtils]: 69: Hoare triple {11110#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {11110#(< ~counter~0 20)} is VALID [2022-04-08 14:22:19,041 INFO L290 TraceCheckUtils]: 68: Hoare triple {11135#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11110#(< ~counter~0 20)} is VALID [2022-04-08 14:22:19,041 INFO L290 TraceCheckUtils]: 67: Hoare triple {11135#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11135#(< ~counter~0 19)} is VALID [2022-04-08 14:22:19,042 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10806#true} {11135#(< ~counter~0 19)} #55#return; {11135#(< ~counter~0 19)} is VALID [2022-04-08 14:22:19,042 INFO L290 TraceCheckUtils]: 65: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-08 14:22:19,042 INFO L290 TraceCheckUtils]: 64: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-08 14:22:19,042 INFO L290 TraceCheckUtils]: 63: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-08 14:22:19,042 INFO L272 TraceCheckUtils]: 62: Hoare triple {11135#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-08 14:22:19,042 INFO L290 TraceCheckUtils]: 61: Hoare triple {11135#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {11135#(< ~counter~0 19)} is VALID [2022-04-08 14:22:19,043 INFO L290 TraceCheckUtils]: 60: Hoare triple {11160#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11135#(< ~counter~0 19)} is VALID [2022-04-08 14:22:19,043 INFO L290 TraceCheckUtils]: 59: Hoare triple {11160#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11160#(< ~counter~0 18)} is VALID [2022-04-08 14:22:19,044 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10806#true} {11160#(< ~counter~0 18)} #55#return; {11160#(< ~counter~0 18)} is VALID [2022-04-08 14:22:19,044 INFO L290 TraceCheckUtils]: 57: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-08 14:22:19,044 INFO L290 TraceCheckUtils]: 56: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-08 14:22:19,044 INFO L290 TraceCheckUtils]: 55: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-08 14:22:19,044 INFO L272 TraceCheckUtils]: 54: Hoare triple {11160#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-08 14:22:19,044 INFO L290 TraceCheckUtils]: 53: Hoare triple {11160#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {11160#(< ~counter~0 18)} is VALID [2022-04-08 14:22:19,045 INFO L290 TraceCheckUtils]: 52: Hoare triple {11185#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11160#(< ~counter~0 18)} is VALID [2022-04-08 14:22:19,045 INFO L290 TraceCheckUtils]: 51: Hoare triple {11185#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11185#(< ~counter~0 17)} is VALID [2022-04-08 14:22:19,045 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10806#true} {11185#(< ~counter~0 17)} #55#return; {11185#(< ~counter~0 17)} is VALID [2022-04-08 14:22:19,045 INFO L290 TraceCheckUtils]: 49: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-08 14:22:19,045 INFO L290 TraceCheckUtils]: 48: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-08 14:22:19,045 INFO L290 TraceCheckUtils]: 47: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-08 14:22:19,046 INFO L272 TraceCheckUtils]: 46: Hoare triple {11185#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-08 14:22:19,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {11185#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {11185#(< ~counter~0 17)} is VALID [2022-04-08 14:22:19,046 INFO L290 TraceCheckUtils]: 44: Hoare triple {11210#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11185#(< ~counter~0 17)} is VALID [2022-04-08 14:22:19,046 INFO L290 TraceCheckUtils]: 43: Hoare triple {11210#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11210#(< ~counter~0 16)} is VALID [2022-04-08 14:22:19,047 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10806#true} {11210#(< ~counter~0 16)} #55#return; {11210#(< ~counter~0 16)} is VALID [2022-04-08 14:22:19,047 INFO L290 TraceCheckUtils]: 41: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-08 14:22:19,047 INFO L290 TraceCheckUtils]: 40: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-08 14:22:19,047 INFO L290 TraceCheckUtils]: 39: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-08 14:22:19,047 INFO L272 TraceCheckUtils]: 38: Hoare triple {11210#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-08 14:22:19,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {11210#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {11210#(< ~counter~0 16)} is VALID [2022-04-08 14:22:19,064 INFO L290 TraceCheckUtils]: 36: Hoare triple {11235#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11210#(< ~counter~0 16)} is VALID [2022-04-08 14:22:19,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {11235#(< ~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 + ~x~0; {11235#(< ~counter~0 15)} is VALID [2022-04-08 14:22:19,064 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10806#true} {11235#(< ~counter~0 15)} #55#return; {11235#(< ~counter~0 15)} is VALID [2022-04-08 14:22:19,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-08 14:22:19,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-08 14:22:19,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-08 14:22:19,065 INFO L272 TraceCheckUtils]: 30: Hoare triple {11235#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-08 14:22:19,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {11235#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {11235#(< ~counter~0 15)} is VALID [2022-04-08 14:22:19,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {11260#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11235#(< ~counter~0 15)} is VALID [2022-04-08 14:22:19,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {11260#(< ~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 + ~x~0; {11260#(< ~counter~0 14)} is VALID [2022-04-08 14:22:19,066 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10806#true} {11260#(< ~counter~0 14)} #55#return; {11260#(< ~counter~0 14)} is VALID [2022-04-08 14:22:19,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-08 14:22:19,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-08 14:22:19,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-08 14:22:19,066 INFO L272 TraceCheckUtils]: 22: Hoare triple {11260#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-08 14:22:19,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {11260#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {11260#(< ~counter~0 14)} is VALID [2022-04-08 14:22:19,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {11285#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11260#(< ~counter~0 14)} is VALID [2022-04-08 14:22:19,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {11285#(< ~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 + ~x~0; {11285#(< ~counter~0 13)} is VALID [2022-04-08 14:22:19,068 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10806#true} {11285#(< ~counter~0 13)} #55#return; {11285#(< ~counter~0 13)} is VALID [2022-04-08 14:22:19,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-08 14:22:19,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-08 14:22:19,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-08 14:22:19,068 INFO L272 TraceCheckUtils]: 14: Hoare triple {11285#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-08 14:22:19,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {11285#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {11285#(< ~counter~0 13)} is VALID [2022-04-08 14:22:19,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {11310#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11285#(< ~counter~0 13)} is VALID [2022-04-08 14:22:19,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {11310#(< ~counter~0 12)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11310#(< ~counter~0 12)} is VALID [2022-04-08 14:22:19,070 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10806#true} {11310#(< ~counter~0 12)} #53#return; {11310#(< ~counter~0 12)} is VALID [2022-04-08 14:22:19,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-08 14:22:19,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-08 14:22:19,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-08 14:22:19,070 INFO L272 TraceCheckUtils]: 6: Hoare triple {11310#(< ~counter~0 12)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10806#true} is VALID [2022-04-08 14:22:19,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {11310#(< ~counter~0 12)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {11310#(< ~counter~0 12)} is VALID [2022-04-08 14:22:19,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {11310#(< ~counter~0 12)} call #t~ret6 := main(); {11310#(< ~counter~0 12)} is VALID [2022-04-08 14:22:19,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11310#(< ~counter~0 12)} {10806#true} #61#return; {11310#(< ~counter~0 12)} is VALID [2022-04-08 14:22:19,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {11310#(< ~counter~0 12)} assume true; {11310#(< ~counter~0 12)} is VALID [2022-04-08 14:22:19,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {10806#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; {11310#(< ~counter~0 12)} is VALID [2022-04-08 14:22:19,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {10806#true} call ULTIMATE.init(); {10806#true} is VALID [2022-04-08 14:22:19,072 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:22:19,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:22:19,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026488795] [2022-04-08 14:22:19,072 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:22:19,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463644851] [2022-04-08 14:22:19,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463644851] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:22:19,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:22:19,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-08 14:22:19,073 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:22:19,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [610330694] [2022-04-08 14:22:19,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [610330694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:22:19,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:22:19,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 14:22:19,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128416493] [2022-04-08 14:22:19,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:22:19,073 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:22:19,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:22:19,074 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:22:19,140 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:22:19,140 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 14:22:19,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:22:19,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 14:22:19,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-08 14:22:19,141 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:22:19,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:22:19,471 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2022-04-08 14:22:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 14:22:19,471 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:22:19,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:22:19,471 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:22:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-08 14:22:19,473 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:22:19,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-08 14:22:19,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 102 transitions. [2022-04-08 14:22:19,554 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:22:19,556 INFO L225 Difference]: With dead ends: 102 [2022-04-08 14:22:19,556 INFO L226 Difference]: Without dead ends: 92 [2022-04-08 14:22:19,556 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:22:19,556 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:22:19,557 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 138 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:22:19,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-08 14:22:19,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-08 14:22:19,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:22:19,661 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:22:19,661 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:22:19,661 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:22:19,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:22:19,663 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-08 14:22:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-08 14:22:19,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:22:19,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:22:19,663 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:22:19,663 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:22:19,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:22:19,664 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-08 14:22:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-08 14:22:19,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:22:19,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:22:19,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:22:19,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:22:19,665 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:22:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2022-04-08 14:22:19,666 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 87 [2022-04-08 14:22:19,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:22:19,666 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2022-04-08 14:22:19,666 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:22:19,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 94 transitions. [2022-04-08 14:22:20,131 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:22:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-08 14:22:20,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-08 14:22:20,132 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:22:20,132 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:22:20,148 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:22:20,332 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:22:20,332 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:22:20,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:22:20,333 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 15 times [2022-04-08 14:22:20,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:22:20,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1996179261] [2022-04-08 14:22:20,412 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:22:20,412 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:22:20,412 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 16 times [2022-04-08 14:22:20,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:22:20,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88009737] [2022-04-08 14:22:20,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:22:20,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:22:20,422 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:22:20,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [942458237] [2022-04-08 14:22:20,422 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:22:20,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:22:20,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:22:20,423 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:22:20,427 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:22:20,468 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:22:20,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:22:20,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 14:22:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:22:20,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:22:20,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {11937#true} call ULTIMATE.init(); {11937#true} is VALID [2022-04-08 14:22:20,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {11937#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; {11937#true} is VALID [2022-04-08 14:22:20,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-08 14:22:20,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11937#true} {11937#true} #61#return; {11937#true} is VALID [2022-04-08 14:22:20,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {11937#true} call #t~ret6 := main(); {11937#true} is VALID [2022-04-08 14:22:20,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {11937#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; {11937#true} is VALID [2022-04-08 14:22:20,958 INFO L272 TraceCheckUtils]: 6: Hoare triple {11937#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {11937#true} is VALID [2022-04-08 14:22:20,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-08 14:22:20,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-08 14:22:20,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-08 14:22:20,958 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11937#true} {11937#true} #53#return; {11937#true} is VALID [2022-04-08 14:22:20,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {11937#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11975#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:22:20,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {11975#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11975#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:22:20,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {11975#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {11975#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:22:20,959 INFO L272 TraceCheckUtils]: 14: Hoare triple {11975#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-08 14:22:20,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-08 14:22:20,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-08 14:22:20,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-08 14:22:20,960 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11937#true} {11975#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {11975#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:22:20,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {11975#(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 + ~x~0; {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:22:20,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:22:20,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:22:20,961 INFO L272 TraceCheckUtils]: 22: Hoare triple {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-08 14:22:20,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-08 14:22:20,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-08 14:22:20,961 INFO L290 TraceCheckUtils]: 25: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-08 14:22:20,962 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11937#true} {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #55#return; {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:22:20,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {12000#(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 + ~x~0; {12025#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 14:22:20,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {12025#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12025#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 14:22:20,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {12025#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {12025#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 14:22:20,963 INFO L272 TraceCheckUtils]: 30: Hoare triple {12025#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-08 14:22:20,963 INFO L290 TraceCheckUtils]: 31: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-08 14:22:20,963 INFO L290 TraceCheckUtils]: 32: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-08 14:22:20,963 INFO L290 TraceCheckUtils]: 33: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-08 14:22:20,963 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11937#true} {12025#(and (= main_~y~0 2) (= main_~c~0 2))} #55#return; {12025#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 14:22:20,964 INFO L290 TraceCheckUtils]: 35: Hoare triple {12025#(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 + ~x~0; {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 14:22:20,964 INFO L290 TraceCheckUtils]: 36: Hoare triple {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 14:22:20,964 INFO L290 TraceCheckUtils]: 37: Hoare triple {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 14:22:20,965 INFO L272 TraceCheckUtils]: 38: Hoare triple {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-08 14:22:20,965 INFO L290 TraceCheckUtils]: 39: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-08 14:22:20,965 INFO L290 TraceCheckUtils]: 40: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-08 14:22:20,965 INFO L290 TraceCheckUtils]: 41: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-08 14:22:20,965 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11937#true} {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #55#return; {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 14:22:20,966 INFO L290 TraceCheckUtils]: 43: Hoare triple {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:22:20,966 INFO L290 TraceCheckUtils]: 44: Hoare triple {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:22:20,966 INFO L290 TraceCheckUtils]: 45: Hoare triple {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:22:20,966 INFO L272 TraceCheckUtils]: 46: Hoare triple {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-08 14:22:20,966 INFO L290 TraceCheckUtils]: 47: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-08 14:22:20,966 INFO L290 TraceCheckUtils]: 48: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-08 14:22:20,967 INFO L290 TraceCheckUtils]: 49: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-08 14:22:20,967 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11937#true} {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #55#return; {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:22:20,967 INFO L290 TraceCheckUtils]: 51: Hoare triple {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 14:22:20,968 INFO L290 TraceCheckUtils]: 52: Hoare triple {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 14:22:20,968 INFO L290 TraceCheckUtils]: 53: Hoare triple {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 14:22:20,968 INFO L272 TraceCheckUtils]: 54: Hoare triple {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-08 14:22:20,968 INFO L290 TraceCheckUtils]: 55: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-08 14:22:20,968 INFO L290 TraceCheckUtils]: 56: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-08 14:22:20,968 INFO L290 TraceCheckUtils]: 57: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-08 14:22:20,975 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11937#true} {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} #55#return; {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 14:22:20,976 INFO L290 TraceCheckUtils]: 59: Hoare triple {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 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 + ~x~0; {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} is VALID [2022-04-08 14:22:20,976 INFO L290 TraceCheckUtils]: 60: Hoare triple {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} is VALID [2022-04-08 14:22:20,977 INFO L290 TraceCheckUtils]: 61: Hoare triple {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} is VALID [2022-04-08 14:22:20,977 INFO L272 TraceCheckUtils]: 62: Hoare triple {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-08 14:22:20,977 INFO L290 TraceCheckUtils]: 63: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-08 14:22:20,977 INFO L290 TraceCheckUtils]: 64: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-08 14:22:20,977 INFO L290 TraceCheckUtils]: 65: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-08 14:22:20,977 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11937#true} {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} #55#return; {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} is VALID [2022-04-08 14:22:20,978 INFO L290 TraceCheckUtils]: 67: Hoare triple {12125#(and (= (+ main_~y~0 (- 4)) 2) (= 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 + ~x~0; {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 14:22:20,978 INFO L290 TraceCheckUtils]: 68: Hoare triple {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 14:22:20,979 INFO L290 TraceCheckUtils]: 69: Hoare triple {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(#t~post5 < 20);havoc #t~post5; {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 14:22:20,979 INFO L272 TraceCheckUtils]: 70: Hoare triple {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-08 14:22:20,979 INFO L290 TraceCheckUtils]: 71: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-08 14:22:20,979 INFO L290 TraceCheckUtils]: 72: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-08 14:22:20,979 INFO L290 TraceCheckUtils]: 73: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-08 14:22:20,980 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11937#true} {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #55#return; {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 14:22:20,980 INFO L290 TraceCheckUtils]: 75: Hoare triple {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 14:22:20,980 INFO L290 TraceCheckUtils]: 76: Hoare triple {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 14:22:20,981 INFO L290 TraceCheckUtils]: 77: Hoare triple {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 14:22:20,981 INFO L272 TraceCheckUtils]: 78: Hoare triple {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-08 14:22:20,981 INFO L290 TraceCheckUtils]: 79: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-08 14:22:20,981 INFO L290 TraceCheckUtils]: 80: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-08 14:22:20,981 INFO L290 TraceCheckUtils]: 81: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-08 14:22:20,982 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {11937#true} {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #55#return; {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 14:22:20,982 INFO L290 TraceCheckUtils]: 83: Hoare triple {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {12200#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} is VALID [2022-04-08 14:22:20,983 INFO L272 TraceCheckUtils]: 84: Hoare triple {12200#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-08 14:22:20,983 INFO L290 TraceCheckUtils]: 85: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-08 14:22:20,983 INFO L290 TraceCheckUtils]: 86: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-08 14:22:20,983 INFO L290 TraceCheckUtils]: 87: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-08 14:22:20,983 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11937#true} {12200#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} #57#return; {12200#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} is VALID [2022-04-08 14:22:20,984 INFO L272 TraceCheckUtils]: 89: Hoare triple {12200#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12219#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:22:20,984 INFO L290 TraceCheckUtils]: 90: Hoare triple {12219#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12223#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:22:20,984 INFO L290 TraceCheckUtils]: 91: Hoare triple {12223#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11938#false} is VALID [2022-04-08 14:22:20,984 INFO L290 TraceCheckUtils]: 92: Hoare triple {11938#false} assume !false; {11938#false} is VALID [2022-04-08 14:22:20,985 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:22:20,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:22:21,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:22:21,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88009737] [2022-04-08 14:22:21,295 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:22:21,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942458237] [2022-04-08 14:22:21,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942458237] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:22:21,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:22:21,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-08 14:22:21,296 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:22:21,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1996179261] [2022-04-08 14:22:21,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1996179261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:22:21,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:22:21,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 14:22:21,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698226986] [2022-04-08 14:22:21,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:22:21,297 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:22:21,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:22:21,297 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:22:21,346 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:22:21,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 14:22:21,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:22:21,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 14:22:21,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 14:22:21,347 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:22:22,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:22:22,406 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-04-08 14:22:22,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 14:22:22,407 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:22:22,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:22:22,407 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:22:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-08 14:22:22,408 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:22:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-08 14:22:22,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions. [2022-04-08 14:22:22,472 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:22:22,473 INFO L225 Difference]: With dead ends: 100 [2022-04-08 14:22:22,473 INFO L226 Difference]: Without dead ends: 94 [2022-04-08 14:22:22,473 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:22:22,474 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 14:22:22,474 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 493 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 14:22:22,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-08 14:22:22,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-08 14:22:22,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:22:22,573 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:22:22,573 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:22:22,573 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:22:22,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:22:22,574 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-08 14:22:22,574 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-08 14:22:22,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:22:22,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:22:22,574 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:22:22,575 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:22:22,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:22:22,576 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-08 14:22:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-08 14:22:22,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:22:22,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:22:22,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:22:22,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:22:22,577 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:22:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-04-08 14:22:22,578 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 93 [2022-04-08 14:22:22,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:22:22,578 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-04-08 14:22:22,578 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:22:22,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 97 transitions. [2022-04-08 14:22:22,993 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:22:22,993 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-08 14:22:22,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-08 14:22:22,994 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:22:22,994 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:22:23,010 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:22:23,203 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:22:23,203 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:22:23,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:22:23,203 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 15 times [2022-04-08 14:22:23,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:22:23,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [192055748] [2022-04-08 14:22:23,280 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:22:23,281 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:22:23,281 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 16 times [2022-04-08 14:22:23,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:22:23,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295160133] [2022-04-08 14:22:23,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:22:23,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:22:23,291 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:22:23,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1461837014] [2022-04-08 14:22:23,291 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:22:23,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:22:23,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:22:23,292 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:22:23,293 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:22:23,345 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:22:23,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:22:23,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 14:22:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:22:23,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:22:23,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {12869#true} call ULTIMATE.init(); {12869#true} is VALID [2022-04-08 14:22:23,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {12869#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; {12877#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:23,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {12877#(<= ~counter~0 0)} assume true; {12877#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:23,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12877#(<= ~counter~0 0)} {12869#true} #61#return; {12877#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:23,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {12877#(<= ~counter~0 0)} call #t~ret6 := main(); {12877#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:23,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {12877#(<= ~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; {12877#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:23,770 INFO L272 TraceCheckUtils]: 6: Hoare triple {12877#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12877#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:23,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {12877#(<= ~counter~0 0)} ~cond := #in~cond; {12877#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:23,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {12877#(<= ~counter~0 0)} assume !(0 == ~cond); {12877#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:23,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {12877#(<= ~counter~0 0)} assume true; {12877#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:23,771 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12877#(<= ~counter~0 0)} {12877#(<= ~counter~0 0)} #53#return; {12877#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:23,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {12877#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12877#(<= ~counter~0 0)} is VALID [2022-04-08 14:22:23,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {12877#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12911#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:23,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {12911#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {12911#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:23,773 INFO L272 TraceCheckUtils]: 14: Hoare triple {12911#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12911#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:23,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {12911#(<= ~counter~0 1)} ~cond := #in~cond; {12911#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:23,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {12911#(<= ~counter~0 1)} assume !(0 == ~cond); {12911#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:23,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {12911#(<= ~counter~0 1)} assume true; {12911#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:23,774 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12911#(<= ~counter~0 1)} {12911#(<= ~counter~0 1)} #55#return; {12911#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:23,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {12911#(<= ~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 + ~x~0; {12911#(<= ~counter~0 1)} is VALID [2022-04-08 14:22:23,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {12911#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12936#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:23,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {12936#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {12936#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:23,775 INFO L272 TraceCheckUtils]: 22: Hoare triple {12936#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12936#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:23,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {12936#(<= ~counter~0 2)} ~cond := #in~cond; {12936#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:23,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {12936#(<= ~counter~0 2)} assume !(0 == ~cond); {12936#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:23,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {12936#(<= ~counter~0 2)} assume true; {12936#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:23,776 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12936#(<= ~counter~0 2)} {12936#(<= ~counter~0 2)} #55#return; {12936#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:23,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {12936#(<= ~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 + ~x~0; {12936#(<= ~counter~0 2)} is VALID [2022-04-08 14:22:23,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {12936#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12961#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:23,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {12961#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {12961#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:23,778 INFO L272 TraceCheckUtils]: 30: Hoare triple {12961#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12961#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:23,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {12961#(<= ~counter~0 3)} ~cond := #in~cond; {12961#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:23,778 INFO L290 TraceCheckUtils]: 32: Hoare triple {12961#(<= ~counter~0 3)} assume !(0 == ~cond); {12961#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:23,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {12961#(<= ~counter~0 3)} assume true; {12961#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:23,779 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12961#(<= ~counter~0 3)} {12961#(<= ~counter~0 3)} #55#return; {12961#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:23,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {12961#(<= ~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 + ~x~0; {12961#(<= ~counter~0 3)} is VALID [2022-04-08 14:22:23,780 INFO L290 TraceCheckUtils]: 36: Hoare triple {12961#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12986#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:23,780 INFO L290 TraceCheckUtils]: 37: Hoare triple {12986#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {12986#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:23,780 INFO L272 TraceCheckUtils]: 38: Hoare triple {12986#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12986#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:23,780 INFO L290 TraceCheckUtils]: 39: Hoare triple {12986#(<= ~counter~0 4)} ~cond := #in~cond; {12986#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:23,781 INFO L290 TraceCheckUtils]: 40: Hoare triple {12986#(<= ~counter~0 4)} assume !(0 == ~cond); {12986#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:23,781 INFO L290 TraceCheckUtils]: 41: Hoare triple {12986#(<= ~counter~0 4)} assume true; {12986#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:23,781 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12986#(<= ~counter~0 4)} {12986#(<= ~counter~0 4)} #55#return; {12986#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:23,782 INFO L290 TraceCheckUtils]: 43: Hoare triple {12986#(<= ~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 + ~x~0; {12986#(<= ~counter~0 4)} is VALID [2022-04-08 14:22:23,782 INFO L290 TraceCheckUtils]: 44: Hoare triple {12986#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13011#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:23,782 INFO L290 TraceCheckUtils]: 45: Hoare triple {13011#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {13011#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:23,783 INFO L272 TraceCheckUtils]: 46: Hoare triple {13011#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {13011#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:23,783 INFO L290 TraceCheckUtils]: 47: Hoare triple {13011#(<= ~counter~0 5)} ~cond := #in~cond; {13011#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:23,783 INFO L290 TraceCheckUtils]: 48: Hoare triple {13011#(<= ~counter~0 5)} assume !(0 == ~cond); {13011#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:23,784 INFO L290 TraceCheckUtils]: 49: Hoare triple {13011#(<= ~counter~0 5)} assume true; {13011#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:23,784 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13011#(<= ~counter~0 5)} {13011#(<= ~counter~0 5)} #55#return; {13011#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:23,784 INFO L290 TraceCheckUtils]: 51: Hoare triple {13011#(<= ~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 + ~x~0; {13011#(<= ~counter~0 5)} is VALID [2022-04-08 14:22:23,785 INFO L290 TraceCheckUtils]: 52: Hoare triple {13011#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13036#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:23,785 INFO L290 TraceCheckUtils]: 53: Hoare triple {13036#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {13036#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:23,785 INFO L272 TraceCheckUtils]: 54: Hoare triple {13036#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {13036#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:23,786 INFO L290 TraceCheckUtils]: 55: Hoare triple {13036#(<= ~counter~0 6)} ~cond := #in~cond; {13036#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:23,786 INFO L290 TraceCheckUtils]: 56: Hoare triple {13036#(<= ~counter~0 6)} assume !(0 == ~cond); {13036#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:23,786 INFO L290 TraceCheckUtils]: 57: Hoare triple {13036#(<= ~counter~0 6)} assume true; {13036#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:23,787 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13036#(<= ~counter~0 6)} {13036#(<= ~counter~0 6)} #55#return; {13036#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:23,787 INFO L290 TraceCheckUtils]: 59: Hoare triple {13036#(<= ~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 + ~x~0; {13036#(<= ~counter~0 6)} is VALID [2022-04-08 14:22:23,787 INFO L290 TraceCheckUtils]: 60: Hoare triple {13036#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13061#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:23,788 INFO L290 TraceCheckUtils]: 61: Hoare triple {13061#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {13061#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:23,788 INFO L272 TraceCheckUtils]: 62: Hoare triple {13061#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {13061#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:23,788 INFO L290 TraceCheckUtils]: 63: Hoare triple {13061#(<= ~counter~0 7)} ~cond := #in~cond; {13061#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:23,788 INFO L290 TraceCheckUtils]: 64: Hoare triple {13061#(<= ~counter~0 7)} assume !(0 == ~cond); {13061#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:23,789 INFO L290 TraceCheckUtils]: 65: Hoare triple {13061#(<= ~counter~0 7)} assume true; {13061#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:23,789 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13061#(<= ~counter~0 7)} {13061#(<= ~counter~0 7)} #55#return; {13061#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:23,789 INFO L290 TraceCheckUtils]: 67: Hoare triple {13061#(<= ~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 + ~x~0; {13061#(<= ~counter~0 7)} is VALID [2022-04-08 14:22:23,790 INFO L290 TraceCheckUtils]: 68: Hoare triple {13061#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13086#(<= ~counter~0 8)} is VALID [2022-04-08 14:22:23,790 INFO L290 TraceCheckUtils]: 69: Hoare triple {13086#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {13086#(<= ~counter~0 8)} is VALID [2022-04-08 14:22:23,790 INFO L272 TraceCheckUtils]: 70: Hoare triple {13086#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {13086#(<= ~counter~0 8)} is VALID [2022-04-08 14:22:23,791 INFO L290 TraceCheckUtils]: 71: Hoare triple {13086#(<= ~counter~0 8)} ~cond := #in~cond; {13086#(<= ~counter~0 8)} is VALID [2022-04-08 14:22:23,791 INFO L290 TraceCheckUtils]: 72: Hoare triple {13086#(<= ~counter~0 8)} assume !(0 == ~cond); {13086#(<= ~counter~0 8)} is VALID [2022-04-08 14:22:23,791 INFO L290 TraceCheckUtils]: 73: Hoare triple {13086#(<= ~counter~0 8)} assume true; {13086#(<= ~counter~0 8)} is VALID [2022-04-08 14:22:23,792 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13086#(<= ~counter~0 8)} {13086#(<= ~counter~0 8)} #55#return; {13086#(<= ~counter~0 8)} is VALID [2022-04-08 14:22:23,792 INFO L290 TraceCheckUtils]: 75: Hoare triple {13086#(<= ~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 + ~x~0; {13086#(<= ~counter~0 8)} is VALID [2022-04-08 14:22:23,792 INFO L290 TraceCheckUtils]: 76: Hoare triple {13086#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13111#(<= ~counter~0 9)} is VALID [2022-04-08 14:22:23,793 INFO L290 TraceCheckUtils]: 77: Hoare triple {13111#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {13111#(<= ~counter~0 9)} is VALID [2022-04-08 14:22:23,793 INFO L272 TraceCheckUtils]: 78: Hoare triple {13111#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {13111#(<= ~counter~0 9)} is VALID [2022-04-08 14:22:23,793 INFO L290 TraceCheckUtils]: 79: Hoare triple {13111#(<= ~counter~0 9)} ~cond := #in~cond; {13111#(<= ~counter~0 9)} is VALID [2022-04-08 14:22:23,794 INFO L290 TraceCheckUtils]: 80: Hoare triple {13111#(<= ~counter~0 9)} assume !(0 == ~cond); {13111#(<= ~counter~0 9)} is VALID [2022-04-08 14:22:23,794 INFO L290 TraceCheckUtils]: 81: Hoare triple {13111#(<= ~counter~0 9)} assume true; {13111#(<= ~counter~0 9)} is VALID [2022-04-08 14:22:23,794 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {13111#(<= ~counter~0 9)} {13111#(<= ~counter~0 9)} #55#return; {13111#(<= ~counter~0 9)} is VALID [2022-04-08 14:22:23,794 INFO L290 TraceCheckUtils]: 83: Hoare triple {13111#(<= ~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 + ~x~0; {13111#(<= ~counter~0 9)} is VALID [2022-04-08 14:22:23,795 INFO L290 TraceCheckUtils]: 84: Hoare triple {13111#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13136#(<= |main_#t~post5| 9)} is VALID [2022-04-08 14:22:23,795 INFO L290 TraceCheckUtils]: 85: Hoare triple {13136#(<= |main_#t~post5| 9)} assume !(#t~post5 < 20);havoc #t~post5; {12870#false} is VALID [2022-04-08 14:22:23,795 INFO L272 TraceCheckUtils]: 86: Hoare triple {12870#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12870#false} is VALID [2022-04-08 14:22:23,795 INFO L290 TraceCheckUtils]: 87: Hoare triple {12870#false} ~cond := #in~cond; {12870#false} is VALID [2022-04-08 14:22:23,795 INFO L290 TraceCheckUtils]: 88: Hoare triple {12870#false} assume !(0 == ~cond); {12870#false} is VALID [2022-04-08 14:22:23,795 INFO L290 TraceCheckUtils]: 89: Hoare triple {12870#false} assume true; {12870#false} is VALID [2022-04-08 14:22:23,796 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12870#false} {12870#false} #57#return; {12870#false} is VALID [2022-04-08 14:22:23,796 INFO L272 TraceCheckUtils]: 91: Hoare triple {12870#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12870#false} is VALID [2022-04-08 14:22:23,796 INFO L290 TraceCheckUtils]: 92: Hoare triple {12870#false} ~cond := #in~cond; {12870#false} is VALID [2022-04-08 14:22:23,796 INFO L290 TraceCheckUtils]: 93: Hoare triple {12870#false} assume 0 == ~cond; {12870#false} is VALID [2022-04-08 14:22:23,796 INFO L290 TraceCheckUtils]: 94: Hoare triple {12870#false} assume !false; {12870#false} is VALID [2022-04-08 14:22:23,796 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:22:23,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:22:24,289 INFO L290 TraceCheckUtils]: 94: Hoare triple {12870#false} assume !false; {12870#false} is VALID [2022-04-08 14:22:24,289 INFO L290 TraceCheckUtils]: 93: Hoare triple {12870#false} assume 0 == ~cond; {12870#false} is VALID [2022-04-08 14:22:24,289 INFO L290 TraceCheckUtils]: 92: Hoare triple {12870#false} ~cond := #in~cond; {12870#false} is VALID [2022-04-08 14:22:24,289 INFO L272 TraceCheckUtils]: 91: Hoare triple {12870#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12870#false} is VALID [2022-04-08 14:22:24,289 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12869#true} {12870#false} #57#return; {12870#false} is VALID [2022-04-08 14:22:24,289 INFO L290 TraceCheckUtils]: 89: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-08 14:22:24,289 INFO L290 TraceCheckUtils]: 88: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-08 14:22:24,289 INFO L290 TraceCheckUtils]: 87: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-08 14:22:24,289 INFO L272 TraceCheckUtils]: 86: Hoare triple {12870#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-08 14:22:24,290 INFO L290 TraceCheckUtils]: 85: Hoare triple {13194#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {12870#false} is VALID [2022-04-08 14:22:24,290 INFO L290 TraceCheckUtils]: 84: Hoare triple {13198#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13194#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:22:24,290 INFO L290 TraceCheckUtils]: 83: Hoare triple {13198#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13198#(< ~counter~0 20)} is VALID [2022-04-08 14:22:24,291 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12869#true} {13198#(< ~counter~0 20)} #55#return; {13198#(< ~counter~0 20)} is VALID [2022-04-08 14:22:24,291 INFO L290 TraceCheckUtils]: 81: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-08 14:22:24,291 INFO L290 TraceCheckUtils]: 80: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-08 14:22:24,291 INFO L290 TraceCheckUtils]: 79: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-08 14:22:24,291 INFO L272 TraceCheckUtils]: 78: Hoare triple {13198#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-08 14:22:24,291 INFO L290 TraceCheckUtils]: 77: Hoare triple {13198#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {13198#(< ~counter~0 20)} is VALID [2022-04-08 14:22:24,292 INFO L290 TraceCheckUtils]: 76: Hoare triple {13223#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13198#(< ~counter~0 20)} is VALID [2022-04-08 14:22:24,292 INFO L290 TraceCheckUtils]: 75: Hoare triple {13223#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13223#(< ~counter~0 19)} is VALID [2022-04-08 14:22:24,292 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12869#true} {13223#(< ~counter~0 19)} #55#return; {13223#(< ~counter~0 19)} is VALID [2022-04-08 14:22:24,293 INFO L290 TraceCheckUtils]: 73: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-08 14:22:24,293 INFO L290 TraceCheckUtils]: 72: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-08 14:22:24,293 INFO L290 TraceCheckUtils]: 71: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-08 14:22:24,293 INFO L272 TraceCheckUtils]: 70: Hoare triple {13223#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-08 14:22:24,296 INFO L290 TraceCheckUtils]: 69: Hoare triple {13223#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {13223#(< ~counter~0 19)} is VALID [2022-04-08 14:22:24,296 INFO L290 TraceCheckUtils]: 68: Hoare triple {13248#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13223#(< ~counter~0 19)} is VALID [2022-04-08 14:22:24,296 INFO L290 TraceCheckUtils]: 67: Hoare triple {13248#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13248#(< ~counter~0 18)} is VALID [2022-04-08 14:22:24,297 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12869#true} {13248#(< ~counter~0 18)} #55#return; {13248#(< ~counter~0 18)} is VALID [2022-04-08 14:22:24,297 INFO L290 TraceCheckUtils]: 65: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-08 14:22:24,297 INFO L290 TraceCheckUtils]: 64: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-08 14:22:24,297 INFO L290 TraceCheckUtils]: 63: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-08 14:22:24,297 INFO L272 TraceCheckUtils]: 62: Hoare triple {13248#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-08 14:22:24,304 INFO L290 TraceCheckUtils]: 61: Hoare triple {13248#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {13248#(< ~counter~0 18)} is VALID [2022-04-08 14:22:24,304 INFO L290 TraceCheckUtils]: 60: Hoare triple {13273#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13248#(< ~counter~0 18)} is VALID [2022-04-08 14:22:24,305 INFO L290 TraceCheckUtils]: 59: Hoare triple {13273#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13273#(< ~counter~0 17)} is VALID [2022-04-08 14:22:24,305 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12869#true} {13273#(< ~counter~0 17)} #55#return; {13273#(< ~counter~0 17)} is VALID [2022-04-08 14:22:24,305 INFO L290 TraceCheckUtils]: 57: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-08 14:22:24,305 INFO L290 TraceCheckUtils]: 56: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-08 14:22:24,305 INFO L290 TraceCheckUtils]: 55: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-08 14:22:24,305 INFO L272 TraceCheckUtils]: 54: Hoare triple {13273#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-08 14:22:24,305 INFO L290 TraceCheckUtils]: 53: Hoare triple {13273#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {13273#(< ~counter~0 17)} is VALID [2022-04-08 14:22:24,306 INFO L290 TraceCheckUtils]: 52: Hoare triple {13298#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13273#(< ~counter~0 17)} is VALID [2022-04-08 14:22:24,306 INFO L290 TraceCheckUtils]: 51: Hoare triple {13298#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13298#(< ~counter~0 16)} is VALID [2022-04-08 14:22:24,307 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12869#true} {13298#(< ~counter~0 16)} #55#return; {13298#(< ~counter~0 16)} is VALID [2022-04-08 14:22:24,307 INFO L290 TraceCheckUtils]: 49: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-08 14:22:24,307 INFO L290 TraceCheckUtils]: 48: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-08 14:22:24,307 INFO L290 TraceCheckUtils]: 47: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-08 14:22:24,307 INFO L272 TraceCheckUtils]: 46: Hoare triple {13298#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-08 14:22:24,307 INFO L290 TraceCheckUtils]: 45: Hoare triple {13298#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {13298#(< ~counter~0 16)} is VALID [2022-04-08 14:22:24,308 INFO L290 TraceCheckUtils]: 44: Hoare triple {13323#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13298#(< ~counter~0 16)} is VALID [2022-04-08 14:22:24,308 INFO L290 TraceCheckUtils]: 43: Hoare triple {13323#(< ~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 + ~x~0; {13323#(< ~counter~0 15)} is VALID [2022-04-08 14:22:24,308 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12869#true} {13323#(< ~counter~0 15)} #55#return; {13323#(< ~counter~0 15)} is VALID [2022-04-08 14:22:24,308 INFO L290 TraceCheckUtils]: 41: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-08 14:22:24,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-08 14:22:24,309 INFO L290 TraceCheckUtils]: 39: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-08 14:22:24,309 INFO L272 TraceCheckUtils]: 38: Hoare triple {13323#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-08 14:22:24,309 INFO L290 TraceCheckUtils]: 37: Hoare triple {13323#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {13323#(< ~counter~0 15)} is VALID [2022-04-08 14:22:24,309 INFO L290 TraceCheckUtils]: 36: Hoare triple {13348#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13323#(< ~counter~0 15)} is VALID [2022-04-08 14:22:24,310 INFO L290 TraceCheckUtils]: 35: Hoare triple {13348#(< ~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 + ~x~0; {13348#(< ~counter~0 14)} is VALID [2022-04-08 14:22:24,310 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12869#true} {13348#(< ~counter~0 14)} #55#return; {13348#(< ~counter~0 14)} is VALID [2022-04-08 14:22:24,310 INFO L290 TraceCheckUtils]: 33: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-08 14:22:24,310 INFO L290 TraceCheckUtils]: 32: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-08 14:22:24,310 INFO L290 TraceCheckUtils]: 31: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-08 14:22:24,310 INFO L272 TraceCheckUtils]: 30: Hoare triple {13348#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-08 14:22:24,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {13348#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {13348#(< ~counter~0 14)} is VALID [2022-04-08 14:22:24,311 INFO L290 TraceCheckUtils]: 28: Hoare triple {13373#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13348#(< ~counter~0 14)} is VALID [2022-04-08 14:22:24,311 INFO L290 TraceCheckUtils]: 27: Hoare triple {13373#(< ~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 + ~x~0; {13373#(< ~counter~0 13)} is VALID [2022-04-08 14:22:24,312 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12869#true} {13373#(< ~counter~0 13)} #55#return; {13373#(< ~counter~0 13)} is VALID [2022-04-08 14:22:24,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-08 14:22:24,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-08 14:22:24,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-08 14:22:24,312 INFO L272 TraceCheckUtils]: 22: Hoare triple {13373#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-08 14:22:24,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {13373#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {13373#(< ~counter~0 13)} is VALID [2022-04-08 14:22:24,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {13398#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13373#(< ~counter~0 13)} is VALID [2022-04-08 14:22:24,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {13398#(< ~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 + ~x~0; {13398#(< ~counter~0 12)} is VALID [2022-04-08 14:22:24,313 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12869#true} {13398#(< ~counter~0 12)} #55#return; {13398#(< ~counter~0 12)} is VALID [2022-04-08 14:22:24,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-08 14:22:24,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-08 14:22:24,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-08 14:22:24,314 INFO L272 TraceCheckUtils]: 14: Hoare triple {13398#(< ~counter~0 12)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-08 14:22:24,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {13398#(< ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {13398#(< ~counter~0 12)} is VALID [2022-04-08 14:22:24,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {13423#(< ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13398#(< ~counter~0 12)} is VALID [2022-04-08 14:22:24,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {13423#(< ~counter~0 11)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {13423#(< ~counter~0 11)} is VALID [2022-04-08 14:22:24,315 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12869#true} {13423#(< ~counter~0 11)} #53#return; {13423#(< ~counter~0 11)} is VALID [2022-04-08 14:22:24,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-08 14:22:24,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-08 14:22:24,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-08 14:22:24,315 INFO L272 TraceCheckUtils]: 6: Hoare triple {13423#(< ~counter~0 11)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12869#true} is VALID [2022-04-08 14:22:24,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {13423#(< ~counter~0 11)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {13423#(< ~counter~0 11)} is VALID [2022-04-08 14:22:24,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {13423#(< ~counter~0 11)} call #t~ret6 := main(); {13423#(< ~counter~0 11)} is VALID [2022-04-08 14:22:24,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13423#(< ~counter~0 11)} {12869#true} #61#return; {13423#(< ~counter~0 11)} is VALID [2022-04-08 14:22:24,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {13423#(< ~counter~0 11)} assume true; {13423#(< ~counter~0 11)} is VALID [2022-04-08 14:22:24,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {12869#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; {13423#(< ~counter~0 11)} is VALID [2022-04-08 14:22:24,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {12869#true} call ULTIMATE.init(); {12869#true} is VALID [2022-04-08 14:22:24,317 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:22:24,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:22:24,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295160133] [2022-04-08 14:22:24,317 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:22:24,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461837014] [2022-04-08 14:22:24,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461837014] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:22:24,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:22:24,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-08 14:22:24,318 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:22:24,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [192055748] [2022-04-08 14:22:24,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [192055748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:22:24,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:22:24,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 14:22:24,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402334479] [2022-04-08 14:22:24,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:22:24,318 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:22:24,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:22:24,319 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:22:24,391 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:22:24,391 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 14:22:24,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:22:24,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 14:22:24,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:22:24,392 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:22:24,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:22:24,777 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2022-04-08 14:22:24,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 14:22:24,777 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:22:24,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:22:24,778 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:22:24,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-08 14:22:24,779 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:22:24,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-08 14:22:24,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 110 transitions. [2022-04-08 14:22:24,863 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:22:24,864 INFO L225 Difference]: With dead ends: 110 [2022-04-08 14:22:24,864 INFO L226 Difference]: Without dead ends: 100 [2022-04-08 14:22:24,865 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:22:24,865 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:22:24,865 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 135 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:22:24,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-08 14:22:24,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-08 14:22:24,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:22:24,986 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:22:24,986 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:22:24,986 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:22:24,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:22:24,987 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-08 14:22:24,987 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-08 14:22:24,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:22:24,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:22:24,988 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:22:24,988 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:22:24,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:22:24,989 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-08 14:22:24,989 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-08 14:22:24,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:22:24,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:22:24,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:22:24,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:22:24,990 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:22:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-04-08 14:22:24,991 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 95 [2022-04-08 14:22:24,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:22:24,991 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-04-08 14:22:24,991 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:22:24,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 102 transitions. [2022-04-08 14:22:25,564 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:22:25,564 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-08 14:22:25,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-08 14:22:25,565 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:22:25,565 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:22:25,581 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:22:25,765 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:22:25,765 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:22:25,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:22:25,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 17 times [2022-04-08 14:22:25,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:22:25,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [211518440] [2022-04-08 14:22:25,851 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:22:25,851 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:22:25,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 18 times [2022-04-08 14:22:25,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:22:25,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077739738] [2022-04-08 14:22:25,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:22:25,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:22:25,864 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:22:25,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [887374213] [2022-04-08 14:22:25,864 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:22:25,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:22:25,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:22:25,865 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:22:25,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process