/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 07:44:59,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 07:44:59,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 07:45:00,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 07:45:00,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 07:45:00,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 07:45:00,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 07:45:00,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 07:45:00,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 07:45:00,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 07:45:00,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 07:45:00,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 07:45:00,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 07:45:00,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 07:45:00,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 07:45:00,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 07:45:00,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 07:45:00,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 07:45:00,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 07:45:00,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 07:45:00,024 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 07:45:00,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 07:45:00,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 07:45:00,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 07:45:00,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 07:45:00,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 07:45:00,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 07:45:00,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 07:45:00,031 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 07:45:00,032 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 07:45:00,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 07:45:00,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 07:45:00,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 07:45:00,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 07:45:00,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 07:45:00,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 07:45:00,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 07:45:00,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 07:45:00,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 07:45:00,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 07:45:00,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 07:45:00,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 07:45:00,038 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 07:45:00,045 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 07:45:00,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 07:45:00,046 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 07:45:00,046 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 07:45:00,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 07:45:00,047 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 07:45:00,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 07:45:00,047 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 07:45:00,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 07:45:00,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 07:45:00,047 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 07:45:00,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 07:45:00,047 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 07:45:00,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 07:45:00,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 07:45:00,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 07:45:00,048 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 07:45:00,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 07:45:00,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:45:00,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 07:45:00,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 07:45:00,049 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 07:45:00,049 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 07:45:00,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 07:45:00,049 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 07:45:00,049 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 07:45:00,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 07:45:00,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 07:45:00,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 07:45:00,285 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 07:45:00,286 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 07:45:00,287 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound20.c [2022-04-08 07:45:00,334 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785f1ee8b/44a12447e91246c2a321d929f68129c3/FLAGf99916233 [2022-04-08 07:45:00,710 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 07:45:00,710 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound20.c [2022-04-08 07:45:00,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785f1ee8b/44a12447e91246c2a321d929f68129c3/FLAGf99916233 [2022-04-08 07:45:01,118 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785f1ee8b/44a12447e91246c2a321d929f68129c3 [2022-04-08 07:45:01,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 07:45:01,121 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 07:45:01,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 07:45:01,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 07:45:01,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 07:45:01,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:45:01" (1/1) ... [2022-04-08 07:45:01,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53568b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:01, skipping insertion in model container [2022-04-08 07:45:01,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:45:01" (1/1) ... [2022-04-08 07:45:01,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 07:45:01,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 07:45:01,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound20.c[458,471] [2022-04-08 07:45:01,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:45:01,310 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 07:45:01,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound20.c[458,471] [2022-04-08 07:45:01,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:45:01,336 INFO L208 MainTranslator]: Completed translation [2022-04-08 07:45:01,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:01 WrapperNode [2022-04-08 07:45:01,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 07:45:01,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 07:45:01,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 07:45:01,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 07:45:01,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:01" (1/1) ... [2022-04-08 07:45:01,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:01" (1/1) ... [2022-04-08 07:45:01,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:01" (1/1) ... [2022-04-08 07:45:01,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:01" (1/1) ... [2022-04-08 07:45:01,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:01" (1/1) ... [2022-04-08 07:45:01,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:01" (1/1) ... [2022-04-08 07:45:01,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:01" (1/1) ... [2022-04-08 07:45:01,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 07:45:01,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 07:45:01,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 07:45:01,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 07:45:01,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:01" (1/1) ... [2022-04-08 07:45:01,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:45:01,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:01,400 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 07:45:01,417 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 07:45:01,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 07:45:01,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 07:45:01,447 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 07:45:01,447 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 07:45:01,448 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 07:45:01,448 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 07:45:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 07:45:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 07:45:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 07:45:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 07:45:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 07:45:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 07:45:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 07:45:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 07:45:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 07:45:01,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 07:45:01,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 07:45:01,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 07:45:01,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 07:45:01,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 07:45:01,508 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 07:45:01,509 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 07:45:01,607 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 07:45:01,613 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 07:45:01,613 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 07:45:01,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:45:01 BoogieIcfgContainer [2022-04-08 07:45:01,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 07:45:01,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 07:45:01,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 07:45:01,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 07:45:01,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 07:45:01" (1/3) ... [2022-04-08 07:45:01,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a54465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:45:01, skipping insertion in model container [2022-04-08 07:45:01,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:01" (2/3) ... [2022-04-08 07:45:01,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a54465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:45:01, skipping insertion in model container [2022-04-08 07:45:01,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:45:01" (3/3) ... [2022-04-08 07:45:01,625 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound20.c [2022-04-08 07:45:01,629 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 07:45:01,629 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 07:45:01,664 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 07:45:01,670 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 07:45:01,670 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 07:45:01,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:45:01,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 07:45:01,697 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:01,697 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 07:45:01,698 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:01,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:01,704 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-08 07:45:01,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:01,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2019741547] [2022-04-08 07:45:01,738 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:45:01,738 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 2 times [2022-04-08 07:45:01,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:01,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250505080] [2022-04-08 07:45:01,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:01,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:01,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 07:45:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:01,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-08 07:45:01,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 07:45:01,918 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-08 07:45:01,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 07:45:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:01,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-08 07:45:01,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-08 07:45:01,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-08 07:45:01,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-08 07:45:01,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 07:45:01,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-08 07:45:01,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 07:45:01,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-08 07:45:01,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-08 07:45:01,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {31#true} is VALID [2022-04-08 07:45:01,931 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {31#true} is VALID [2022-04-08 07:45:01,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-08 07:45:01,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-08 07:45:01,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-08 07:45:01,933 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-08 07:45:01,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {32#false} is VALID [2022-04-08 07:45:01,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-08 07:45:01,933 INFO L272 TraceCheckUtils]: 13: Hoare triple {32#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {32#false} is VALID [2022-04-08 07:45:01,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-08 07:45:01,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-08 07:45:01,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-08 07:45:01,934 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 07:45:01,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:01,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250505080] [2022-04-08 07:45:01,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250505080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:01,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:01,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:45:01,938 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:01,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2019741547] [2022-04-08 07:45:01,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2019741547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:01,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:01,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:45:01,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122458957] [2022-04-08 07:45:01,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:01,944 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 07:45:01,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:01,948 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 07:45:01,968 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 07:45:01,969 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 07:45:01,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:01,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 07:45:01,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 07:45:01,989 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:45:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:02,121 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-08 07:45:02,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 07:45:02,122 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 07:45:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:02,123 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 07:45:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-08 07:45:02,141 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 07:45:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-08 07:45:02,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-08 07:45:02,248 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 07:45:02,255 INFO L225 Difference]: With dead ends: 47 [2022-04-08 07:45:02,255 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 07:45:02,257 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 07:45:02,264 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:02,265 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:45:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 07:45:02,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 07:45:02,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:02,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:45:02,306 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:45:02,306 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:45:02,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:02,310 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-08 07:45:02,310 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 07:45:02,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:02,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:02,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-08 07:45:02,312 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-08 07:45:02,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:02,314 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-08 07:45:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 07:45:02,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:02,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:02,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:02,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:45:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-08 07:45:02,318 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-08 07:45:02,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:02,319 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-08 07:45:02,319 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 07:45:02,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-08 07:45:02,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:02,365 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 07:45:02,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 07:45:02,366 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:02,366 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 07:45:02,366 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 07:45:02,366 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:02,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:02,368 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-08 07:45:02,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:02,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [173797563] [2022-04-08 07:45:02,374 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:45:02,374 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 2 times [2022-04-08 07:45:02,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:02,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616474422] [2022-04-08 07:45:02,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:02,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:02,408 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:02,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [520291085] [2022-04-08 07:45:02,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:45:02,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:02,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:02,419 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 07:45:02,457 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 07:45:02,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 07:45:02,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:02,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 07:45:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:02,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:02,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {229#true} is VALID [2022-04-08 07:45:02,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {229#true} is VALID [2022-04-08 07:45:02,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-08 07:45:02,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} #60#return; {229#true} is VALID [2022-04-08 07:45:02,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#true} call #t~ret5 := main(); {229#true} is VALID [2022-04-08 07:45:02,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {229#true} is VALID [2022-04-08 07:45:02,615 INFO L272 TraceCheckUtils]: 6: Hoare triple {229#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {229#true} is VALID [2022-04-08 07:45:02,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#true} ~cond := #in~cond; {229#true} is VALID [2022-04-08 07:45:02,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#true} assume !(0 == ~cond); {229#true} is VALID [2022-04-08 07:45:02,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-08 07:45:02,615 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {229#true} {229#true} #52#return; {229#true} is VALID [2022-04-08 07:45:02,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:02,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:02,618 INFO L272 TraceCheckUtils]: 13: Hoare triple {267#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {274#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:02,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {274#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {278#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:02,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {278#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {230#false} is VALID [2022-04-08 07:45:02,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-04-08 07:45:02,619 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 07:45:02,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:45:02,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:02,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616474422] [2022-04-08 07:45:02,620 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:02,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520291085] [2022-04-08 07:45:02,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520291085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:02,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:02,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:45:02,622 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:02,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [173797563] [2022-04-08 07:45:02,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [173797563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:02,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:02,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:45:02,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423043595] [2022-04-08 07:45:02,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:02,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 07:45:02,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:02,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:45:02,638 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 07:45:02,639 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:45:02,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:02,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:45:02,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 07:45:02,641 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:45:02,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:02,783 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 07:45:02,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:45:02,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 07:45:02,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:02,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:45:02,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-08 07:45:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:45:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-08 07:45:02,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-08 07:45:02,836 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 07:45:02,838 INFO L225 Difference]: With dead ends: 34 [2022-04-08 07:45:02,838 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 07:45:02,839 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 07:45:02,840 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:02,841 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:45:02,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 07:45:02,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 07:45:02,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:02,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:45:02,852 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:45:02,852 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:45:02,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:02,854 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-08 07:45:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-08 07:45:02,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:02,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:02,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-08 07:45:02,856 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-08 07:45:02,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:02,858 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-08 07:45:02,858 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-08 07:45:02,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:02,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:02,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:02,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:45:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-08 07:45:02,861 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-08 07:45:02,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:02,861 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-08 07:45:02,861 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:45:02,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-08 07:45:02,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-08 07:45:02,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 07:45:02,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:02,897 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:02,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 07:45:03,118 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 07:45:03,118 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:03,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:03,119 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-08 07:45:03,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:03,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1497763032] [2022-04-08 07:45:03,313 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:03,313 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:03,314 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:03,314 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 2 times [2022-04-08 07:45:03,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:03,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201428868] [2022-04-08 07:45:03,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:03,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:03,333 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:03,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2064178224] [2022-04-08 07:45:03,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:45:03,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:03,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:03,335 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 07:45:03,336 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 07:45:03,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:45:03,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:03,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 07:45:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:03,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:03,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-08 07:45:03,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {474#true} is VALID [2022-04-08 07:45:03,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:45:03,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-08 07:45:03,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-08 07:45:03,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {474#true} is VALID [2022-04-08 07:45:03,545 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {474#true} is VALID [2022-04-08 07:45:03,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 07:45:03,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 07:45:03,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:45:03,551 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-08 07:45:03,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:03,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:03,552 INFO L272 TraceCheckUtils]: 13: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {474#true} is VALID [2022-04-08 07:45:03,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 07:45:03,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 07:45:03,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:45:03,553 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {512#(and (= main_~x~0 0) (= main_~y~0 0))} #54#return; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:03,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-08 07:45:03,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !false; {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-08 07:45:03,555 INFO L272 TraceCheckUtils]: 20: Hoare triple {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:03,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:03,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-08 07:45:03,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-08 07:45:03,557 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 07:45:03,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:03,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-08 07:45:03,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-08 07:45:03,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:03,815 INFO L272 TraceCheckUtils]: 20: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:03,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 07:45:03,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 07:45:03,826 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #54#return; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 07:45:03,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:45:03,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 07:45:03,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 07:45:03,827 INFO L272 TraceCheckUtils]: 13: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {474#true} is VALID [2022-04-08 07:45:03,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 07:45:03,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 07:45:03,832 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-08 07:45:03,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:45:03,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 07:45:03,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 07:45:03,833 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {474#true} is VALID [2022-04-08 07:45:03,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {474#true} is VALID [2022-04-08 07:45:03,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-08 07:45:03,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-08 07:45:03,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:45:03,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {474#true} is VALID [2022-04-08 07:45:03,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-08 07:45:03,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 07:45:03,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:03,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201428868] [2022-04-08 07:45:03,835 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:03,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064178224] [2022-04-08 07:45:03,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064178224] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:03,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:03,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 07:45:03,836 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:03,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1497763032] [2022-04-08 07:45:03,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1497763032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:03,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:03,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:45:03,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099813798] [2022-04-08 07:45:03,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:03,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-08 07:45:03,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:03,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:45:03,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:03,866 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:45:03,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:03,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:45:03,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 07:45:03,867 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:45:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:03,999 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-08 07:45:03,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:45:03,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-08 07:45:03,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:04,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:45:04,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-08 07:45:04,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:45:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-08 07:45:04,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-08 07:45:04,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:04,038 INFO L225 Difference]: With dead ends: 36 [2022-04-08 07:45:04,038 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 07:45:04,038 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 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 07:45:04,039 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:04,040 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:45:04,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 07:45:04,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 07:45:04,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:04,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:45:04,054 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:45:04,054 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:45:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:04,056 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 07:45:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 07:45:04,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:04,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:04,057 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-08 07:45:04,057 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-08 07:45:04,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:04,059 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 07:45:04,059 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 07:45:04,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:04,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:04,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:04,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:04,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:45:04,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-08 07:45:04,061 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2022-04-08 07:45:04,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:04,061 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-08 07:45:04,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:45:04,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-08 07:45:04,104 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 07:45:04,105 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 07:45:04,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 07:45:04,105 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:04,105 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:04,122 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 07:45:04,311 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 07:45:04,312 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:04,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:04,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 1 times [2022-04-08 07:45:04,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:04,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1734867336] [2022-04-08 07:45:04,441 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:04,441 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:04,441 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:04,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 2 times [2022-04-08 07:45:04,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:04,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322148321] [2022-04-08 07:45:04,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:04,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:04,455 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:04,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [946467348] [2022-04-08 07:45:04,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:45:04,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:04,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:04,457 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 07:45:04,479 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 07:45:04,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:45:04,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:04,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 07:45:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:04,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:04,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {822#true} is VALID [2022-04-08 07:45:04,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {822#true} is VALID [2022-04-08 07:45:04,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-08 07:45:04,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #60#return; {822#true} is VALID [2022-04-08 07:45:04,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret5 := main(); {822#true} is VALID [2022-04-08 07:45:04,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {822#true} is VALID [2022-04-08 07:45:04,797 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {822#true} is VALID [2022-04-08 07:45:04,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-08 07:45:04,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-08 07:45:04,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-08 07:45:04,798 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #52#return; {822#true} is VALID [2022-04-08 07:45:04,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:04,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:04,799 INFO L272 TraceCheckUtils]: 13: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {822#true} is VALID [2022-04-08 07:45:04,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-08 07:45:04,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-08 07:45:04,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-08 07:45:04,801 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {822#true} {860#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:04,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:45:04,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:45:04,802 INFO L272 TraceCheckUtils]: 20: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {822#true} is VALID [2022-04-08 07:45:04,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-08 07:45:04,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-08 07:45:04,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-08 07:45:04,804 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {822#true} {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #54#return; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:45:04,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {904#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:04,805 INFO L272 TraceCheckUtils]: 26: Hoare triple {904#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:04,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:04,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {823#false} is VALID [2022-04-08 07:45:04,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-08 07:45:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 07:45:04,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:05,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:05,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322148321] [2022-04-08 07:45:05,342 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:05,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946467348] [2022-04-08 07:45:05,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946467348] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:05,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:05,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 07:45:05,342 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:05,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1734867336] [2022-04-08 07:45:05,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1734867336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:05,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:05,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 07:45:05,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189338954] [2022-04-08 07:45:05,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:05,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-08 07:45:05,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:05,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 07:45:05,367 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 07:45:05,367 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 07:45:05,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:05,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 07:45:05,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 07:45:05,369 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 07:45:05,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:05,576 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-08 07:45:05,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 07:45:05,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-08 07:45:05,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:05,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 07:45:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-08 07:45:05,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 07:45:05,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-08 07:45:05,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-08 07:45:05,609 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 07:45:05,610 INFO L225 Difference]: With dead ends: 39 [2022-04-08 07:45:05,610 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 07:45:05,611 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:45:05,612 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:05,612 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:45:05,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 07:45:05,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 07:45:05,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:05,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:45:05,630 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:45:05,631 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:45:05,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:05,633 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-08 07:45:05,633 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-08 07:45:05,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:05,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:05,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-08 07:45:05,634 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-08 07:45:05,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:05,636 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-08 07:45:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-08 07:45:05,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:05,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:05,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:05,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:05,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:45:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-08 07:45:05,638 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2022-04-08 07:45:05,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:05,638 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-08 07:45:05,638 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 07:45:05,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 35 transitions. [2022-04-08 07:45:05,695 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 07:45:05,696 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-08 07:45:05,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 07:45:05,697 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:05,697 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:05,722 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 07:45:05,897 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 07:45:05,897 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:05,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:05,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 3 times [2022-04-08 07:45:05,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:05,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [341001186] [2022-04-08 07:45:06,010 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:06,010 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:06,010 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:06,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 4 times [2022-04-08 07:45:06,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:06,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074632384] [2022-04-08 07:45:06,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:06,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:06,022 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:06,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1064774755] [2022-04-08 07:45:06,023 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:45:06,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:06,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:06,030 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 07:45:06,031 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 07:45:06,068 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:45:06,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:06,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 07:45:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:06,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:06,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {1178#true} call ULTIMATE.init(); {1178#true} is VALID [2022-04-08 07:45:06,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {1178#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1178#true} is VALID [2022-04-08 07:45:06,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 07:45:06,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1178#true} {1178#true} #60#return; {1178#true} is VALID [2022-04-08 07:45:06,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {1178#true} call #t~ret5 := main(); {1178#true} is VALID [2022-04-08 07:45:06,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {1178#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1178#true} is VALID [2022-04-08 07:45:06,389 INFO L272 TraceCheckUtils]: 6: Hoare triple {1178#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {1178#true} is VALID [2022-04-08 07:45:06,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-08 07:45:06,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-08 07:45:06,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 07:45:06,390 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1178#true} {1178#true} #52#return; {1178#true} is VALID [2022-04-08 07:45:06,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:06,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:06,393 INFO L272 TraceCheckUtils]: 13: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1178#true} is VALID [2022-04-08 07:45:06,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-08 07:45:06,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-08 07:45:06,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 07:45:06,394 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1178#true} {1216#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:06,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:45:06,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:45:06,395 INFO L272 TraceCheckUtils]: 20: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1178#true} is VALID [2022-04-08 07:45:06,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-08 07:45:06,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-08 07:45:06,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 07:45:06,396 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1178#true} {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:45:06,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-08 07:45:06,397 INFO L290 TraceCheckUtils]: 26: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !false; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-08 07:45:06,397 INFO L272 TraceCheckUtils]: 27: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1178#true} is VALID [2022-04-08 07:45:06,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-08 07:45:06,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-08 07:45:06,398 INFO L290 TraceCheckUtils]: 30: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 07:45:06,398 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1178#true} {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #54#return; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-08 07:45:06,399 INFO L290 TraceCheckUtils]: 32: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1282#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-08 07:45:06,400 INFO L272 TraceCheckUtils]: 33: Hoare triple {1282#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1286#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:06,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {1286#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1290#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:06,401 INFO L290 TraceCheckUtils]: 35: Hoare triple {1290#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1179#false} is VALID [2022-04-08 07:45:06,401 INFO L290 TraceCheckUtils]: 36: Hoare triple {1179#false} assume !false; {1179#false} is VALID [2022-04-08 07:45:06,401 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 07:45:06,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:06,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:06,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074632384] [2022-04-08 07:45:06,725 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:06,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064774755] [2022-04-08 07:45:06,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064774755] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:06,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:06,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 07:45:06,725 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:06,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [341001186] [2022-04-08 07:45:06,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [341001186] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:06,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:06,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 07:45:06,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656362868] [2022-04-08 07:45:06,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:06,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-08 07:45:06,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:06,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:45:06,755 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 07:45:06,756 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 07:45:06,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:06,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 07:45:06,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 07:45:06,757 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:45:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:07,011 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-08 07:45:07,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 07:45:07,011 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-08 07:45:07,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:07,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:45:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-08 07:45:07,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:45:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-08 07:45:07,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-08 07:45:07,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:07,049 INFO L225 Difference]: With dead ends: 42 [2022-04-08 07:45:07,049 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 07:45:07,050 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-08 07:45:07,050 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:07,051 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 143 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:45:07,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 07:45:07,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-08 07:45:07,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:07,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:45:07,072 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:45:07,072 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:45:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:07,074 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-08 07:45:07,074 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-08 07:45:07,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:07,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:07,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-08 07:45:07,075 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-08 07:45:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:07,077 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-08 07:45:07,077 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-08 07:45:07,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:07,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:07,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:07,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:45:07,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-08 07:45:07,079 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 37 [2022-04-08 07:45:07,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:07,079 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-08 07:45:07,080 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:45:07,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2022-04-08 07:45:07,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:07,129 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-08 07:45:07,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 07:45:07,129 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:07,129 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:07,146 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 07:45:07,331 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 07:45:07,331 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:07,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:07,332 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 5 times [2022-04-08 07:45:07,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:07,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1677995919] [2022-04-08 07:45:07,445 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:07,445 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:07,445 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:07,445 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 6 times [2022-04-08 07:45:07,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:07,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943550410] [2022-04-08 07:45:07,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:07,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:07,471 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:07,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2112844270] [2022-04-08 07:45:07,471 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:45:07,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:07,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:07,473 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 07:45:07,473 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 07:45:07,573 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 07:45:07,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:07,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 07:45:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:07,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:07,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {1574#true} call ULTIMATE.init(); {1574#true} is VALID [2022-04-08 07:45:07,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1574#true} is VALID [2022-04-08 07:45:07,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-08 07:45:07,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1574#true} {1574#true} #60#return; {1574#true} is VALID [2022-04-08 07:45:07,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {1574#true} call #t~ret5 := main(); {1574#true} is VALID [2022-04-08 07:45:07,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {1574#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1574#true} is VALID [2022-04-08 07:45:07,888 INFO L272 TraceCheckUtils]: 6: Hoare triple {1574#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {1574#true} is VALID [2022-04-08 07:45:07,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-08 07:45:07,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-08 07:45:07,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-08 07:45:07,888 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1574#true} {1574#true} #52#return; {1574#true} is VALID [2022-04-08 07:45:07,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {1574#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:07,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {1612#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:07,889 INFO L272 TraceCheckUtils]: 13: Hoare triple {1612#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1574#true} is VALID [2022-04-08 07:45:07,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-08 07:45:07,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-08 07:45:07,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-08 07:45:07,891 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1574#true} {1612#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:07,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {1612#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:07,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:07,892 INFO L272 TraceCheckUtils]: 20: Hoare triple {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1574#true} is VALID [2022-04-08 07:45:07,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-08 07:45:07,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-08 07:45:07,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-08 07:45:07,893 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1574#true} {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:07,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:07,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:07,894 INFO L272 TraceCheckUtils]: 27: Hoare triple {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1574#true} is VALID [2022-04-08 07:45:07,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-08 07:45:07,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-08 07:45:07,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-08 07:45:07,895 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1574#true} {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:07,895 INFO L290 TraceCheckUtils]: 32: Hoare triple {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:45:07,896 INFO L290 TraceCheckUtils]: 33: Hoare triple {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:45:07,896 INFO L272 TraceCheckUtils]: 34: Hoare triple {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1574#true} is VALID [2022-04-08 07:45:07,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-08 07:45:07,896 INFO L290 TraceCheckUtils]: 36: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-08 07:45:07,896 INFO L290 TraceCheckUtils]: 37: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-08 07:45:07,897 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1574#true} {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #54#return; {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:45:07,897 INFO L290 TraceCheckUtils]: 39: Hoare triple {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1700#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:45:07,898 INFO L272 TraceCheckUtils]: 40: Hoare triple {1700#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1704#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:07,899 INFO L290 TraceCheckUtils]: 41: Hoare triple {1704#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1708#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:07,899 INFO L290 TraceCheckUtils]: 42: Hoare triple {1708#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1575#false} is VALID [2022-04-08 07:45:07,899 INFO L290 TraceCheckUtils]: 43: Hoare triple {1575#false} assume !false; {1575#false} is VALID [2022-04-08 07:45:07,899 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 07:45:07,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:08,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:08,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943550410] [2022-04-08 07:45:08,276 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:08,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112844270] [2022-04-08 07:45:08,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112844270] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:08,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:08,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 07:45:08,277 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:08,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1677995919] [2022-04-08 07:45:08,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1677995919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:08,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:08,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 07:45:08,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020668432] [2022-04-08 07:45:08,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:08,278 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2022-04-08 07:45:08,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:08,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 07:45:08,306 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 07:45:08,307 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 07:45:08,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:08,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 07:45:08,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:45:08,307 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 07:45:08,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:08,627 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-04-08 07:45:08,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 07:45:08,627 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2022-04-08 07:45:08,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 07:45:08,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-08 07:45:08,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 07:45:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-08 07:45:08,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-08 07:45:08,667 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 07:45:08,669 INFO L225 Difference]: With dead ends: 45 [2022-04-08 07:45:08,669 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 07:45:08,669 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:45:08,670 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:08,670 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 173 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:45:08,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 07:45:08,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-08 07:45:08,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:08,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:45:08,694 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:45:08,695 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:45:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:08,696 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-08 07:45:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-08 07:45:08,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:08,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:08,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-08 07:45:08,697 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-08 07:45:08,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:08,699 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-08 07:45:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-08 07:45:08,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:08,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:08,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:08,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:45:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-08 07:45:08,701 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 44 [2022-04-08 07:45:08,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:08,702 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-08 07:45:08,702 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 07:45:08,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 43 transitions. [2022-04-08 07:45:08,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:08,760 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-08 07:45:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 07:45:08,760 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:08,760 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:08,781 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 07:45:08,961 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 07:45:08,961 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:08,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:08,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 7 times [2022-04-08 07:45:08,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:08,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1669115693] [2022-04-08 07:45:09,047 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:09,047 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:09,047 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:09,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 8 times [2022-04-08 07:45:09,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:09,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322045950] [2022-04-08 07:45:09,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:09,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:09,059 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:09,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1896575282] [2022-04-08 07:45:09,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:45:09,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:09,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:09,063 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 07:45:09,097 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 07:45:09,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:45:09,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:09,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 07:45:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:09,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:09,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {2010#true} call ULTIMATE.init(); {2010#true} is VALID [2022-04-08 07:45:09,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {2010#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2010#true} is VALID [2022-04-08 07:45:09,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-08 07:45:09,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2010#true} {2010#true} #60#return; {2010#true} is VALID [2022-04-08 07:45:09,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {2010#true} call #t~ret5 := main(); {2010#true} is VALID [2022-04-08 07:45:09,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {2010#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2010#true} is VALID [2022-04-08 07:45:09,515 INFO L272 TraceCheckUtils]: 6: Hoare triple {2010#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {2010#true} is VALID [2022-04-08 07:45:09,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-08 07:45:09,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-08 07:45:09,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-08 07:45:09,515 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2010#true} {2010#true} #52#return; {2010#true} is VALID [2022-04-08 07:45:09,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {2010#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:09,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {2048#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:09,516 INFO L272 TraceCheckUtils]: 13: Hoare triple {2048#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2010#true} is VALID [2022-04-08 07:45:09,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-08 07:45:09,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-08 07:45:09,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-08 07:45:09,517 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2010#true} {2048#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:09,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {2048#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:09,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:09,518 INFO L272 TraceCheckUtils]: 20: Hoare triple {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2010#true} is VALID [2022-04-08 07:45:09,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-08 07:45:09,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-08 07:45:09,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-08 07:45:09,519 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2010#true} {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:09,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:09,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:09,520 INFO L272 TraceCheckUtils]: 27: Hoare triple {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2010#true} is VALID [2022-04-08 07:45:09,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-08 07:45:09,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-08 07:45:09,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-08 07:45:09,521 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2010#true} {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:09,521 INFO L290 TraceCheckUtils]: 32: Hoare triple {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 07:45:09,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 07:45:09,522 INFO L272 TraceCheckUtils]: 34: Hoare triple {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2010#true} is VALID [2022-04-08 07:45:09,522 INFO L290 TraceCheckUtils]: 35: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-08 07:45:09,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-08 07:45:09,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-08 07:45:09,523 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2010#true} {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #54#return; {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 07:45:09,523 INFO L290 TraceCheckUtils]: 39: Hoare triple {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 07:45:09,524 INFO L290 TraceCheckUtils]: 40: Hoare triple {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 07:45:09,524 INFO L272 TraceCheckUtils]: 41: Hoare triple {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2010#true} is VALID [2022-04-08 07:45:09,525 INFO L290 TraceCheckUtils]: 42: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-08 07:45:09,525 INFO L290 TraceCheckUtils]: 43: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-08 07:45:09,525 INFO L290 TraceCheckUtils]: 44: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-08 07:45:09,526 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2010#true} {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #54#return; {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 07:45:09,531 INFO L290 TraceCheckUtils]: 46: Hoare triple {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2158#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 07:45:09,533 INFO L272 TraceCheckUtils]: 47: Hoare triple {2158#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2162#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:09,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {2162#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2166#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:09,540 INFO L290 TraceCheckUtils]: 49: Hoare triple {2166#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2011#false} is VALID [2022-04-08 07:45:09,540 INFO L290 TraceCheckUtils]: 50: Hoare triple {2011#false} assume !false; {2011#false} is VALID [2022-04-08 07:45:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 07:45:09,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:09,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:09,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322045950] [2022-04-08 07:45:09,846 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:09,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896575282] [2022-04-08 07:45:09,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896575282] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:09,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:09,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 07:45:09,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:09,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1669115693] [2022-04-08 07:45:09,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1669115693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:09,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:09,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 07:45:09,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255759480] [2022-04-08 07:45:09,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:09,847 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2022-04-08 07:45:09,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:09,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 07:45:09,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:09,881 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 07:45:09,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:09,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 07:45:09,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 07:45:09,882 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 07:45:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:10,296 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-08 07:45:10,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 07:45:10,296 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2022-04-08 07:45:10,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 07:45:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-08 07:45:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 07:45:10,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-08 07:45:10,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2022-04-08 07:45:10,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:10,335 INFO L225 Difference]: With dead ends: 48 [2022-04-08 07:45:10,335 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 07:45:10,336 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-08 07:45:10,336 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:10,337 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 205 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:45:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 07:45:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-08 07:45:10,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:10,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:45:10,362 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:45:10,362 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:45:10,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:10,364 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-08 07:45:10,364 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-08 07:45:10,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:10,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:10,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 43 states. [2022-04-08 07:45:10,365 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 43 states. [2022-04-08 07:45:10,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:10,367 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-08 07:45:10,367 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-08 07:45:10,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:10,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:10,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:10,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:45:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-08 07:45:10,369 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 51 [2022-04-08 07:45:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:10,369 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-08 07:45:10,369 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 07:45:10,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-08 07:45:10,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-08 07:45:10,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 07:45:10,423 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:10,423 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:10,439 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 07:45:10,627 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 07:45:10,627 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:10,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:10,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 9 times [2022-04-08 07:45:10,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:10,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1985934281] [2022-04-08 07:45:10,732 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:10,732 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:10,733 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:10,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 10 times [2022-04-08 07:45:10,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:10,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069794967] [2022-04-08 07:45:10,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:10,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:10,744 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:10,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1366572189] [2022-04-08 07:45:10,745 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:45:10,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:10,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:10,748 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 07:45:10,750 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 07:45:10,853 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:45:10,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:10,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 07:45:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:10,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:11,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {2486#true} call ULTIMATE.init(); {2486#true} is VALID [2022-04-08 07:45:11,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {2486#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2486#true} is VALID [2022-04-08 07:45:11,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-08 07:45:11,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2486#true} {2486#true} #60#return; {2486#true} is VALID [2022-04-08 07:45:11,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {2486#true} call #t~ret5 := main(); {2486#true} is VALID [2022-04-08 07:45:11,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {2486#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2486#true} is VALID [2022-04-08 07:45:11,272 INFO L272 TraceCheckUtils]: 6: Hoare triple {2486#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {2486#true} is VALID [2022-04-08 07:45:11,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-08 07:45:11,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-08 07:45:11,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-08 07:45:11,272 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2486#true} {2486#true} #52#return; {2486#true} is VALID [2022-04-08 07:45:11,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {2486#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:11,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {2524#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:11,275 INFO L272 TraceCheckUtils]: 13: Hoare triple {2524#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2486#true} is VALID [2022-04-08 07:45:11,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-08 07:45:11,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-08 07:45:11,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-08 07:45:11,276 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2486#true} {2524#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:11,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {2524#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2546#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:11,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {2546#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {2546#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:11,277 INFO L272 TraceCheckUtils]: 20: Hoare triple {2546#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2486#true} is VALID [2022-04-08 07:45:11,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-08 07:45:11,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-08 07:45:11,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-08 07:45:11,278 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2486#true} {2546#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {2546#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:11,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {2546#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2568#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:11,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {2568#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {2568#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:11,279 INFO L272 TraceCheckUtils]: 27: Hoare triple {2568#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2486#true} is VALID [2022-04-08 07:45:11,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-08 07:45:11,280 INFO L290 TraceCheckUtils]: 29: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-08 07:45:11,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-08 07:45:11,280 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2486#true} {2568#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {2568#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:11,281 INFO L290 TraceCheckUtils]: 32: Hoare triple {2568#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 07:45:11,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 07:45:11,281 INFO L272 TraceCheckUtils]: 34: Hoare triple {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2486#true} is VALID [2022-04-08 07:45:11,281 INFO L290 TraceCheckUtils]: 35: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-08 07:45:11,281 INFO L290 TraceCheckUtils]: 36: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-08 07:45:11,282 INFO L290 TraceCheckUtils]: 37: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-08 07:45:11,282 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2486#true} {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 07:45:11,283 INFO L290 TraceCheckUtils]: 39: Hoare triple {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:45:11,283 INFO L290 TraceCheckUtils]: 40: Hoare triple {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:45:11,283 INFO L272 TraceCheckUtils]: 41: Hoare triple {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2486#true} is VALID [2022-04-08 07:45:11,283 INFO L290 TraceCheckUtils]: 42: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-08 07:45:11,283 INFO L290 TraceCheckUtils]: 43: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-08 07:45:11,283 INFO L290 TraceCheckUtils]: 44: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-08 07:45:11,284 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2486#true} {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:45:11,285 INFO L290 TraceCheckUtils]: 46: Hoare triple {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 07:45:11,285 INFO L290 TraceCheckUtils]: 47: Hoare triple {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !false; {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 07:45:11,286 INFO L272 TraceCheckUtils]: 48: Hoare triple {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2486#true} is VALID [2022-04-08 07:45:11,286 INFO L290 TraceCheckUtils]: 49: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-08 07:45:11,286 INFO L290 TraceCheckUtils]: 50: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-08 07:45:11,286 INFO L290 TraceCheckUtils]: 51: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-08 07:45:11,286 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2486#true} {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #54#return; {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 07:45:11,288 INFO L290 TraceCheckUtils]: 53: Hoare triple {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2656#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 07:45:11,289 INFO L272 TraceCheckUtils]: 54: Hoare triple {2656#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2660#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:11,289 INFO L290 TraceCheckUtils]: 55: Hoare triple {2660#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2664#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:11,290 INFO L290 TraceCheckUtils]: 56: Hoare triple {2664#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2487#false} is VALID [2022-04-08 07:45:11,290 INFO L290 TraceCheckUtils]: 57: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2022-04-08 07:45:11,290 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 07:45:11,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:11,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:11,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069794967] [2022-04-08 07:45:11,584 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:11,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366572189] [2022-04-08 07:45:11,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366572189] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:11,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:11,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 07:45:11,585 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:11,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1985934281] [2022-04-08 07:45:11,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1985934281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:11,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:11,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 07:45:11,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543363374] [2022-04-08 07:45:11,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:11,586 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-04-08 07:45:11,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:11,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 07:45:11,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:11,629 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 07:45:11,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:11,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 07:45:11,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:45:11,630 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 07:45:12,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:12,141 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-08 07:45:12,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 07:45:12,141 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-04-08 07:45:12,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:12,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 07:45:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-08 07:45:12,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 07:45:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-08 07:45:12,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2022-04-08 07:45:12,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:12,185 INFO L225 Difference]: With dead ends: 51 [2022-04-08 07:45:12,185 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 07:45:12,185 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 07:45:12,186 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:12,186 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 239 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 07:45:12,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 07:45:12,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-08 07:45:12,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:12,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:45:12,213 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:45:12,214 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:45:12,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:12,216 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-08 07:45:12,216 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-08 07:45:12,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:12,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:12,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 46 states. [2022-04-08 07:45:12,216 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 46 states. [2022-04-08 07:45:12,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:12,218 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-08 07:45:12,218 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-08 07:45:12,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:12,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:12,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:12,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:45:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-08 07:45:12,220 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 58 [2022-04-08 07:45:12,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:12,221 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-08 07:45:12,221 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 07:45:12,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 51 transitions. [2022-04-08 07:45:12,295 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 07:45:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-08 07:45:12,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 07:45:12,296 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:12,296 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:12,307 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 07:45:12,496 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 07:45:12,497 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:12,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:12,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 11 times [2022-04-08 07:45:12,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:12,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1107802792] [2022-04-08 07:45:12,587 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:12,588 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:12,588 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:12,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 12 times [2022-04-08 07:45:12,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:12,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777695829] [2022-04-08 07:45:12,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:12,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:12,599 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:12,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1034055902] [2022-04-08 07:45:12,599 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:45:12,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:12,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:12,600 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 07:45:12,601 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 07:45:12,776 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 07:45:12,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:12,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 07:45:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:12,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:13,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {3002#true} call ULTIMATE.init(); {3002#true} is VALID [2022-04-08 07:45:13,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {3002#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {3002#true} is VALID [2022-04-08 07:45:13,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-08 07:45:13,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3002#true} {3002#true} #60#return; {3002#true} is VALID [2022-04-08 07:45:13,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {3002#true} call #t~ret5 := main(); {3002#true} is VALID [2022-04-08 07:45:13,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {3002#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3002#true} is VALID [2022-04-08 07:45:13,217 INFO L272 TraceCheckUtils]: 6: Hoare triple {3002#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {3002#true} is VALID [2022-04-08 07:45:13,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-08 07:45:13,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-08 07:45:13,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-08 07:45:13,217 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3002#true} {3002#true} #52#return; {3002#true} is VALID [2022-04-08 07:45:13,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {3002#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3040#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:13,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {3040#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3040#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:13,218 INFO L272 TraceCheckUtils]: 13: Hoare triple {3040#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3002#true} is VALID [2022-04-08 07:45:13,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-08 07:45:13,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-08 07:45:13,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-08 07:45:13,219 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3002#true} {3040#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3040#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:13,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {3040#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:45:13,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:45:13,219 INFO L272 TraceCheckUtils]: 20: Hoare triple {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3002#true} is VALID [2022-04-08 07:45:13,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-08 07:45:13,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-08 07:45:13,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-08 07:45:13,222 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3002#true} {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:45:13,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3084#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:13,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {3084#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {3084#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:13,223 INFO L272 TraceCheckUtils]: 27: Hoare triple {3084#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3002#true} is VALID [2022-04-08 07:45:13,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-08 07:45:13,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-08 07:45:13,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-08 07:45:13,223 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3002#true} {3084#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {3084#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:13,224 INFO L290 TraceCheckUtils]: 32: Hoare triple {3084#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:45:13,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !false; {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:45:13,224 INFO L272 TraceCheckUtils]: 34: Hoare triple {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3002#true} is VALID [2022-04-08 07:45:13,224 INFO L290 TraceCheckUtils]: 35: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-08 07:45:13,224 INFO L290 TraceCheckUtils]: 36: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-08 07:45:13,224 INFO L290 TraceCheckUtils]: 37: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-08 07:45:13,225 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3002#true} {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #54#return; {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:45:13,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:45:13,226 INFO L290 TraceCheckUtils]: 40: Hoare triple {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:45:13,226 INFO L272 TraceCheckUtils]: 41: Hoare triple {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3002#true} is VALID [2022-04-08 07:45:13,226 INFO L290 TraceCheckUtils]: 42: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-08 07:45:13,226 INFO L290 TraceCheckUtils]: 43: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-08 07:45:13,226 INFO L290 TraceCheckUtils]: 44: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-08 07:45:13,227 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3002#true} {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #54#return; {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:45:13,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:13,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:13,227 INFO L272 TraceCheckUtils]: 48: Hoare triple {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3002#true} is VALID [2022-04-08 07:45:13,227 INFO L290 TraceCheckUtils]: 49: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-08 07:45:13,228 INFO L290 TraceCheckUtils]: 50: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-08 07:45:13,228 INFO L290 TraceCheckUtils]: 51: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-08 07:45:13,228 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3002#true} {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:13,228 INFO L290 TraceCheckUtils]: 53: Hoare triple {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:13,229 INFO L290 TraceCheckUtils]: 54: Hoare triple {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:13,229 INFO L272 TraceCheckUtils]: 55: Hoare triple {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3002#true} is VALID [2022-04-08 07:45:13,229 INFO L290 TraceCheckUtils]: 56: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-08 07:45:13,229 INFO L290 TraceCheckUtils]: 57: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-08 07:45:13,229 INFO L290 TraceCheckUtils]: 58: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-08 07:45:13,230 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3002#true} {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:13,230 INFO L290 TraceCheckUtils]: 60: Hoare triple {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !(~c~0 < ~k~0); {3194#(and (<= main_~k~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:13,231 INFO L272 TraceCheckUtils]: 61: Hoare triple {3194#(and (<= main_~k~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3198#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:13,231 INFO L290 TraceCheckUtils]: 62: Hoare triple {3198#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3202#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:13,232 INFO L290 TraceCheckUtils]: 63: Hoare triple {3202#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3003#false} is VALID [2022-04-08 07:45:13,232 INFO L290 TraceCheckUtils]: 64: Hoare triple {3003#false} assume !false; {3003#false} is VALID [2022-04-08 07:45:13,232 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 14 proven. 63 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 07:45:13,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:13,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:13,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777695829] [2022-04-08 07:45:13,556 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:13,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034055902] [2022-04-08 07:45:13,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034055902] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:13,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:13,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 07:45:13,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:13,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1107802792] [2022-04-08 07:45:13,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1107802792] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:13,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:13,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 07:45:13,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044330961] [2022-04-08 07:45:13,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:13,558 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 65 [2022-04-08 07:45:13,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:13,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 07:45:13,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:13,599 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 07:45:13,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:13,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 07:45:13,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-08 07:45:13,600 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 07:45:14,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:14,211 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-08 07:45:14,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 07:45:14,211 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 65 [2022-04-08 07:45:14,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:14,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 07:45:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-08 07:45:14,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 07:45:14,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-08 07:45:14,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-08 07:45:14,256 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 07:45:14,257 INFO L225 Difference]: With dead ends: 54 [2022-04-08 07:45:14,257 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 07:45:14,257 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-08 07:45:14,257 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:14,258 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 275 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 07:45:14,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 07:45:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-08 07:45:14,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:14,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:45:14,288 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:45:14,289 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:45:14,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:14,290 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-08 07:45:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-08 07:45:14,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:14,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:14,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 49 states. [2022-04-08 07:45:14,291 INFO L87 Difference]: Start difference. First operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 49 states. [2022-04-08 07:45:14,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:14,293 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-08 07:45:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-08 07:45:14,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:14,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:14,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:14,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:45:14,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2022-04-08 07:45:14,295 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 65 [2022-04-08 07:45:14,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:14,295 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2022-04-08 07:45:14,296 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 07:45:14,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 55 transitions. [2022-04-08 07:45:14,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:14,367 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-08 07:45:14,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-08 07:45:14,368 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:14,368 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:14,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-08 07:45:14,573 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 07:45:14,573 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:14,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:14,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1734448024, now seen corresponding path program 13 times [2022-04-08 07:45:14,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:14,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1257197028] [2022-04-08 07:45:14,678 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:14,678 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:14,678 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:14,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1734448024, now seen corresponding path program 14 times [2022-04-08 07:45:14,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:14,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037431820] [2022-04-08 07:45:14,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:14,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:14,689 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:14,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1287804911] [2022-04-08 07:45:14,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:45:14,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:14,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:14,691 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 07:45:14,720 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 07:45:14,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:45:14,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:14,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 07:45:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:14,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:15,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {3558#true} call ULTIMATE.init(); {3558#true} is VALID [2022-04-08 07:45:15,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {3558#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {3558#true} is VALID [2022-04-08 07:45:15,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 07:45:15,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3558#true} {3558#true} #60#return; {3558#true} is VALID [2022-04-08 07:45:15,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {3558#true} call #t~ret5 := main(); {3558#true} is VALID [2022-04-08 07:45:15,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {3558#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3558#true} is VALID [2022-04-08 07:45:15,374 INFO L272 TraceCheckUtils]: 6: Hoare triple {3558#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {3558#true} is VALID [2022-04-08 07:45:15,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-08 07:45:15,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-08 07:45:15,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 07:45:15,374 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3558#true} {3558#true} #52#return; {3558#true} is VALID [2022-04-08 07:45:15,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {3558#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3596#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:15,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {3596#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3596#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:15,375 INFO L272 TraceCheckUtils]: 13: Hoare triple {3596#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3558#true} is VALID [2022-04-08 07:45:15,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-08 07:45:15,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-08 07:45:15,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 07:45:15,376 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3558#true} {3596#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3596#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:15,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {3596#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3618#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:15,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {3618#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {3618#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:15,377 INFO L272 TraceCheckUtils]: 20: Hoare triple {3618#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3558#true} is VALID [2022-04-08 07:45:15,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-08 07:45:15,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-08 07:45:15,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 07:45:15,377 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3558#true} {3618#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {3618#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:15,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {3618#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:45:15,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:45:15,378 INFO L272 TraceCheckUtils]: 27: Hoare triple {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3558#true} is VALID [2022-04-08 07:45:15,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-08 07:45:15,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-08 07:45:15,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 07:45:15,379 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3558#true} {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:45:15,379 INFO L290 TraceCheckUtils]: 32: Hoare triple {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 07:45:15,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 07:45:15,380 INFO L272 TraceCheckUtils]: 34: Hoare triple {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3558#true} is VALID [2022-04-08 07:45:15,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-08 07:45:15,380 INFO L290 TraceCheckUtils]: 36: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-08 07:45:15,380 INFO L290 TraceCheckUtils]: 37: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 07:45:15,381 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3558#true} {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #54#return; {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 07:45:15,381 INFO L290 TraceCheckUtils]: 39: Hoare triple {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:45:15,381 INFO L290 TraceCheckUtils]: 40: Hoare triple {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:45:15,381 INFO L272 TraceCheckUtils]: 41: Hoare triple {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3558#true} is VALID [2022-04-08 07:45:15,382 INFO L290 TraceCheckUtils]: 42: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-08 07:45:15,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-08 07:45:15,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 07:45:15,382 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3558#true} {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:45:15,383 INFO L290 TraceCheckUtils]: 46: Hoare triple {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:45:15,383 INFO L290 TraceCheckUtils]: 47: Hoare triple {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !false; {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:45:15,383 INFO L272 TraceCheckUtils]: 48: Hoare triple {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3558#true} is VALID [2022-04-08 07:45:15,383 INFO L290 TraceCheckUtils]: 49: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-08 07:45:15,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-08 07:45:15,383 INFO L290 TraceCheckUtils]: 51: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 07:45:15,384 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3558#true} {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} #54#return; {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:45:15,384 INFO L290 TraceCheckUtils]: 53: Hoare triple {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:15,385 INFO L290 TraceCheckUtils]: 54: Hoare triple {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:15,385 INFO L272 TraceCheckUtils]: 55: Hoare triple {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3558#true} is VALID [2022-04-08 07:45:15,385 INFO L290 TraceCheckUtils]: 56: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-08 07:45:15,385 INFO L290 TraceCheckUtils]: 57: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-08 07:45:15,385 INFO L290 TraceCheckUtils]: 58: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 07:45:15,386 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3558#true} {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #54#return; {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:15,386 INFO L290 TraceCheckUtils]: 60: Hoare triple {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:45:15,386 INFO L290 TraceCheckUtils]: 61: Hoare triple {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !false; {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:45:15,386 INFO L272 TraceCheckUtils]: 62: Hoare triple {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3558#true} is VALID [2022-04-08 07:45:15,387 INFO L290 TraceCheckUtils]: 63: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-08 07:45:15,387 INFO L290 TraceCheckUtils]: 64: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-08 07:45:15,387 INFO L290 TraceCheckUtils]: 65: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 07:45:15,387 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3558#true} {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #54#return; {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:45:15,388 INFO L290 TraceCheckUtils]: 67: Hoare triple {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3772#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:45:15,388 INFO L272 TraceCheckUtils]: 68: Hoare triple {3772#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3776#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:15,389 INFO L290 TraceCheckUtils]: 69: Hoare triple {3776#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3780#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:15,389 INFO L290 TraceCheckUtils]: 70: Hoare triple {3780#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3559#false} is VALID [2022-04-08 07:45:15,389 INFO L290 TraceCheckUtils]: 71: Hoare triple {3559#false} assume !false; {3559#false} is VALID [2022-04-08 07:45:15,390 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 07:45:15,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:15,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:15,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037431820] [2022-04-08 07:45:15,667 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:15,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287804911] [2022-04-08 07:45:15,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287804911] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:15,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:15,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 07:45:15,668 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:15,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1257197028] [2022-04-08 07:45:15,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1257197028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:15,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:15,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 07:45:15,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280467646] [2022-04-08 07:45:15,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:15,669 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 72 [2022-04-08 07:45:15,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:15,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 07:45:15,706 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 07:45:15,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 07:45:15,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:15,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 07:45:15,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-08 07:45:15,707 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 07:45:16,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:16,375 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-08 07:45:16,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 07:45:16,375 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 72 [2022-04-08 07:45:16,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 07:45:16,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-08 07:45:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 07:45:16,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-08 07:45:16,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-08 07:45:16,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:16,443 INFO L225 Difference]: With dead ends: 57 [2022-04-08 07:45:16,443 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 07:45:16,443 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-08 07:45:16,444 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:16,444 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 313 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 07:45:16,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 07:45:16,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-08 07:45:16,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:16,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:45:16,484 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:45:16,485 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:45:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:16,488 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-08 07:45:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-08 07:45:16,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:16,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:16,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 52 states. [2022-04-08 07:45:16,489 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 52 states. [2022-04-08 07:45:16,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:16,490 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-08 07:45:16,490 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-08 07:45:16,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:16,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:16,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:16,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:16,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:45:16,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-08 07:45:16,494 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 72 [2022-04-08 07:45:16,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:16,494 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-08 07:45:16,494 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 07:45:16,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 59 transitions. [2022-04-08 07:45:16,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:16,572 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-08 07:45:16,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 07:45:16,573 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:16,573 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:16,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 07:45:16,778 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 07:45:16,778 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:16,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:16,778 INFO L85 PathProgramCache]: Analyzing trace with hash 708181929, now seen corresponding path program 15 times [2022-04-08 07:45:16,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:16,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [149094285] [2022-04-08 07:45:16,866 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:16,866 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:16,866 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:16,867 INFO L85 PathProgramCache]: Analyzing trace with hash 708181929, now seen corresponding path program 16 times [2022-04-08 07:45:16,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:16,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682427928] [2022-04-08 07:45:16,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:16,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:16,893 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:16,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1575335374] [2022-04-08 07:45:16,894 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:45:16,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:16,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:16,895 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 07:45:16,907 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 07:45:17,331 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:45:17,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:17,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 07:45:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:17,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:17,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {4154#true} call ULTIMATE.init(); {4154#true} is VALID [2022-04-08 07:45:17,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {4154#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {4154#true} is VALID [2022-04-08 07:45:17,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:17,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4154#true} {4154#true} #60#return; {4154#true} is VALID [2022-04-08 07:45:17,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {4154#true} call #t~ret5 := main(); {4154#true} is VALID [2022-04-08 07:45:17,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {4154#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4154#true} is VALID [2022-04-08 07:45:17,802 INFO L272 TraceCheckUtils]: 6: Hoare triple {4154#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {4154#true} is VALID [2022-04-08 07:45:17,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-08 07:45:17,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-08 07:45:17,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:17,803 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4154#true} {4154#true} #52#return; {4154#true} is VALID [2022-04-08 07:45:17,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {4154#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4192#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:17,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {4192#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4192#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:17,803 INFO L272 TraceCheckUtils]: 13: Hoare triple {4192#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4154#true} is VALID [2022-04-08 07:45:17,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-08 07:45:17,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-08 07:45:17,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:17,804 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4154#true} {4192#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {4192#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:17,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {4192#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4214#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:17,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {4214#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {4214#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:17,805 INFO L272 TraceCheckUtils]: 20: Hoare triple {4214#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4154#true} is VALID [2022-04-08 07:45:17,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-08 07:45:17,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-08 07:45:17,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:17,806 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4154#true} {4214#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {4214#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:17,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {4214#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4236#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:17,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {4236#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {4236#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:17,807 INFO L272 TraceCheckUtils]: 27: Hoare triple {4236#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4154#true} is VALID [2022-04-08 07:45:17,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-08 07:45:17,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-08 07:45:17,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:17,807 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4154#true} {4236#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {4236#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:17,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {4236#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4258#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:45:17,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {4258#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {4258#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:45:17,808 INFO L272 TraceCheckUtils]: 34: Hoare triple {4258#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4154#true} is VALID [2022-04-08 07:45:17,808 INFO L290 TraceCheckUtils]: 35: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-08 07:45:17,808 INFO L290 TraceCheckUtils]: 36: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-08 07:45:17,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:17,809 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4154#true} {4258#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {4258#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:45:17,809 INFO L290 TraceCheckUtils]: 39: Hoare triple {4258#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:17,809 INFO L290 TraceCheckUtils]: 40: Hoare triple {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:17,809 INFO L272 TraceCheckUtils]: 41: Hoare triple {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4154#true} is VALID [2022-04-08 07:45:17,809 INFO L290 TraceCheckUtils]: 42: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-08 07:45:17,809 INFO L290 TraceCheckUtils]: 43: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-08 07:45:17,809 INFO L290 TraceCheckUtils]: 44: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:17,810 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4154#true} {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:17,810 INFO L290 TraceCheckUtils]: 46: Hoare triple {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 07:45:17,811 INFO L290 TraceCheckUtils]: 47: Hoare triple {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 07:45:17,811 INFO L272 TraceCheckUtils]: 48: Hoare triple {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4154#true} is VALID [2022-04-08 07:45:17,811 INFO L290 TraceCheckUtils]: 49: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-08 07:45:17,811 INFO L290 TraceCheckUtils]: 50: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-08 07:45:17,811 INFO L290 TraceCheckUtils]: 51: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:17,811 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4154#true} {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #54#return; {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 07:45:17,812 INFO L290 TraceCheckUtils]: 53: Hoare triple {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:45:17,812 INFO L290 TraceCheckUtils]: 54: Hoare triple {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:45:17,812 INFO L272 TraceCheckUtils]: 55: Hoare triple {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4154#true} is VALID [2022-04-08 07:45:17,812 INFO L290 TraceCheckUtils]: 56: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-08 07:45:17,812 INFO L290 TraceCheckUtils]: 57: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-08 07:45:17,812 INFO L290 TraceCheckUtils]: 58: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:17,813 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4154#true} {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:45:17,813 INFO L290 TraceCheckUtils]: 60: Hoare triple {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:17,813 INFO L290 TraceCheckUtils]: 61: Hoare triple {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !false; {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:17,813 INFO L272 TraceCheckUtils]: 62: Hoare triple {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4154#true} is VALID [2022-04-08 07:45:17,814 INFO L290 TraceCheckUtils]: 63: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-08 07:45:17,814 INFO L290 TraceCheckUtils]: 64: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-08 07:45:17,814 INFO L290 TraceCheckUtils]: 65: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:17,814 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4154#true} {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} #54#return; {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:17,814 INFO L290 TraceCheckUtils]: 67: Hoare triple {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 07:45:17,815 INFO L290 TraceCheckUtils]: 68: Hoare triple {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} assume !false; {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 07:45:17,815 INFO L272 TraceCheckUtils]: 69: Hoare triple {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4154#true} is VALID [2022-04-08 07:45:17,815 INFO L290 TraceCheckUtils]: 70: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-08 07:45:17,815 INFO L290 TraceCheckUtils]: 71: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-08 07:45:17,815 INFO L290 TraceCheckUtils]: 72: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:17,816 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4154#true} {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} #54#return; {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 07:45:17,816 INFO L290 TraceCheckUtils]: 74: Hoare triple {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} assume !(~c~0 < ~k~0); {4390#(and (< 7 main_~k~0) (= (+ (- 2) main_~y~0) 6) (<= main_~k~0 8))} is VALID [2022-04-08 07:45:17,817 INFO L272 TraceCheckUtils]: 75: Hoare triple {4390#(and (< 7 main_~k~0) (= (+ (- 2) main_~y~0) 6) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4394#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:17,817 INFO L290 TraceCheckUtils]: 76: Hoare triple {4394#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4398#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:17,817 INFO L290 TraceCheckUtils]: 77: Hoare triple {4398#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4155#false} is VALID [2022-04-08 07:45:17,817 INFO L290 TraceCheckUtils]: 78: Hoare triple {4155#false} assume !false; {4155#false} is VALID [2022-04-08 07:45:17,818 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 07:45:17,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:18,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:18,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682427928] [2022-04-08 07:45:18,106 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:18,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575335374] [2022-04-08 07:45:18,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575335374] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:18,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:18,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-08 07:45:18,106 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:18,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [149094285] [2022-04-08 07:45:18,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [149094285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:18,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:18,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 07:45:18,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482771947] [2022-04-08 07:45:18,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:18,107 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 79 [2022-04-08 07:45:18,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:18,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 07:45:18,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:18,144 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 07:45:18,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:18,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 07:45:18,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 07:45:18,145 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 07:45:18,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:18,930 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-04-08 07:45:18,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 07:45:18,930 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 79 [2022-04-08 07:45:18,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:18,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 07:45:18,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-08 07:45:18,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 07:45:18,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-08 07:45:18,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 64 transitions. [2022-04-08 07:45:18,982 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 07:45:18,983 INFO L225 Difference]: With dead ends: 60 [2022-04-08 07:45:18,983 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 07:45:18,983 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 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 07:45:18,984 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:18,984 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 353 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 07:45:18,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 07:45:19,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-08 07:45:19,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:19,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:45:19,031 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:45:19,032 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:45:19,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:19,037 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-08 07:45:19,037 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-08 07:45:19,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:19,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:19,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 55 states. [2022-04-08 07:45:19,037 INFO L87 Difference]: Start difference. First operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 55 states. [2022-04-08 07:45:19,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:19,039 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-08 07:45:19,039 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-08 07:45:19,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:19,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:19,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:19,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:45:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-04-08 07:45:19,042 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 79 [2022-04-08 07:45:19,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:19,042 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-04-08 07:45:19,043 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 07:45:19,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 63 transitions. [2022-04-08 07:45:19,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:19,115 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-08 07:45:19,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-08 07:45:19,116 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:19,116 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:19,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-08 07:45:19,321 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 07:45:19,321 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:19,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:19,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1649446584, now seen corresponding path program 17 times [2022-04-08 07:45:19,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:19,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [89153511] [2022-04-08 07:45:19,400 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:19,401 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:19,401 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:19,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1649446584, now seen corresponding path program 18 times [2022-04-08 07:45:19,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:19,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684407138] [2022-04-08 07:45:19,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:19,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:19,415 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:19,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1094037470] [2022-04-08 07:45:19,416 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:45:19,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:19,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:19,417 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 07:45:19,427 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 07:45:19,639 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 07:45:19,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:19,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 07:45:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:19,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:20,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {4790#true} call ULTIMATE.init(); {4790#true} is VALID [2022-04-08 07:45:20,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {4790#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {4790#true} is VALID [2022-04-08 07:45:20,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:20,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4790#true} {4790#true} #60#return; {4790#true} is VALID [2022-04-08 07:45:20,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {4790#true} call #t~ret5 := main(); {4790#true} is VALID [2022-04-08 07:45:20,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {4790#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4790#true} is VALID [2022-04-08 07:45:20,183 INFO L272 TraceCheckUtils]: 6: Hoare triple {4790#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {4790#true} is VALID [2022-04-08 07:45:20,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:20,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:20,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:20,183 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4790#true} {4790#true} #52#return; {4790#true} is VALID [2022-04-08 07:45:20,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {4790#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4828#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:20,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {4828#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4828#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:20,184 INFO L272 TraceCheckUtils]: 13: Hoare triple {4828#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4790#true} is VALID [2022-04-08 07:45:20,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:20,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:20,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:20,184 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4790#true} {4828#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {4828#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:20,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {4828#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:20,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:20,185 INFO L272 TraceCheckUtils]: 20: Hoare triple {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4790#true} is VALID [2022-04-08 07:45:20,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:20,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:20,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:20,186 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4790#true} {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:20,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4872#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:20,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {4872#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {4872#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:20,186 INFO L272 TraceCheckUtils]: 27: Hoare triple {4872#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4790#true} is VALID [2022-04-08 07:45:20,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:20,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:20,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:20,187 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4790#true} {4872#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {4872#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:20,187 INFO L290 TraceCheckUtils]: 32: Hoare triple {4872#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 07:45:20,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 07:45:20,188 INFO L272 TraceCheckUtils]: 34: Hoare triple {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4790#true} is VALID [2022-04-08 07:45:20,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:20,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:20,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:20,191 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4790#true} {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< main_~c~0 (+ main_~k~0 1)))} #54#return; {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 07:45:20,192 INFO L290 TraceCheckUtils]: 39: Hoare triple {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4916#(and (= main_~c~0 4) (< 2 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:45:20,192 INFO L290 TraceCheckUtils]: 40: Hoare triple {4916#(and (= main_~c~0 4) (< 2 main_~k~0) (= (+ (- 2) main_~y~0) 2))} assume !false; {4916#(and (= main_~c~0 4) (< 2 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:45:20,192 INFO L272 TraceCheckUtils]: 41: Hoare triple {4916#(and (= main_~c~0 4) (< 2 main_~k~0) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4790#true} is VALID [2022-04-08 07:45:20,192 INFO L290 TraceCheckUtils]: 42: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:20,192 INFO L290 TraceCheckUtils]: 43: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:20,192 INFO L290 TraceCheckUtils]: 44: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:20,193 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4790#true} {4916#(and (= main_~c~0 4) (< 2 main_~k~0) (= (+ (- 2) main_~y~0) 2))} #54#return; {4916#(and (= main_~c~0 4) (< 2 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:45:20,193 INFO L290 TraceCheckUtils]: 46: Hoare triple {4916#(and (= main_~c~0 4) (< 2 main_~k~0) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID [2022-04-08 07:45:20,193 INFO L290 TraceCheckUtils]: 47: Hoare triple {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 2 main_~k~0))} assume !false; {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID [2022-04-08 07:45:20,193 INFO L272 TraceCheckUtils]: 48: Hoare triple {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4790#true} is VALID [2022-04-08 07:45:20,194 INFO L290 TraceCheckUtils]: 49: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:20,194 INFO L290 TraceCheckUtils]: 50: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:20,194 INFO L290 TraceCheckUtils]: 51: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:20,194 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4790#true} {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 2 main_~k~0))} #54#return; {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID [2022-04-08 07:45:20,195 INFO L290 TraceCheckUtils]: 53: Hoare triple {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 2 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4960#(and (= 4 (+ (- 2) main_~c~0)) (< 2 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:20,195 INFO L290 TraceCheckUtils]: 54: Hoare triple {4960#(and (= 4 (+ (- 2) main_~c~0)) (< 2 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} assume !false; {4960#(and (= 4 (+ (- 2) main_~c~0)) (< 2 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:20,195 INFO L272 TraceCheckUtils]: 55: Hoare triple {4960#(and (= 4 (+ (- 2) main_~c~0)) (< 2 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4790#true} is VALID [2022-04-08 07:45:20,195 INFO L290 TraceCheckUtils]: 56: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:20,195 INFO L290 TraceCheckUtils]: 57: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:20,195 INFO L290 TraceCheckUtils]: 58: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:20,196 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4790#true} {4960#(and (= 4 (+ (- 2) main_~c~0)) (< 2 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} #54#return; {4960#(and (= 4 (+ (- 2) main_~c~0)) (< 2 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:20,196 INFO L290 TraceCheckUtils]: 60: Hoare triple {4960#(and (= 4 (+ (- 2) main_~c~0)) (< 2 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4982#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 2 main_~k~0))} is VALID [2022-04-08 07:45:20,196 INFO L290 TraceCheckUtils]: 61: Hoare triple {4982#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 2 main_~k~0))} assume !false; {4982#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 2 main_~k~0))} is VALID [2022-04-08 07:45:20,196 INFO L272 TraceCheckUtils]: 62: Hoare triple {4982#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4790#true} is VALID [2022-04-08 07:45:20,196 INFO L290 TraceCheckUtils]: 63: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:20,196 INFO L290 TraceCheckUtils]: 64: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:20,197 INFO L290 TraceCheckUtils]: 65: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:20,197 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4790#true} {4982#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 2 main_~k~0))} #54#return; {4982#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 2 main_~k~0))} is VALID [2022-04-08 07:45:20,197 INFO L290 TraceCheckUtils]: 67: Hoare triple {4982#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 2 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5004#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} is VALID [2022-04-08 07:45:20,198 INFO L290 TraceCheckUtils]: 68: Hoare triple {5004#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} assume !false; {5004#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} is VALID [2022-04-08 07:45:20,198 INFO L272 TraceCheckUtils]: 69: Hoare triple {5004#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4790#true} is VALID [2022-04-08 07:45:20,198 INFO L290 TraceCheckUtils]: 70: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:20,198 INFO L290 TraceCheckUtils]: 71: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:20,198 INFO L290 TraceCheckUtils]: 72: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:20,198 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4790#true} {5004#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} #54#return; {5004#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} is VALID [2022-04-08 07:45:20,199 INFO L290 TraceCheckUtils]: 74: Hoare triple {5004#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 07:45:20,199 INFO L290 TraceCheckUtils]: 75: Hoare triple {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 07:45:20,199 INFO L272 TraceCheckUtils]: 76: Hoare triple {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4790#true} is VALID [2022-04-08 07:45:20,199 INFO L290 TraceCheckUtils]: 77: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:20,199 INFO L290 TraceCheckUtils]: 78: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:20,199 INFO L290 TraceCheckUtils]: 79: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:20,200 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {4790#true} {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #54#return; {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 07:45:20,200 INFO L290 TraceCheckUtils]: 81: Hoare triple {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {5048#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 07:45:20,203 INFO L272 TraceCheckUtils]: 82: Hoare triple {5048#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5052#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:20,204 INFO L290 TraceCheckUtils]: 83: Hoare triple {5052#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5056#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:20,204 INFO L290 TraceCheckUtils]: 84: Hoare triple {5056#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4791#false} is VALID [2022-04-08 07:45:20,204 INFO L290 TraceCheckUtils]: 85: Hoare triple {4791#false} assume !false; {4791#false} is VALID [2022-04-08 07:45:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-08 07:45:20,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:21,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:21,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684407138] [2022-04-08 07:45:21,097 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:21,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094037470] [2022-04-08 07:45:21,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094037470] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:21,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:21,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-08 07:45:21,098 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:21,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [89153511] [2022-04-08 07:45:21,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [89153511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:21,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:21,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 07:45:21,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693746815] [2022-04-08 07:45:21,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:21,099 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 86 [2022-04-08 07:45:21,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:21,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 07:45:21,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:21,142 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 07:45:21,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:21,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 07:45:21,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-04-08 07:45:21,143 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 07:45:22,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:22,141 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-08 07:45:22,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 07:45:22,141 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 86 [2022-04-08 07:45:22,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:22,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 07:45:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-08 07:45:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 07:45:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-08 07:45:22,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 68 transitions. [2022-04-08 07:45:22,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:22,203 INFO L225 Difference]: With dead ends: 63 [2022-04-08 07:45:22,203 INFO L226 Difference]: Without dead ends: 58 [2022-04-08 07:45:22,204 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2022-04-08 07:45:22,204 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:22,204 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 389 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 07:45:22,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-08 07:45:22,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-08 07:45:22,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:22,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:45:22,265 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:45:22,265 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:45:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:22,266 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-08 07:45:22,266 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-08 07:45:22,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:22,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:22,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 58 states. [2022-04-08 07:45:22,267 INFO L87 Difference]: Start difference. First operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 58 states. [2022-04-08 07:45:22,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:22,269 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-08 07:45:22,269 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-08 07:45:22,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:22,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:22,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:22,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:22,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:45:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-04-08 07:45:22,271 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 86 [2022-04-08 07:45:22,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:22,271 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-04-08 07:45:22,271 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 07:45:22,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 67 transitions. [2022-04-08 07:45:22,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:22,360 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-08 07:45:22,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-08 07:45:22,361 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:22,361 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:22,370 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 07:45:22,568 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 07:45:22,568 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:22,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:22,568 INFO L85 PathProgramCache]: Analyzing trace with hash -373309751, now seen corresponding path program 19 times [2022-04-08 07:45:22,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:22,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1834609566] [2022-04-08 07:45:22,658 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:22,658 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:22,658 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:22,659 INFO L85 PathProgramCache]: Analyzing trace with hash -373309751, now seen corresponding path program 20 times [2022-04-08 07:45:22,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:22,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518033168] [2022-04-08 07:45:22,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:22,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:22,670 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:22,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [633692986] [2022-04-08 07:45:22,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:45:22,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:22,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:22,671 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 07:45:22,679 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 07:45:23,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:45:23,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:23,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 07:45:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:23,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:23,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {5598#true} call ULTIMATE.init(); {5598#true} is VALID [2022-04-08 07:45:23,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {5598#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {5598#true} is VALID [2022-04-08 07:45:23,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-08 07:45:23,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5598#true} {5598#true} #60#return; {5598#true} is VALID [2022-04-08 07:45:23,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {5598#true} call #t~ret5 := main(); {5598#true} is VALID [2022-04-08 07:45:23,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {5598#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {5598#true} is VALID [2022-04-08 07:45:23,800 INFO L272 TraceCheckUtils]: 6: Hoare triple {5598#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {5598#true} is VALID [2022-04-08 07:45:23,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-08 07:45:23,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-08 07:45:23,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-08 07:45:23,801 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5598#true} {5598#true} #52#return; {5598#true} is VALID [2022-04-08 07:45:23,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {5598#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5636#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:23,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {5636#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5636#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:23,801 INFO L272 TraceCheckUtils]: 13: Hoare triple {5636#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5598#true} is VALID [2022-04-08 07:45:23,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-08 07:45:23,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-08 07:45:23,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-08 07:45:23,802 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5598#true} {5636#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {5636#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:23,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {5636#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5658#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:45:23,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {5658#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {5658#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:45:23,803 INFO L272 TraceCheckUtils]: 20: Hoare triple {5658#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5598#true} is VALID [2022-04-08 07:45:23,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-08 07:45:23,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-08 07:45:23,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-08 07:45:23,803 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5598#true} {5658#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {5658#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:45:23,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {5658#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5680#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:23,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {5680#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {5680#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:23,804 INFO L272 TraceCheckUtils]: 27: Hoare triple {5680#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5598#true} is VALID [2022-04-08 07:45:23,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-08 07:45:23,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-08 07:45:23,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-08 07:45:23,805 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5598#true} {5680#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {5680#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:23,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {5680#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5702#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:45:23,806 INFO L290 TraceCheckUtils]: 33: Hoare triple {5702#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !false; {5702#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:45:23,806 INFO L272 TraceCheckUtils]: 34: Hoare triple {5702#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5598#true} is VALID [2022-04-08 07:45:23,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-08 07:45:23,806 INFO L290 TraceCheckUtils]: 36: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-08 07:45:23,806 INFO L290 TraceCheckUtils]: 37: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-08 07:45:23,807 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5598#true} {5702#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #54#return; {5702#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:45:23,808 INFO L290 TraceCheckUtils]: 39: Hoare triple {5702#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5724#(and (= 2 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:45:23,808 INFO L290 TraceCheckUtils]: 40: Hoare triple {5724#(and (= 2 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 2))} assume !false; {5724#(and (= 2 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:45:23,808 INFO L272 TraceCheckUtils]: 41: Hoare triple {5724#(and (= 2 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5598#true} is VALID [2022-04-08 07:45:23,808 INFO L290 TraceCheckUtils]: 42: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-08 07:45:23,809 INFO L290 TraceCheckUtils]: 43: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-08 07:45:23,809 INFO L290 TraceCheckUtils]: 44: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-08 07:45:23,809 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5598#true} {5724#(and (= 2 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 2))} #54#return; {5724#(and (= 2 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:45:23,810 INFO L290 TraceCheckUtils]: 46: Hoare triple {5724#(and (= 2 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5746#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:23,810 INFO L290 TraceCheckUtils]: 47: Hoare triple {5746#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !false; {5746#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:23,810 INFO L272 TraceCheckUtils]: 48: Hoare triple {5746#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5598#true} is VALID [2022-04-08 07:45:23,813 INFO L290 TraceCheckUtils]: 49: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-08 07:45:23,813 INFO L290 TraceCheckUtils]: 50: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-08 07:45:23,813 INFO L290 TraceCheckUtils]: 51: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-08 07:45:23,814 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5598#true} {5746#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} #54#return; {5746#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:23,814 INFO L290 TraceCheckUtils]: 53: Hoare triple {5746#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5768#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:23,815 INFO L290 TraceCheckUtils]: 54: Hoare triple {5768#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} assume !false; {5768#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:23,815 INFO L272 TraceCheckUtils]: 55: Hoare triple {5768#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5598#true} is VALID [2022-04-08 07:45:23,815 INFO L290 TraceCheckUtils]: 56: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-08 07:45:23,815 INFO L290 TraceCheckUtils]: 57: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-08 07:45:23,815 INFO L290 TraceCheckUtils]: 58: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-08 07:45:23,816 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5598#true} {5768#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} #54#return; {5768#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:23,816 INFO L290 TraceCheckUtils]: 60: Hoare triple {5768#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5790#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 07:45:23,817 INFO L290 TraceCheckUtils]: 61: Hoare triple {5790#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !false; {5790#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 07:45:23,817 INFO L272 TraceCheckUtils]: 62: Hoare triple {5790#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5598#true} is VALID [2022-04-08 07:45:23,817 INFO L290 TraceCheckUtils]: 63: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-08 07:45:23,817 INFO L290 TraceCheckUtils]: 64: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-08 07:45:23,817 INFO L290 TraceCheckUtils]: 65: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-08 07:45:23,818 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5598#true} {5790#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #54#return; {5790#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 07:45:23,818 INFO L290 TraceCheckUtils]: 67: Hoare triple {5790#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5812#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 07:45:23,818 INFO L290 TraceCheckUtils]: 68: Hoare triple {5812#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} assume !false; {5812#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 07:45:23,819 INFO L272 TraceCheckUtils]: 69: Hoare triple {5812#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5598#true} is VALID [2022-04-08 07:45:23,819 INFO L290 TraceCheckUtils]: 70: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-08 07:45:23,819 INFO L290 TraceCheckUtils]: 71: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-08 07:45:23,819 INFO L290 TraceCheckUtils]: 72: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-08 07:45:23,819 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5598#true} {5812#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} #54#return; {5812#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 07:45:23,820 INFO L290 TraceCheckUtils]: 74: Hoare triple {5812#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5834#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} is VALID [2022-04-08 07:45:23,820 INFO L290 TraceCheckUtils]: 75: Hoare triple {5834#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} assume !false; {5834#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} is VALID [2022-04-08 07:45:23,820 INFO L272 TraceCheckUtils]: 76: Hoare triple {5834#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5598#true} is VALID [2022-04-08 07:45:23,820 INFO L290 TraceCheckUtils]: 77: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-08 07:45:23,821 INFO L290 TraceCheckUtils]: 78: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-08 07:45:23,821 INFO L290 TraceCheckUtils]: 79: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-08 07:45:23,821 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {5598#true} {5834#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} #54#return; {5834#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} is VALID [2022-04-08 07:45:23,822 INFO L290 TraceCheckUtils]: 81: Hoare triple {5834#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5856#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 07:45:23,822 INFO L290 TraceCheckUtils]: 82: Hoare triple {5856#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} assume !false; {5856#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 07:45:23,822 INFO L272 TraceCheckUtils]: 83: Hoare triple {5856#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5598#true} is VALID [2022-04-08 07:45:23,822 INFO L290 TraceCheckUtils]: 84: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-08 07:45:23,822 INFO L290 TraceCheckUtils]: 85: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-08 07:45:23,822 INFO L290 TraceCheckUtils]: 86: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-08 07:45:23,823 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {5598#true} {5856#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} #54#return; {5856#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 07:45:23,824 INFO L290 TraceCheckUtils]: 88: Hoare triple {5856#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {5878#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 07:45:23,824 INFO L272 TraceCheckUtils]: 89: Hoare triple {5878#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5882#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:23,825 INFO L290 TraceCheckUtils]: 90: Hoare triple {5882#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5886#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:23,825 INFO L290 TraceCheckUtils]: 91: Hoare triple {5886#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5599#false} is VALID [2022-04-08 07:45:23,825 INFO L290 TraceCheckUtils]: 92: Hoare triple {5599#false} assume !false; {5599#false} is VALID [2022-04-08 07:45:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 22 proven. 165 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-08 07:45:23,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:24,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:24,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518033168] [2022-04-08 07:45:24,097 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:24,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633692986] [2022-04-08 07:45:24,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633692986] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:24,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:24,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-08 07:45:24,097 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:24,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1834609566] [2022-04-08 07:45:24,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1834609566] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:24,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:24,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 07:45:24,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830842758] [2022-04-08 07:45:24,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:24,098 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 93 [2022-04-08 07:45:24,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:24,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 07:45:24,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:24,143 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 07:45:24,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:24,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 07:45:24,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-08 07:45:24,143 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 07:45:25,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:25,271 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-08 07:45:25,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 07:45:25,271 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 93 [2022-04-08 07:45:25,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 07:45:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-08 07:45:25,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 07:45:25,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-08 07:45:25,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 72 transitions. [2022-04-08 07:45:25,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:25,338 INFO L225 Difference]: With dead ends: 66 [2022-04-08 07:45:25,338 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 07:45:25,339 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-08 07:45:25,339 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:25,339 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 439 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 07:45:25,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 07:45:25,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-08 07:45:25,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:25,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 07:45:25,388 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 07:45:25,388 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 07:45:25,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:25,390 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-08 07:45:25,390 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-08 07:45:25,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:25,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:25,391 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 61 states. [2022-04-08 07:45:25,391 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 61 states. [2022-04-08 07:45:25,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:25,392 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-08 07:45:25,392 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-08 07:45:25,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:25,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:25,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:25,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:25,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 07:45:25,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2022-04-08 07:45:25,395 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 93 [2022-04-08 07:45:25,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:25,395 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2022-04-08 07:45:25,395 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 07:45:25,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 71 transitions. [2022-04-08 07:45:25,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:25,486 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-08 07:45:25,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-08 07:45:25,487 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:25,487 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:25,492 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 07:45:25,691 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 07:45:25,692 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:25,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:25,692 INFO L85 PathProgramCache]: Analyzing trace with hash -22647256, now seen corresponding path program 21 times [2022-04-08 07:45:25,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:25,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [542534330] [2022-04-08 07:45:25,762 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:25,762 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:25,762 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:25,762 INFO L85 PathProgramCache]: Analyzing trace with hash -22647256, now seen corresponding path program 22 times [2022-04-08 07:45:25,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:25,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049460564] [2022-04-08 07:45:25,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:25,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:25,773 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:25,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1478338908] [2022-04-08 07:45:25,774 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:45:25,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:25,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:25,775 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 07:45:25,778 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 07:45:26,825 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:45:26,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:26,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-08 07:45:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:26,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:27,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {6314#true} call ULTIMATE.init(); {6314#true} is VALID [2022-04-08 07:45:27,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {6314#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {6314#true} is VALID [2022-04-08 07:45:27,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-08 07:45:27,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6314#true} {6314#true} #60#return; {6314#true} is VALID [2022-04-08 07:45:27,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {6314#true} call #t~ret5 := main(); {6314#true} is VALID [2022-04-08 07:45:27,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {6314#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {6314#true} is VALID [2022-04-08 07:45:27,369 INFO L272 TraceCheckUtils]: 6: Hoare triple {6314#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {6314#true} is VALID [2022-04-08 07:45:27,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-08 07:45:27,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-08 07:45:27,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-08 07:45:27,369 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6314#true} {6314#true} #52#return; {6314#true} is VALID [2022-04-08 07:45:27,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {6314#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6352#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:27,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {6352#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6352#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:27,381 INFO L272 TraceCheckUtils]: 13: Hoare triple {6352#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6314#true} is VALID [2022-04-08 07:45:27,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-08 07:45:27,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-08 07:45:27,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-08 07:45:27,382 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6314#true} {6352#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {6352#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:27,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {6352#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6374#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:27,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {6374#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {6374#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:27,383 INFO L272 TraceCheckUtils]: 20: Hoare triple {6374#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6314#true} is VALID [2022-04-08 07:45:27,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-08 07:45:27,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-08 07:45:27,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-08 07:45:27,383 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6314#true} {6374#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {6374#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:27,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {6374#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6396#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:27,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {6396#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {6396#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:27,384 INFO L272 TraceCheckUtils]: 27: Hoare triple {6396#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6314#true} is VALID [2022-04-08 07:45:27,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-08 07:45:27,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-08 07:45:27,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-08 07:45:27,386 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6314#true} {6396#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {6396#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:27,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {6396#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6418#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 07:45:27,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {6418#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {6418#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 07:45:27,387 INFO L272 TraceCheckUtils]: 34: Hoare triple {6418#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6314#true} is VALID [2022-04-08 07:45:27,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-08 07:45:27,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-08 07:45:27,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-08 07:45:27,387 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6314#true} {6418#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #54#return; {6418#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 07:45:27,388 INFO L290 TraceCheckUtils]: 39: Hoare triple {6418#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6440#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:45:27,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {6440#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {6440#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:45:27,388 INFO L272 TraceCheckUtils]: 41: Hoare triple {6440#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6314#true} is VALID [2022-04-08 07:45:27,388 INFO L290 TraceCheckUtils]: 42: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-08 07:45:27,388 INFO L290 TraceCheckUtils]: 43: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-08 07:45:27,388 INFO L290 TraceCheckUtils]: 44: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-08 07:45:27,389 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6314#true} {6440#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {6440#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:45:27,389 INFO L290 TraceCheckUtils]: 46: Hoare triple {6440#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6462#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:27,389 INFO L290 TraceCheckUtils]: 47: Hoare triple {6462#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {6462#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:27,390 INFO L272 TraceCheckUtils]: 48: Hoare triple {6462#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6314#true} is VALID [2022-04-08 07:45:27,390 INFO L290 TraceCheckUtils]: 49: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-08 07:45:27,390 INFO L290 TraceCheckUtils]: 50: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-08 07:45:27,390 INFO L290 TraceCheckUtils]: 51: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-08 07:45:27,390 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6314#true} {6462#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {6462#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:27,391 INFO L290 TraceCheckUtils]: 53: Hoare triple {6462#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6484#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:45:27,391 INFO L290 TraceCheckUtils]: 54: Hoare triple {6484#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {6484#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:45:27,391 INFO L272 TraceCheckUtils]: 55: Hoare triple {6484#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6314#true} is VALID [2022-04-08 07:45:27,391 INFO L290 TraceCheckUtils]: 56: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-08 07:45:27,391 INFO L290 TraceCheckUtils]: 57: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-08 07:45:27,391 INFO L290 TraceCheckUtils]: 58: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-08 07:45:27,392 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6314#true} {6484#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {6484#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:45:27,392 INFO L290 TraceCheckUtils]: 60: Hoare triple {6484#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6506#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:45:27,393 INFO L290 TraceCheckUtils]: 61: Hoare triple {6506#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {6506#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:45:27,393 INFO L272 TraceCheckUtils]: 62: Hoare triple {6506#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6314#true} is VALID [2022-04-08 07:45:27,393 INFO L290 TraceCheckUtils]: 63: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-08 07:45:27,393 INFO L290 TraceCheckUtils]: 64: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-08 07:45:27,393 INFO L290 TraceCheckUtils]: 65: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-08 07:45:27,393 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6314#true} {6506#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {6506#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:45:27,394 INFO L290 TraceCheckUtils]: 67: Hoare triple {6506#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6528#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 07:45:27,394 INFO L290 TraceCheckUtils]: 68: Hoare triple {6528#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !false; {6528#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 07:45:27,394 INFO L272 TraceCheckUtils]: 69: Hoare triple {6528#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6314#true} is VALID [2022-04-08 07:45:27,394 INFO L290 TraceCheckUtils]: 70: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-08 07:45:27,394 INFO L290 TraceCheckUtils]: 71: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-08 07:45:27,394 INFO L290 TraceCheckUtils]: 72: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-08 07:45:27,395 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6314#true} {6528#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #54#return; {6528#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 07:45:27,395 INFO L290 TraceCheckUtils]: 74: Hoare triple {6528#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6550#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 07:45:27,395 INFO L290 TraceCheckUtils]: 75: Hoare triple {6550#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !false; {6550#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 07:45:27,395 INFO L272 TraceCheckUtils]: 76: Hoare triple {6550#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6314#true} is VALID [2022-04-08 07:45:27,395 INFO L290 TraceCheckUtils]: 77: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-08 07:45:27,396 INFO L290 TraceCheckUtils]: 78: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-08 07:45:27,396 INFO L290 TraceCheckUtils]: 79: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-08 07:45:27,396 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6314#true} {6550#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #54#return; {6550#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 07:45:27,396 INFO L290 TraceCheckUtils]: 81: Hoare triple {6550#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6572#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-08 07:45:27,397 INFO L290 TraceCheckUtils]: 82: Hoare triple {6572#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} assume !false; {6572#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-08 07:45:27,397 INFO L272 TraceCheckUtils]: 83: Hoare triple {6572#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6314#true} is VALID [2022-04-08 07:45:27,397 INFO L290 TraceCheckUtils]: 84: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-08 07:45:27,397 INFO L290 TraceCheckUtils]: 85: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-08 07:45:27,397 INFO L290 TraceCheckUtils]: 86: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-08 07:45:27,397 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {6314#true} {6572#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} #54#return; {6572#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-08 07:45:27,398 INFO L290 TraceCheckUtils]: 88: Hoare triple {6572#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6594#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-08 07:45:27,398 INFO L290 TraceCheckUtils]: 89: Hoare triple {6594#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !false; {6594#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-08 07:45:27,398 INFO L272 TraceCheckUtils]: 90: Hoare triple {6594#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6314#true} is VALID [2022-04-08 07:45:27,398 INFO L290 TraceCheckUtils]: 91: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-08 07:45:27,398 INFO L290 TraceCheckUtils]: 92: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-08 07:45:27,398 INFO L290 TraceCheckUtils]: 93: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-08 07:45:27,399 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {6314#true} {6594#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} #54#return; {6594#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-08 07:45:27,399 INFO L290 TraceCheckUtils]: 95: Hoare triple {6594#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !(~c~0 < ~k~0); {6616#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} is VALID [2022-04-08 07:45:27,400 INFO L272 TraceCheckUtils]: 96: Hoare triple {6616#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6620#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:27,400 INFO L290 TraceCheckUtils]: 97: Hoare triple {6620#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6624#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:27,400 INFO L290 TraceCheckUtils]: 98: Hoare triple {6624#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6315#false} is VALID [2022-04-08 07:45:27,400 INFO L290 TraceCheckUtils]: 99: Hoare triple {6315#false} assume !false; {6315#false} is VALID [2022-04-08 07:45:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 24 proven. 198 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-08 07:45:27,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:27,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:27,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049460564] [2022-04-08 07:45:27,645 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:27,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478338908] [2022-04-08 07:45:27,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478338908] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:27,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:27,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-08 07:45:27,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:27,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [542534330] [2022-04-08 07:45:27,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [542534330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:27,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:27,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 07:45:27,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863277788] [2022-04-08 07:45:27,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:27,646 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 100 [2022-04-08 07:45:27,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:27,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 07:45:27,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:27,694 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 07:45:27,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:27,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 07:45:27,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-08 07:45:27,695 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 07:45:29,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:29,012 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-08 07:45:29,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 07:45:29,012 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 100 [2022-04-08 07:45:29,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:29,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 07:45:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-08 07:45:29,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 07:45:29,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-08 07:45:29,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 76 transitions. [2022-04-08 07:45:29,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:29,069 INFO L225 Difference]: With dead ends: 69 [2022-04-08 07:45:29,069 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 07:45:29,070 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-08 07:45:29,070 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:29,070 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 485 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 07:45:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 07:45:29,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-08 07:45:29,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:29,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 07:45:29,135 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 07:45:29,136 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 07:45:29,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:29,137 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-08 07:45:29,137 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-08 07:45:29,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:29,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:29,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 64 states. [2022-04-08 07:45:29,139 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 64 states. [2022-04-08 07:45:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:29,142 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-08 07:45:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-08 07:45:29,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:29,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:29,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:29,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 07:45:29,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2022-04-08 07:45:29,145 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 100 [2022-04-08 07:45:29,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:29,145 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2022-04-08 07:45:29,145 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 07:45:29,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 75 transitions. [2022-04-08 07:45:29,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:29,255 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-08 07:45:29,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-08 07:45:29,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:29,256 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:29,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-08 07:45:29,461 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 07:45:29,462 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:29,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:29,462 INFO L85 PathProgramCache]: Analyzing trace with hash 893158889, now seen corresponding path program 23 times [2022-04-08 07:45:29,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:29,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2074310031] [2022-04-08 07:45:29,545 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:29,546 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:29,546 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:29,546 INFO L85 PathProgramCache]: Analyzing trace with hash 893158889, now seen corresponding path program 24 times [2022-04-08 07:45:29,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:29,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277981602] [2022-04-08 07:45:29,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:29,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:29,557 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:29,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1601768315] [2022-04-08 07:45:29,557 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:45:29,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:29,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:29,558 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 07:45:29,559 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 07:45:29,767 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 07:45:29,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:29,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-08 07:45:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:29,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:30,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {7070#true} call ULTIMATE.init(); {7070#true} is VALID [2022-04-08 07:45:30,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {7070#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {7070#true} is VALID [2022-04-08 07:45:30,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-08 07:45:30,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7070#true} {7070#true} #60#return; {7070#true} is VALID [2022-04-08 07:45:30,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {7070#true} call #t~ret5 := main(); {7070#true} is VALID [2022-04-08 07:45:30,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {7070#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {7070#true} is VALID [2022-04-08 07:45:30,462 INFO L272 TraceCheckUtils]: 6: Hoare triple {7070#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {7070#true} is VALID [2022-04-08 07:45:30,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-08 07:45:30,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-08 07:45:30,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-08 07:45:30,462 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7070#true} {7070#true} #52#return; {7070#true} is VALID [2022-04-08 07:45:30,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {7070#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7108#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:30,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {7108#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {7108#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:30,463 INFO L272 TraceCheckUtils]: 13: Hoare triple {7108#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7070#true} is VALID [2022-04-08 07:45:30,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-08 07:45:30,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-08 07:45:30,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-08 07:45:30,464 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7070#true} {7108#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {7108#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:30,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {7108#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7130#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:45:30,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {7130#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {7130#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:45:30,465 INFO L272 TraceCheckUtils]: 20: Hoare triple {7130#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7070#true} is VALID [2022-04-08 07:45:30,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-08 07:45:30,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-08 07:45:30,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-08 07:45:30,465 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7070#true} {7130#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {7130#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:45:30,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {7130#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7152#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 07:45:30,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {7152#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {7152#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 07:45:30,466 INFO L272 TraceCheckUtils]: 27: Hoare triple {7152#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7070#true} is VALID [2022-04-08 07:45:30,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-08 07:45:30,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-08 07:45:30,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-08 07:45:30,466 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7070#true} {7152#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #54#return; {7152#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 07:45:30,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {7152#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7174#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 07:45:30,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {7174#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {7174#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 07:45:30,467 INFO L272 TraceCheckUtils]: 34: Hoare triple {7174#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7070#true} is VALID [2022-04-08 07:45:30,467 INFO L290 TraceCheckUtils]: 35: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-08 07:45:30,467 INFO L290 TraceCheckUtils]: 36: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-08 07:45:30,467 INFO L290 TraceCheckUtils]: 37: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-08 07:45:30,468 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7070#true} {7174#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #54#return; {7174#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 07:45:30,468 INFO L290 TraceCheckUtils]: 39: Hoare triple {7174#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7196#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:45:30,469 INFO L290 TraceCheckUtils]: 40: Hoare triple {7196#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {7196#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:45:30,469 INFO L272 TraceCheckUtils]: 41: Hoare triple {7196#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7070#true} is VALID [2022-04-08 07:45:30,469 INFO L290 TraceCheckUtils]: 42: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-08 07:45:30,469 INFO L290 TraceCheckUtils]: 43: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-08 07:45:30,469 INFO L290 TraceCheckUtils]: 44: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-08 07:45:30,469 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7070#true} {7196#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {7196#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:45:30,470 INFO L290 TraceCheckUtils]: 46: Hoare triple {7196#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7218#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:30,470 INFO L290 TraceCheckUtils]: 47: Hoare triple {7218#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {7218#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:30,470 INFO L272 TraceCheckUtils]: 48: Hoare triple {7218#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7070#true} is VALID [2022-04-08 07:45:30,470 INFO L290 TraceCheckUtils]: 49: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-08 07:45:30,470 INFO L290 TraceCheckUtils]: 50: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-08 07:45:30,470 INFO L290 TraceCheckUtils]: 51: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-08 07:45:30,471 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7070#true} {7218#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {7218#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:30,471 INFO L290 TraceCheckUtils]: 53: Hoare triple {7218#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7240#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:30,471 INFO L290 TraceCheckUtils]: 54: Hoare triple {7240#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} assume !false; {7240#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:30,471 INFO L272 TraceCheckUtils]: 55: Hoare triple {7240#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7070#true} is VALID [2022-04-08 07:45:30,471 INFO L290 TraceCheckUtils]: 56: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-08 07:45:30,472 INFO L290 TraceCheckUtils]: 57: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-08 07:45:30,472 INFO L290 TraceCheckUtils]: 58: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-08 07:45:30,472 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7070#true} {7240#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} #54#return; {7240#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:30,472 INFO L290 TraceCheckUtils]: 60: Hoare triple {7240#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7262#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} is VALID [2022-04-08 07:45:30,473 INFO L290 TraceCheckUtils]: 61: Hoare triple {7262#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} assume !false; {7262#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} is VALID [2022-04-08 07:45:30,473 INFO L272 TraceCheckUtils]: 62: Hoare triple {7262#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7070#true} is VALID [2022-04-08 07:45:30,473 INFO L290 TraceCheckUtils]: 63: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-08 07:45:30,473 INFO L290 TraceCheckUtils]: 64: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-08 07:45:30,473 INFO L290 TraceCheckUtils]: 65: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-08 07:45:30,473 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7070#true} {7262#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} #54#return; {7262#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} is VALID [2022-04-08 07:45:30,474 INFO L290 TraceCheckUtils]: 67: Hoare triple {7262#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7284#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 5 main_~k~0))} is VALID [2022-04-08 07:45:30,474 INFO L290 TraceCheckUtils]: 68: Hoare triple {7284#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 5 main_~k~0))} assume !false; {7284#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 5 main_~k~0))} is VALID [2022-04-08 07:45:30,474 INFO L272 TraceCheckUtils]: 69: Hoare triple {7284#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7070#true} is VALID [2022-04-08 07:45:30,474 INFO L290 TraceCheckUtils]: 70: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-08 07:45:30,474 INFO L290 TraceCheckUtils]: 71: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-08 07:45:30,474 INFO L290 TraceCheckUtils]: 72: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-08 07:45:30,475 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7070#true} {7284#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 5 main_~k~0))} #54#return; {7284#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 5 main_~k~0))} is VALID [2022-04-08 07:45:30,475 INFO L290 TraceCheckUtils]: 74: Hoare triple {7284#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 5 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7306#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-08 07:45:30,476 INFO L290 TraceCheckUtils]: 75: Hoare triple {7306#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} assume !false; {7306#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-08 07:45:30,476 INFO L272 TraceCheckUtils]: 76: Hoare triple {7306#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7070#true} is VALID [2022-04-08 07:45:30,476 INFO L290 TraceCheckUtils]: 77: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-08 07:45:30,476 INFO L290 TraceCheckUtils]: 78: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-08 07:45:30,476 INFO L290 TraceCheckUtils]: 79: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-08 07:45:30,476 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7070#true} {7306#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} #54#return; {7306#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-08 07:45:30,477 INFO L290 TraceCheckUtils]: 81: Hoare triple {7306#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7328#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-08 07:45:30,477 INFO L290 TraceCheckUtils]: 82: Hoare triple {7328#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} assume !false; {7328#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-08 07:45:30,477 INFO L272 TraceCheckUtils]: 83: Hoare triple {7328#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7070#true} is VALID [2022-04-08 07:45:30,477 INFO L290 TraceCheckUtils]: 84: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-08 07:45:30,477 INFO L290 TraceCheckUtils]: 85: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-08 07:45:30,477 INFO L290 TraceCheckUtils]: 86: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-08 07:45:30,478 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {7070#true} {7328#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} #54#return; {7328#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-08 07:45:30,478 INFO L290 TraceCheckUtils]: 88: Hoare triple {7328#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7350#(and (= main_~c~0 11) (< 5 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-08 07:45:30,478 INFO L290 TraceCheckUtils]: 89: Hoare triple {7350#(and (= main_~c~0 11) (< 5 main_~k~0) (= main_~y~0 11))} assume !false; {7350#(and (= main_~c~0 11) (< 5 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-08 07:45:30,479 INFO L272 TraceCheckUtils]: 90: Hoare triple {7350#(and (= main_~c~0 11) (< 5 main_~k~0) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7070#true} is VALID [2022-04-08 07:45:30,479 INFO L290 TraceCheckUtils]: 91: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-08 07:45:30,479 INFO L290 TraceCheckUtils]: 92: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-08 07:45:30,479 INFO L290 TraceCheckUtils]: 93: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-08 07:45:30,479 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {7070#true} {7350#(and (= main_~c~0 11) (< 5 main_~k~0) (= main_~y~0 11))} #54#return; {7350#(and (= main_~c~0 11) (< 5 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-08 07:45:30,480 INFO L290 TraceCheckUtils]: 95: Hoare triple {7350#(and (= main_~c~0 11) (< 5 main_~k~0) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7372#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-08 07:45:30,480 INFO L290 TraceCheckUtils]: 96: Hoare triple {7372#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !false; {7372#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-08 07:45:30,480 INFO L272 TraceCheckUtils]: 97: Hoare triple {7372#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7070#true} is VALID [2022-04-08 07:45:30,480 INFO L290 TraceCheckUtils]: 98: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-08 07:45:30,480 INFO L290 TraceCheckUtils]: 99: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-08 07:45:30,480 INFO L290 TraceCheckUtils]: 100: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-08 07:45:30,481 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {7070#true} {7372#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} #54#return; {7372#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-08 07:45:30,481 INFO L290 TraceCheckUtils]: 102: Hoare triple {7372#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !(~c~0 < ~k~0); {7394#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-08 07:45:30,482 INFO L272 TraceCheckUtils]: 103: Hoare triple {7394#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7398#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:30,482 INFO L290 TraceCheckUtils]: 104: Hoare triple {7398#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7402#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:30,482 INFO L290 TraceCheckUtils]: 105: Hoare triple {7402#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7071#false} is VALID [2022-04-08 07:45:30,482 INFO L290 TraceCheckUtils]: 106: Hoare triple {7071#false} assume !false; {7071#false} is VALID [2022-04-08 07:45:30,483 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 26 proven. 234 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 07:45:30,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:31,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:31,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277981602] [2022-04-08 07:45:31,308 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:31,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601768315] [2022-04-08 07:45:31,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601768315] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:31,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:31,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-08 07:45:31,308 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:31,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2074310031] [2022-04-08 07:45:31,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2074310031] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:31,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:31,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 07:45:31,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013242063] [2022-04-08 07:45:31,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:31,309 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 107 [2022-04-08 07:45:31,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:31,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 07:45:31,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:31,358 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 07:45:31,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:31,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 07:45:31,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2022-04-08 07:45:31,359 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 07:45:33,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:33,111 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-04-08 07:45:33,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 07:45:33,111 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 107 [2022-04-08 07:45:33,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:33,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 07:45:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2022-04-08 07:45:33,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 07:45:33,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2022-04-08 07:45:33,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 80 transitions. [2022-04-08 07:45:33,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:33,189 INFO L225 Difference]: With dead ends: 72 [2022-04-08 07:45:33,190 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 07:45:33,190 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2022-04-08 07:45:33,190 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:33,191 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 527 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 07:45:33,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 07:45:33,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-08 07:45:33,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:33,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 07:45:33,260 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 07:45:33,260 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 07:45:33,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:33,262 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-08 07:45:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-08 07:45:33,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:33,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:33,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-08 07:45:33,263 INFO L87 Difference]: Start difference. First operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-08 07:45:33,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:33,264 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-08 07:45:33,264 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-08 07:45:33,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:33,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:33,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:33,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:33,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 07:45:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-04-08 07:45:33,266 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 107 [2022-04-08 07:45:33,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:33,267 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-04-08 07:45:33,267 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 07:45:33,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 79 transitions. [2022-04-08 07:45:33,404 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 07:45:33,405 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-08 07:45:33,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-08 07:45:33,405 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:33,405 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:33,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 07:45:33,606 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 07:45:33,606 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:33,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:33,606 INFO L85 PathProgramCache]: Analyzing trace with hash 363946760, now seen corresponding path program 25 times [2022-04-08 07:45:33,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:33,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [967433250] [2022-04-08 07:45:33,679 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:33,679 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:33,679 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:33,680 INFO L85 PathProgramCache]: Analyzing trace with hash 363946760, now seen corresponding path program 26 times [2022-04-08 07:45:33,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:33,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031678649] [2022-04-08 07:45:33,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:33,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:33,694 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:33,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1436605523] [2022-04-08 07:45:33,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:45:33,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:33,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:33,695 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 07:45:33,698 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 07:45:34,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:45:34,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:34,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-08 07:45:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:34,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:35,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {7998#true} call ULTIMATE.init(); {7998#true} is VALID [2022-04-08 07:45:35,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {7998#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {7998#true} is VALID [2022-04-08 07:45:35,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-08 07:45:35,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7998#true} {7998#true} #60#return; {7998#true} is VALID [2022-04-08 07:45:35,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {7998#true} call #t~ret5 := main(); {7998#true} is VALID [2022-04-08 07:45:35,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {7998#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {7998#true} is VALID [2022-04-08 07:45:35,095 INFO L272 TraceCheckUtils]: 6: Hoare triple {7998#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {7998#true} is VALID [2022-04-08 07:45:35,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-08 07:45:35,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-08 07:45:35,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-08 07:45:35,096 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7998#true} {7998#true} #52#return; {7998#true} is VALID [2022-04-08 07:45:35,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {7998#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8036#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:35,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {8036#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {8036#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:35,096 INFO L272 TraceCheckUtils]: 13: Hoare triple {8036#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7998#true} is VALID [2022-04-08 07:45:35,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-08 07:45:35,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-08 07:45:35,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-08 07:45:35,097 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7998#true} {8036#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {8036#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:35,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {8036#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8058#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:35,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {8058#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {8058#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:35,098 INFO L272 TraceCheckUtils]: 20: Hoare triple {8058#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7998#true} is VALID [2022-04-08 07:45:35,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-08 07:45:35,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-08 07:45:35,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-08 07:45:35,098 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7998#true} {8058#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {8058#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:35,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {8058#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8080#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:35,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {8080#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {8080#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:35,099 INFO L272 TraceCheckUtils]: 27: Hoare triple {8080#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7998#true} is VALID [2022-04-08 07:45:35,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-08 07:45:35,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-08 07:45:35,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-08 07:45:35,100 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7998#true} {8080#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {8080#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:35,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {8080#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8102#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:45:35,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {8102#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {8102#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:45:35,101 INFO L272 TraceCheckUtils]: 34: Hoare triple {8102#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7998#true} is VALID [2022-04-08 07:45:35,101 INFO L290 TraceCheckUtils]: 35: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-08 07:45:35,101 INFO L290 TraceCheckUtils]: 36: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-08 07:45:35,101 INFO L290 TraceCheckUtils]: 37: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-08 07:45:35,101 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7998#true} {8102#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {8102#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:45:35,102 INFO L290 TraceCheckUtils]: 39: Hoare triple {8102#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8124#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:45:35,102 INFO L290 TraceCheckUtils]: 40: Hoare triple {8124#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {8124#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:45:35,102 INFO L272 TraceCheckUtils]: 41: Hoare triple {8124#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7998#true} is VALID [2022-04-08 07:45:35,102 INFO L290 TraceCheckUtils]: 42: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-08 07:45:35,102 INFO L290 TraceCheckUtils]: 43: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-08 07:45:35,102 INFO L290 TraceCheckUtils]: 44: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-08 07:45:35,103 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7998#true} {8124#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {8124#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:45:35,103 INFO L290 TraceCheckUtils]: 46: Hoare triple {8124#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8146#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:45:35,104 INFO L290 TraceCheckUtils]: 47: Hoare triple {8146#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !false; {8146#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:45:35,104 INFO L272 TraceCheckUtils]: 48: Hoare triple {8146#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7998#true} is VALID [2022-04-08 07:45:35,104 INFO L290 TraceCheckUtils]: 49: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-08 07:45:35,104 INFO L290 TraceCheckUtils]: 50: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-08 07:45:35,104 INFO L290 TraceCheckUtils]: 51: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-08 07:45:35,104 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7998#true} {8146#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #54#return; {8146#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:45:35,105 INFO L290 TraceCheckUtils]: 53: Hoare triple {8146#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:35,105 INFO L290 TraceCheckUtils]: 54: Hoare triple {8168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {8168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:35,105 INFO L272 TraceCheckUtils]: 55: Hoare triple {8168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7998#true} is VALID [2022-04-08 07:45:35,105 INFO L290 TraceCheckUtils]: 56: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-08 07:45:35,105 INFO L290 TraceCheckUtils]: 57: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-08 07:45:35,105 INFO L290 TraceCheckUtils]: 58: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-08 07:45:35,106 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7998#true} {8168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #54#return; {8168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:35,106 INFO L290 TraceCheckUtils]: 60: Hoare triple {8168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-08 07:45:35,107 INFO L290 TraceCheckUtils]: 61: Hoare triple {8190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} assume !false; {8190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-08 07:45:35,107 INFO L272 TraceCheckUtils]: 62: Hoare triple {8190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7998#true} is VALID [2022-04-08 07:45:35,107 INFO L290 TraceCheckUtils]: 63: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-08 07:45:35,107 INFO L290 TraceCheckUtils]: 64: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-08 07:45:35,107 INFO L290 TraceCheckUtils]: 65: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-08 07:45:35,107 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7998#true} {8190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} #54#return; {8190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-08 07:45:35,108 INFO L290 TraceCheckUtils]: 67: Hoare triple {8190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8212#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:45:35,108 INFO L290 TraceCheckUtils]: 68: Hoare triple {8212#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {8212#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:45:35,108 INFO L272 TraceCheckUtils]: 69: Hoare triple {8212#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7998#true} is VALID [2022-04-08 07:45:35,108 INFO L290 TraceCheckUtils]: 70: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-08 07:45:35,108 INFO L290 TraceCheckUtils]: 71: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-08 07:45:35,108 INFO L290 TraceCheckUtils]: 72: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-08 07:45:35,109 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7998#true} {8212#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {8212#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:45:35,109 INFO L290 TraceCheckUtils]: 74: Hoare triple {8212#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8234#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:45:35,109 INFO L290 TraceCheckUtils]: 75: Hoare triple {8234#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {8234#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:45:35,109 INFO L272 TraceCheckUtils]: 76: Hoare triple {8234#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7998#true} is VALID [2022-04-08 07:45:35,109 INFO L290 TraceCheckUtils]: 77: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-08 07:45:35,109 INFO L290 TraceCheckUtils]: 78: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-08 07:45:35,110 INFO L290 TraceCheckUtils]: 79: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-08 07:45:35,110 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7998#true} {8234#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {8234#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:45:35,110 INFO L290 TraceCheckUtils]: 81: Hoare triple {8234#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:45:35,111 INFO L290 TraceCheckUtils]: 82: Hoare triple {8256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !false; {8256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:45:35,111 INFO L272 TraceCheckUtils]: 83: Hoare triple {8256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7998#true} is VALID [2022-04-08 07:45:35,111 INFO L290 TraceCheckUtils]: 84: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-08 07:45:35,111 INFO L290 TraceCheckUtils]: 85: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-08 07:45:35,111 INFO L290 TraceCheckUtils]: 86: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-08 07:45:35,115 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {7998#true} {8256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} #54#return; {8256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:45:35,116 INFO L290 TraceCheckUtils]: 88: Hoare triple {8256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8278#(and (= (+ (- 2) main_~y~0) 9) (= 9 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:35,116 INFO L290 TraceCheckUtils]: 89: Hoare triple {8278#(and (= (+ (- 2) main_~y~0) 9) (= 9 (+ (- 2) main_~c~0)))} assume !false; {8278#(and (= (+ (- 2) main_~y~0) 9) (= 9 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:35,116 INFO L272 TraceCheckUtils]: 90: Hoare triple {8278#(and (= (+ (- 2) main_~y~0) 9) (= 9 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7998#true} is VALID [2022-04-08 07:45:35,116 INFO L290 TraceCheckUtils]: 91: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-08 07:45:35,117 INFO L290 TraceCheckUtils]: 92: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-08 07:45:35,117 INFO L290 TraceCheckUtils]: 93: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-08 07:45:35,117 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {7998#true} {8278#(and (= (+ (- 2) main_~y~0) 9) (= 9 (+ (- 2) main_~c~0)))} #54#return; {8278#(and (= (+ (- 2) main_~y~0) 9) (= 9 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:35,118 INFO L290 TraceCheckUtils]: 95: Hoare triple {8278#(and (= (+ (- 2) main_~y~0) 9) (= 9 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8300#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 07:45:35,118 INFO L290 TraceCheckUtils]: 96: Hoare triple {8300#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} assume !false; {8300#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 07:45:35,118 INFO L272 TraceCheckUtils]: 97: Hoare triple {8300#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7998#true} is VALID [2022-04-08 07:45:35,118 INFO L290 TraceCheckUtils]: 98: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-08 07:45:35,118 INFO L290 TraceCheckUtils]: 99: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-08 07:45:35,118 INFO L290 TraceCheckUtils]: 100: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-08 07:45:35,119 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {7998#true} {8300#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} #54#return; {8300#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 07:45:35,120 INFO L290 TraceCheckUtils]: 102: Hoare triple {8300#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8322#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:45:35,120 INFO L290 TraceCheckUtils]: 103: Hoare triple {8322#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !false; {8322#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:45:35,120 INFO L272 TraceCheckUtils]: 104: Hoare triple {8322#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7998#true} is VALID [2022-04-08 07:45:35,120 INFO L290 TraceCheckUtils]: 105: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-08 07:45:35,120 INFO L290 TraceCheckUtils]: 106: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-08 07:45:35,120 INFO L290 TraceCheckUtils]: 107: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-08 07:45:35,121 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {7998#true} {8322#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} #54#return; {8322#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:45:35,122 INFO L290 TraceCheckUtils]: 109: Hoare triple {8322#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !(~c~0 < ~k~0); {8344#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:45:35,122 INFO L272 TraceCheckUtils]: 110: Hoare triple {8344#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8348#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:35,123 INFO L290 TraceCheckUtils]: 111: Hoare triple {8348#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8352#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:35,123 INFO L290 TraceCheckUtils]: 112: Hoare triple {8352#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7999#false} is VALID [2022-04-08 07:45:35,123 INFO L290 TraceCheckUtils]: 113: Hoare triple {7999#false} assume !false; {7999#false} is VALID [2022-04-08 07:45:35,124 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 28 proven. 273 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-08 07:45:35,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:35,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:35,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031678649] [2022-04-08 07:45:35,384 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:35,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436605523] [2022-04-08 07:45:35,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436605523] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:35,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:35,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-08 07:45:35,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:35,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [967433250] [2022-04-08 07:45:35,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [967433250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:35,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:35,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 07:45:35,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691318304] [2022-04-08 07:45:35,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:35,386 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 114 [2022-04-08 07:45:35,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:35,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 07:45:35,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:35,442 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 07:45:35,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:35,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 07:45:35,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-08 07:45:35,443 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 07:45:37,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:37,185 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2022-04-08 07:45:37,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 07:45:37,185 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 114 [2022-04-08 07:45:37,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 07:45:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 84 transitions. [2022-04-08 07:45:37,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 07:45:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 84 transitions. [2022-04-08 07:45:37,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 84 transitions. [2022-04-08 07:45:37,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:37,272 INFO L225 Difference]: With dead ends: 75 [2022-04-08 07:45:37,272 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 07:45:37,272 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2022-04-08 07:45:37,273 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 2 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:37,273 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 583 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 07:45:37,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 07:45:37,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-08 07:45:37,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:37,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 07:45:37,372 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 07:45:37,372 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 07:45:37,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:37,375 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-08 07:45:37,375 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-08 07:45:37,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:37,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:37,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 70 states. [2022-04-08 07:45:37,376 INFO L87 Difference]: Start difference. First operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 70 states. [2022-04-08 07:45:37,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:37,378 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-08 07:45:37,378 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-08 07:45:37,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:37,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:37,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:37,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:37,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 07:45:37,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2022-04-08 07:45:37,382 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 114 [2022-04-08 07:45:37,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:37,382 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2022-04-08 07:45:37,382 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 07:45:37,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 83 transitions. [2022-04-08 07:45:37,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:37,485 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-08 07:45:37,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-08 07:45:37,487 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:37,487 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:37,495 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 07:45:37,693 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 07:45:37,693 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:37,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:37,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2101455607, now seen corresponding path program 27 times [2022-04-08 07:45:37,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:37,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [790921949] [2022-04-08 07:45:37,786 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:37,787 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:37,787 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:37,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2101455607, now seen corresponding path program 28 times [2022-04-08 07:45:37,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:37,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560784029] [2022-04-08 07:45:37,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:37,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:37,813 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:37,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [368238579] [2022-04-08 07:45:37,814 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:45:37,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:37,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:37,815 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 07:45:37,839 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 07:45:38,791 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:45:38,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:38,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-08 07:45:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:38,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:39,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {8834#true} call ULTIMATE.init(); {8834#true} is VALID [2022-04-08 07:45:39,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {8834#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {8834#true} is VALID [2022-04-08 07:45:39,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-08 07:45:39,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8834#true} {8834#true} #60#return; {8834#true} is VALID [2022-04-08 07:45:39,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {8834#true} call #t~ret5 := main(); {8834#true} is VALID [2022-04-08 07:45:39,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {8834#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {8834#true} is VALID [2022-04-08 07:45:39,437 INFO L272 TraceCheckUtils]: 6: Hoare triple {8834#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {8834#true} is VALID [2022-04-08 07:45:39,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-08 07:45:39,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-08 07:45:39,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-08 07:45:39,438 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8834#true} {8834#true} #52#return; {8834#true} is VALID [2022-04-08 07:45:39,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {8834#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8872#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:39,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {8872#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {8872#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:39,438 INFO L272 TraceCheckUtils]: 13: Hoare triple {8872#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8834#true} is VALID [2022-04-08 07:45:39,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-08 07:45:39,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-08 07:45:39,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-08 07:45:39,439 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8834#true} {8872#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {8872#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:39,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {8872#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8894#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:45:39,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {8894#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {8894#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:45:39,440 INFO L272 TraceCheckUtils]: 20: Hoare triple {8894#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8834#true} is VALID [2022-04-08 07:45:39,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-08 07:45:39,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-08 07:45:39,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-08 07:45:39,441 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8834#true} {8894#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {8894#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:45:39,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {8894#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8916#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:39,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {8916#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {8916#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:39,442 INFO L272 TraceCheckUtils]: 27: Hoare triple {8916#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8834#true} is VALID [2022-04-08 07:45:39,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-08 07:45:39,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-08 07:45:39,442 INFO L290 TraceCheckUtils]: 30: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-08 07:45:39,443 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8834#true} {8916#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #54#return; {8916#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:39,443 INFO L290 TraceCheckUtils]: 32: Hoare triple {8916#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8938#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 07:45:39,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {8938#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} assume !false; {8938#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 07:45:39,444 INFO L272 TraceCheckUtils]: 34: Hoare triple {8938#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8834#true} is VALID [2022-04-08 07:45:39,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-08 07:45:39,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-08 07:45:39,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-08 07:45:39,445 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8834#true} {8938#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} #54#return; {8938#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 07:45:39,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {8938#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8960#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:45:39,446 INFO L290 TraceCheckUtils]: 40: Hoare triple {8960#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {8960#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:45:39,446 INFO L272 TraceCheckUtils]: 41: Hoare triple {8960#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8834#true} is VALID [2022-04-08 07:45:39,446 INFO L290 TraceCheckUtils]: 42: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-08 07:45:39,446 INFO L290 TraceCheckUtils]: 43: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-08 07:45:39,446 INFO L290 TraceCheckUtils]: 44: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-08 07:45:39,447 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8834#true} {8960#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {8960#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:45:39,447 INFO L290 TraceCheckUtils]: 46: Hoare triple {8960#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8982#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:39,448 INFO L290 TraceCheckUtils]: 47: Hoare triple {8982#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {8982#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:39,448 INFO L272 TraceCheckUtils]: 48: Hoare triple {8982#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8834#true} is VALID [2022-04-08 07:45:39,448 INFO L290 TraceCheckUtils]: 49: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-08 07:45:39,448 INFO L290 TraceCheckUtils]: 50: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-08 07:45:39,448 INFO L290 TraceCheckUtils]: 51: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-08 07:45:39,449 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8834#true} {8982#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {8982#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:39,449 INFO L290 TraceCheckUtils]: 53: Hoare triple {8982#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9004#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:39,450 INFO L290 TraceCheckUtils]: 54: Hoare triple {9004#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {9004#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:39,450 INFO L272 TraceCheckUtils]: 55: Hoare triple {9004#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8834#true} is VALID [2022-04-08 07:45:39,450 INFO L290 TraceCheckUtils]: 56: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-08 07:45:39,450 INFO L290 TraceCheckUtils]: 57: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-08 07:45:39,450 INFO L290 TraceCheckUtils]: 58: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-08 07:45:39,450 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8834#true} {9004#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {9004#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:39,451 INFO L290 TraceCheckUtils]: 60: Hoare triple {9004#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9026#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:45:39,451 INFO L290 TraceCheckUtils]: 61: Hoare triple {9026#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {9026#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:45:39,452 INFO L272 TraceCheckUtils]: 62: Hoare triple {9026#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8834#true} is VALID [2022-04-08 07:45:39,452 INFO L290 TraceCheckUtils]: 63: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-08 07:45:39,452 INFO L290 TraceCheckUtils]: 64: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-08 07:45:39,452 INFO L290 TraceCheckUtils]: 65: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-08 07:45:39,453 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8834#true} {9026#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {9026#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:45:39,453 INFO L290 TraceCheckUtils]: 67: Hoare triple {9026#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9048#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:39,454 INFO L290 TraceCheckUtils]: 68: Hoare triple {9048#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !false; {9048#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:39,454 INFO L272 TraceCheckUtils]: 69: Hoare triple {9048#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8834#true} is VALID [2022-04-08 07:45:39,454 INFO L290 TraceCheckUtils]: 70: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-08 07:45:39,454 INFO L290 TraceCheckUtils]: 71: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-08 07:45:39,454 INFO L290 TraceCheckUtils]: 72: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-08 07:45:39,454 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8834#true} {9048#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} #54#return; {9048#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:39,455 INFO L290 TraceCheckUtils]: 74: Hoare triple {9048#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9070#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-08 07:45:39,455 INFO L290 TraceCheckUtils]: 75: Hoare triple {9070#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} assume !false; {9070#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-08 07:45:39,455 INFO L272 TraceCheckUtils]: 76: Hoare triple {9070#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8834#true} is VALID [2022-04-08 07:45:39,455 INFO L290 TraceCheckUtils]: 77: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-08 07:45:39,456 INFO L290 TraceCheckUtils]: 78: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-08 07:45:39,456 INFO L290 TraceCheckUtils]: 79: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-08 07:45:39,456 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {8834#true} {9070#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} #54#return; {9070#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-08 07:45:39,456 INFO L290 TraceCheckUtils]: 81: Hoare triple {9070#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9092#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:45:39,457 INFO L290 TraceCheckUtils]: 82: Hoare triple {9092#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {9092#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:45:39,457 INFO L272 TraceCheckUtils]: 83: Hoare triple {9092#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8834#true} is VALID [2022-04-08 07:45:39,457 INFO L290 TraceCheckUtils]: 84: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-08 07:45:39,457 INFO L290 TraceCheckUtils]: 85: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-08 07:45:39,457 INFO L290 TraceCheckUtils]: 86: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-08 07:45:39,457 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {8834#true} {9092#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {9092#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:45:39,458 INFO L290 TraceCheckUtils]: 88: Hoare triple {9092#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9114#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:45:39,458 INFO L290 TraceCheckUtils]: 89: Hoare triple {9114#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {9114#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:45:39,458 INFO L272 TraceCheckUtils]: 90: Hoare triple {9114#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8834#true} is VALID [2022-04-08 07:45:39,458 INFO L290 TraceCheckUtils]: 91: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-08 07:45:39,458 INFO L290 TraceCheckUtils]: 92: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-08 07:45:39,458 INFO L290 TraceCheckUtils]: 93: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-08 07:45:39,459 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {8834#true} {9114#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {9114#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:45:39,459 INFO L290 TraceCheckUtils]: 95: Hoare triple {9114#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9136#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:45:39,459 INFO L290 TraceCheckUtils]: 96: Hoare triple {9136#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {9136#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:45:39,460 INFO L272 TraceCheckUtils]: 97: Hoare triple {9136#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8834#true} is VALID [2022-04-08 07:45:39,460 INFO L290 TraceCheckUtils]: 98: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-08 07:45:39,460 INFO L290 TraceCheckUtils]: 99: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-08 07:45:39,460 INFO L290 TraceCheckUtils]: 100: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-08 07:45:39,460 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {8834#true} {9136#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #54#return; {9136#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:45:39,461 INFO L290 TraceCheckUtils]: 102: Hoare triple {9136#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9158#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:39,461 INFO L290 TraceCheckUtils]: 103: Hoare triple {9158#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} assume !false; {9158#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:39,461 INFO L272 TraceCheckUtils]: 104: Hoare triple {9158#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8834#true} is VALID [2022-04-08 07:45:39,461 INFO L290 TraceCheckUtils]: 105: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-08 07:45:39,461 INFO L290 TraceCheckUtils]: 106: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-08 07:45:39,461 INFO L290 TraceCheckUtils]: 107: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-08 07:45:39,462 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {8834#true} {9158#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} #54#return; {9158#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:39,462 INFO L290 TraceCheckUtils]: 109: Hoare triple {9158#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9180#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-08 07:45:39,462 INFO L290 TraceCheckUtils]: 110: Hoare triple {9180#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !false; {9180#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-08 07:45:39,462 INFO L272 TraceCheckUtils]: 111: Hoare triple {9180#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8834#true} is VALID [2022-04-08 07:45:39,462 INFO L290 TraceCheckUtils]: 112: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-08 07:45:39,462 INFO L290 TraceCheckUtils]: 113: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-08 07:45:39,463 INFO L290 TraceCheckUtils]: 114: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-08 07:45:39,463 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {8834#true} {9180#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} #54#return; {9180#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-08 07:45:39,464 INFO L290 TraceCheckUtils]: 116: Hoare triple {9180#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !(~c~0 < ~k~0); {9202#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-08 07:45:39,464 INFO L272 TraceCheckUtils]: 117: Hoare triple {9202#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~k~0 14))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9206#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:39,465 INFO L290 TraceCheckUtils]: 118: Hoare triple {9206#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9210#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:39,465 INFO L290 TraceCheckUtils]: 119: Hoare triple {9210#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8835#false} is VALID [2022-04-08 07:45:39,465 INFO L290 TraceCheckUtils]: 120: Hoare triple {8835#false} assume !false; {8835#false} is VALID [2022-04-08 07:45:39,466 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 30 proven. 315 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-08 07:45:39,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:39,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:39,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560784029] [2022-04-08 07:45:39,762 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:39,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368238579] [2022-04-08 07:45:39,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368238579] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:39,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:39,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-08 07:45:39,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:39,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [790921949] [2022-04-08 07:45:39,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [790921949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:39,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:39,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 07:45:39,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819997038] [2022-04-08 07:45:39,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:39,763 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) Word has length 121 [2022-04-08 07:45:39,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:39,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 07:45:39,821 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 07:45:39,821 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 07:45:39,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:39,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 07:45:39,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-08 07:45:39,822 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 07:45:41,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:41,801 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2022-04-08 07:45:41,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 07:45:41,802 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) Word has length 121 [2022-04-08 07:45:41,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:41,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 07:45:41,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 88 transitions. [2022-04-08 07:45:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 07:45:41,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 88 transitions. [2022-04-08 07:45:41,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 88 transitions. [2022-04-08 07:45:41,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:41,886 INFO L225 Difference]: With dead ends: 78 [2022-04-08 07:45:41,886 INFO L226 Difference]: Without dead ends: 73 [2022-04-08 07:45:41,887 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-04-08 07:45:41,887 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:41,887 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 635 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 07:45:41,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-08 07:45:41,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-08 07:45:41,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:41,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 07:45:41,949 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 07:45:41,949 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 07:45:41,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:41,951 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-08 07:45:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-08 07:45:41,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:41,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:41,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-08 07:45:41,952 INFO L87 Difference]: Start difference. First operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-08 07:45:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:41,954 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-08 07:45:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-08 07:45:41,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:41,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:41,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:41,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 07:45:41,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2022-04-08 07:45:41,956 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 121 [2022-04-08 07:45:41,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:41,956 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2022-04-08 07:45:41,957 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 07:45:41,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 87 transitions. [2022-04-08 07:45:42,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:42,092 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-08 07:45:42,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-08 07:45:42,093 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:42,093 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:42,098 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 07:45:42,293 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 07:45:42,293 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:42,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:42,294 INFO L85 PathProgramCache]: Analyzing trace with hash -729919512, now seen corresponding path program 29 times [2022-04-08 07:45:42,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:42,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2094990095] [2022-04-08 07:45:42,364 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:42,365 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:42,365 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:42,365 INFO L85 PathProgramCache]: Analyzing trace with hash -729919512, now seen corresponding path program 30 times [2022-04-08 07:45:42,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:42,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032930891] [2022-04-08 07:45:42,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:42,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:42,377 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:42,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2000127029] [2022-04-08 07:45:42,377 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:45:42,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:42,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:42,378 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 07:45:42,383 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 07:45:42,689 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-08 07:45:42,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:42,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-08 07:45:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:42,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:43,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {9710#true} call ULTIMATE.init(); {9710#true} is VALID [2022-04-08 07:45:43,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {9710#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {9710#true} is VALID [2022-04-08 07:45:43,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-08 07:45:43,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9710#true} {9710#true} #60#return; {9710#true} is VALID [2022-04-08 07:45:43,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {9710#true} call #t~ret5 := main(); {9710#true} is VALID [2022-04-08 07:45:43,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {9710#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {9710#true} is VALID [2022-04-08 07:45:43,395 INFO L272 TraceCheckUtils]: 6: Hoare triple {9710#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {9710#true} is VALID [2022-04-08 07:45:43,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-08 07:45:43,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-08 07:45:43,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-08 07:45:43,395 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9710#true} {9710#true} #52#return; {9710#true} is VALID [2022-04-08 07:45:43,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {9710#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9748#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:43,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {9748#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {9748#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:43,396 INFO L272 TraceCheckUtils]: 13: Hoare triple {9748#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9710#true} is VALID [2022-04-08 07:45:43,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-08 07:45:43,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-08 07:45:43,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-08 07:45:43,396 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9710#true} {9748#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {9748#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:43,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {9748#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9770#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:45:43,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {9770#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {9770#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:45:43,397 INFO L272 TraceCheckUtils]: 20: Hoare triple {9770#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9710#true} is VALID [2022-04-08 07:45:43,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-08 07:45:43,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-08 07:45:43,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-08 07:45:43,398 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9710#true} {9770#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {9770#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:45:43,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {9770#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9792#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:43,399 INFO L290 TraceCheckUtils]: 26: Hoare triple {9792#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {9792#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:43,399 INFO L272 TraceCheckUtils]: 27: Hoare triple {9792#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9710#true} is VALID [2022-04-08 07:45:43,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-08 07:45:43,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-08 07:45:43,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-08 07:45:43,399 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9710#true} {9792#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #54#return; {9792#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:43,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {9792#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9814#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 07:45:43,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {9814#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} assume !false; {9814#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 07:45:43,400 INFO L272 TraceCheckUtils]: 34: Hoare triple {9814#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9710#true} is VALID [2022-04-08 07:45:43,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-08 07:45:43,400 INFO L290 TraceCheckUtils]: 36: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-08 07:45:43,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-08 07:45:43,401 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9710#true} {9814#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} #54#return; {9814#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 07:45:43,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {9814#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9836#(and (= (+ main_~y~0 (- 4)) 0) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:45:43,401 INFO L290 TraceCheckUtils]: 40: Hoare triple {9836#(and (= (+ main_~y~0 (- 4)) 0) (= (+ main_~c~0 (- 4)) 0))} assume !false; {9836#(and (= (+ main_~y~0 (- 4)) 0) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:45:43,401 INFO L272 TraceCheckUtils]: 41: Hoare triple {9836#(and (= (+ main_~y~0 (- 4)) 0) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9710#true} is VALID [2022-04-08 07:45:43,401 INFO L290 TraceCheckUtils]: 42: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-08 07:45:43,402 INFO L290 TraceCheckUtils]: 43: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-08 07:45:43,402 INFO L290 TraceCheckUtils]: 44: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-08 07:45:43,402 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9710#true} {9836#(and (= (+ main_~y~0 (- 4)) 0) (= (+ main_~c~0 (- 4)) 0))} #54#return; {9836#(and (= (+ main_~y~0 (- 4)) 0) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:45:43,402 INFO L290 TraceCheckUtils]: 46: Hoare triple {9836#(and (= (+ main_~y~0 (- 4)) 0) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9858#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} is VALID [2022-04-08 07:45:43,403 INFO L290 TraceCheckUtils]: 47: Hoare triple {9858#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} assume !false; {9858#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} is VALID [2022-04-08 07:45:43,403 INFO L272 TraceCheckUtils]: 48: Hoare triple {9858#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9710#true} is VALID [2022-04-08 07:45:43,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-08 07:45:43,403 INFO L290 TraceCheckUtils]: 50: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-08 07:45:43,403 INFO L290 TraceCheckUtils]: 51: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-08 07:45:43,403 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9710#true} {9858#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} #54#return; {9858#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} is VALID [2022-04-08 07:45:43,405 INFO L290 TraceCheckUtils]: 53: Hoare triple {9858#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9880#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:45:43,405 INFO L290 TraceCheckUtils]: 54: Hoare triple {9880#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {9880#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:45:43,405 INFO L272 TraceCheckUtils]: 55: Hoare triple {9880#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9710#true} is VALID [2022-04-08 07:45:43,405 INFO L290 TraceCheckUtils]: 56: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-08 07:45:43,405 INFO L290 TraceCheckUtils]: 57: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-08 07:45:43,405 INFO L290 TraceCheckUtils]: 58: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-08 07:45:43,406 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9710#true} {9880#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {9880#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:45:43,406 INFO L290 TraceCheckUtils]: 60: Hoare triple {9880#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9902#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:43,407 INFO L290 TraceCheckUtils]: 61: Hoare triple {9902#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {9902#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:43,407 INFO L272 TraceCheckUtils]: 62: Hoare triple {9902#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9710#true} is VALID [2022-04-08 07:45:43,407 INFO L290 TraceCheckUtils]: 63: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-08 07:45:43,407 INFO L290 TraceCheckUtils]: 64: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-08 07:45:43,407 INFO L290 TraceCheckUtils]: 65: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-08 07:45:43,407 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9710#true} {9902#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {9902#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:43,408 INFO L290 TraceCheckUtils]: 67: Hoare triple {9902#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9924#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:45:43,408 INFO L290 TraceCheckUtils]: 68: Hoare triple {9924#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {9924#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:45:43,408 INFO L272 TraceCheckUtils]: 69: Hoare triple {9924#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9710#true} is VALID [2022-04-08 07:45:43,408 INFO L290 TraceCheckUtils]: 70: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-08 07:45:43,408 INFO L290 TraceCheckUtils]: 71: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-08 07:45:43,408 INFO L290 TraceCheckUtils]: 72: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-08 07:45:43,409 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9710#true} {9924#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #54#return; {9924#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:45:43,409 INFO L290 TraceCheckUtils]: 74: Hoare triple {9924#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9946#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:45:43,409 INFO L290 TraceCheckUtils]: 75: Hoare triple {9946#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {9946#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:45:43,409 INFO L272 TraceCheckUtils]: 76: Hoare triple {9946#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9710#true} is VALID [2022-04-08 07:45:43,409 INFO L290 TraceCheckUtils]: 77: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-08 07:45:43,409 INFO L290 TraceCheckUtils]: 78: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-08 07:45:43,410 INFO L290 TraceCheckUtils]: 79: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-08 07:45:43,410 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9710#true} {9946#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {9946#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:45:43,410 INFO L290 TraceCheckUtils]: 81: Hoare triple {9946#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9968#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:45:43,411 INFO L290 TraceCheckUtils]: 82: Hoare triple {9968#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {9968#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:45:43,411 INFO L272 TraceCheckUtils]: 83: Hoare triple {9968#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9710#true} is VALID [2022-04-08 07:45:43,411 INFO L290 TraceCheckUtils]: 84: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-08 07:45:43,411 INFO L290 TraceCheckUtils]: 85: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-08 07:45:43,411 INFO L290 TraceCheckUtils]: 86: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-08 07:45:43,411 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {9710#true} {9968#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {9968#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:45:43,412 INFO L290 TraceCheckUtils]: 88: Hoare triple {9968#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9990#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 07:45:43,412 INFO L290 TraceCheckUtils]: 89: Hoare triple {9990#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} assume !false; {9990#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 07:45:43,412 INFO L272 TraceCheckUtils]: 90: Hoare triple {9990#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9710#true} is VALID [2022-04-08 07:45:43,412 INFO L290 TraceCheckUtils]: 91: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-08 07:45:43,412 INFO L290 TraceCheckUtils]: 92: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-08 07:45:43,412 INFO L290 TraceCheckUtils]: 93: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-08 07:45:43,413 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {9710#true} {9990#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} #54#return; {9990#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 07:45:43,413 INFO L290 TraceCheckUtils]: 95: Hoare triple {9990#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10012#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-08 07:45:43,413 INFO L290 TraceCheckUtils]: 96: Hoare triple {10012#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} assume !false; {10012#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-08 07:45:43,413 INFO L272 TraceCheckUtils]: 97: Hoare triple {10012#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9710#true} is VALID [2022-04-08 07:45:43,414 INFO L290 TraceCheckUtils]: 98: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-08 07:45:43,414 INFO L290 TraceCheckUtils]: 99: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-08 07:45:43,414 INFO L290 TraceCheckUtils]: 100: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-08 07:45:43,414 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {9710#true} {10012#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} #54#return; {10012#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-08 07:45:43,414 INFO L290 TraceCheckUtils]: 102: Hoare triple {10012#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10034#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} is VALID [2022-04-08 07:45:43,415 INFO L290 TraceCheckUtils]: 103: Hoare triple {10034#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} assume !false; {10034#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} is VALID [2022-04-08 07:45:43,415 INFO L272 TraceCheckUtils]: 104: Hoare triple {10034#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9710#true} is VALID [2022-04-08 07:45:43,415 INFO L290 TraceCheckUtils]: 105: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-08 07:45:43,415 INFO L290 TraceCheckUtils]: 106: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-08 07:45:43,415 INFO L290 TraceCheckUtils]: 107: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-08 07:45:43,415 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {9710#true} {10034#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} #54#return; {10034#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} is VALID [2022-04-08 07:45:43,416 INFO L290 TraceCheckUtils]: 109: Hoare triple {10034#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10056#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14))} is VALID [2022-04-08 07:45:43,416 INFO L290 TraceCheckUtils]: 110: Hoare triple {10056#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14))} assume !false; {10056#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14))} is VALID [2022-04-08 07:45:43,416 INFO L272 TraceCheckUtils]: 111: Hoare triple {10056#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9710#true} is VALID [2022-04-08 07:45:43,416 INFO L290 TraceCheckUtils]: 112: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-08 07:45:43,416 INFO L290 TraceCheckUtils]: 113: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-08 07:45:43,416 INFO L290 TraceCheckUtils]: 114: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-08 07:45:43,417 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {9710#true} {10056#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14))} #54#return; {10056#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14))} is VALID [2022-04-08 07:45:43,417 INFO L290 TraceCheckUtils]: 116: Hoare triple {10056#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10078#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-08 07:45:43,418 INFO L290 TraceCheckUtils]: 117: Hoare triple {10078#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15))} assume !false; {10078#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-08 07:45:43,418 INFO L272 TraceCheckUtils]: 118: Hoare triple {10078#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9710#true} is VALID [2022-04-08 07:45:43,418 INFO L290 TraceCheckUtils]: 119: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-08 07:45:43,418 INFO L290 TraceCheckUtils]: 120: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-08 07:45:43,418 INFO L290 TraceCheckUtils]: 121: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-08 07:45:43,418 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {9710#true} {10078#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15))} #54#return; {10078#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-08 07:45:43,419 INFO L290 TraceCheckUtils]: 123: Hoare triple {10078#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15))} assume !(~c~0 < ~k~0); {10100#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-08 07:45:43,419 INFO L272 TraceCheckUtils]: 124: Hoare triple {10100#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~k~0 15))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10104#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:43,420 INFO L290 TraceCheckUtils]: 125: Hoare triple {10104#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10108#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:43,420 INFO L290 TraceCheckUtils]: 126: Hoare triple {10108#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9711#false} is VALID [2022-04-08 07:45:43,420 INFO L290 TraceCheckUtils]: 127: Hoare triple {9711#false} assume !false; {9711#false} is VALID [2022-04-08 07:45:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 32 proven. 360 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-08 07:45:43,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:43,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:43,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032930891] [2022-04-08 07:45:43,687 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:43,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000127029] [2022-04-08 07:45:43,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000127029] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:43,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:43,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-08 07:45:43,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:43,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2094990095] [2022-04-08 07:45:43,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2094990095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:43,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:43,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 07:45:43,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282849902] [2022-04-08 07:45:43,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:43,689 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) Word has length 128 [2022-04-08 07:45:43,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:43,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 07:45:43,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:43,760 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 07:45:43,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:43,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 07:45:43,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-04-08 07:45:43,761 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 07:45:45,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:45,888 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2022-04-08 07:45:45,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 07:45:45,888 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) Word has length 128 [2022-04-08 07:45:45,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:45,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 07:45:45,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2022-04-08 07:45:45,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 07:45:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2022-04-08 07:45:45,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 92 transitions. [2022-04-08 07:45:45,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:45,969 INFO L225 Difference]: With dead ends: 81 [2022-04-08 07:45:45,969 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 07:45:45,969 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2022-04-08 07:45:45,970 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:45,970 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 689 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 07:45:45,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 07:45:46,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-08 07:45:46,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:46,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 07:45:46,042 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 07:45:46,042 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 07:45:46,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:46,044 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-08 07:45:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-08 07:45:46,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:46,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:46,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 76 states. [2022-04-08 07:45:46,044 INFO L87 Difference]: Start difference. First operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 76 states. [2022-04-08 07:45:46,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:46,046 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-08 07:45:46,046 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-08 07:45:46,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:46,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:46,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:46,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 07:45:46,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2022-04-08 07:45:46,049 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 128 [2022-04-08 07:45:46,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:46,049 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2022-04-08 07:45:46,049 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 07:45:46,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 91 transitions. [2022-04-08 07:45:46,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:46,170 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-08 07:45:46,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-08 07:45:46,170 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:46,170 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:46,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-08 07:45:46,371 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 07:45:46,371 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:46,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:46,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1087843369, now seen corresponding path program 31 times [2022-04-08 07:45:46,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:46,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1158264388] [2022-04-08 07:45:46,449 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:46,449 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:46,450 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:46,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1087843369, now seen corresponding path program 32 times [2022-04-08 07:45:46,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:46,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166867817] [2022-04-08 07:45:46,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:46,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:46,473 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:46,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1934015375] [2022-04-08 07:45:46,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:45:46,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:46,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:46,474 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 07:45:46,481 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 07:45:47,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:45:47,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:47,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-08 07:45:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:47,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:48,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {10626#true} call ULTIMATE.init(); {10626#true} is VALID [2022-04-08 07:45:48,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {10626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {10626#true} is VALID [2022-04-08 07:45:48,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 07:45:48,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10626#true} {10626#true} #60#return; {10626#true} is VALID [2022-04-08 07:45:48,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {10626#true} call #t~ret5 := main(); {10626#true} is VALID [2022-04-08 07:45:48,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {10626#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {10626#true} is VALID [2022-04-08 07:45:48,057 INFO L272 TraceCheckUtils]: 6: Hoare triple {10626#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {10626#true} is VALID [2022-04-08 07:45:48,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-08 07:45:48,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-08 07:45:48,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 07:45:48,057 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10626#true} {10626#true} #52#return; {10626#true} is VALID [2022-04-08 07:45:48,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {10626#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10664#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:48,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {10664#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {10664#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:48,058 INFO L272 TraceCheckUtils]: 13: Hoare triple {10664#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-08 07:45:48,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-08 07:45:48,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-08 07:45:48,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 07:45:48,059 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10626#true} {10664#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {10664#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:48,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {10664#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10686#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 07:45:48,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {10686#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {10686#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 07:45:48,060 INFO L272 TraceCheckUtils]: 20: Hoare triple {10686#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-08 07:45:48,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-08 07:45:48,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-08 07:45:48,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 07:45:48,060 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {10626#true} {10686#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #54#return; {10686#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 07:45:48,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {10686#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10708#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {10708#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} assume !false; {10708#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,061 INFO L272 TraceCheckUtils]: 27: Hoare triple {10708#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-08 07:45:48,061 INFO L290 TraceCheckUtils]: 28: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-08 07:45:48,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-08 07:45:48,061 INFO L290 TraceCheckUtils]: 30: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 07:45:48,062 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10626#true} {10708#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} #54#return; {10708#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {10708#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10730#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {10730#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} assume !false; {10730#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,063 INFO L272 TraceCheckUtils]: 34: Hoare triple {10730#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-08 07:45:48,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-08 07:45:48,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-08 07:45:48,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 07:45:48,063 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10626#true} {10730#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} #54#return; {10730#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,064 INFO L290 TraceCheckUtils]: 39: Hoare triple {10730#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10752#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {10752#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} assume !false; {10752#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,064 INFO L272 TraceCheckUtils]: 41: Hoare triple {10752#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-08 07:45:48,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-08 07:45:48,064 INFO L290 TraceCheckUtils]: 43: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-08 07:45:48,064 INFO L290 TraceCheckUtils]: 44: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 07:45:48,067 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10626#true} {10752#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} #54#return; {10752#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,068 INFO L290 TraceCheckUtils]: 46: Hoare triple {10752#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10774#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,068 INFO L290 TraceCheckUtils]: 47: Hoare triple {10774#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} assume !false; {10774#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,068 INFO L272 TraceCheckUtils]: 48: Hoare triple {10774#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-08 07:45:48,069 INFO L290 TraceCheckUtils]: 49: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-08 07:45:48,069 INFO L290 TraceCheckUtils]: 50: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-08 07:45:48,069 INFO L290 TraceCheckUtils]: 51: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 07:45:48,069 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10626#true} {10774#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} #54#return; {10774#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,070 INFO L290 TraceCheckUtils]: 53: Hoare triple {10774#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10796#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,070 INFO L290 TraceCheckUtils]: 54: Hoare triple {10796#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !false; {10796#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,070 INFO L272 TraceCheckUtils]: 55: Hoare triple {10796#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-08 07:45:48,070 INFO L290 TraceCheckUtils]: 56: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-08 07:45:48,071 INFO L290 TraceCheckUtils]: 57: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-08 07:45:48,071 INFO L290 TraceCheckUtils]: 58: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 07:45:48,071 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10626#true} {10796#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} #54#return; {10796#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,072 INFO L290 TraceCheckUtils]: 60: Hoare triple {10796#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10818#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,072 INFO L290 TraceCheckUtils]: 61: Hoare triple {10818#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {10818#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,072 INFO L272 TraceCheckUtils]: 62: Hoare triple {10818#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-08 07:45:48,073 INFO L290 TraceCheckUtils]: 63: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-08 07:45:48,073 INFO L290 TraceCheckUtils]: 64: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-08 07:45:48,073 INFO L290 TraceCheckUtils]: 65: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 07:45:48,073 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10626#true} {10818#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {10818#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,074 INFO L290 TraceCheckUtils]: 67: Hoare triple {10818#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10840#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,074 INFO L290 TraceCheckUtils]: 68: Hoare triple {10840#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} assume !false; {10840#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,074 INFO L272 TraceCheckUtils]: 69: Hoare triple {10840#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-08 07:45:48,074 INFO L290 TraceCheckUtils]: 70: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-08 07:45:48,075 INFO L290 TraceCheckUtils]: 71: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-08 07:45:48,075 INFO L290 TraceCheckUtils]: 72: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 07:45:48,075 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10626#true} {10840#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} #54#return; {10840#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,076 INFO L290 TraceCheckUtils]: 74: Hoare triple {10840#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10862#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,076 INFO L290 TraceCheckUtils]: 75: Hoare triple {10862#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} assume !false; {10862#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,076 INFO L272 TraceCheckUtils]: 76: Hoare triple {10862#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-08 07:45:48,076 INFO L290 TraceCheckUtils]: 77: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-08 07:45:48,077 INFO L290 TraceCheckUtils]: 78: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-08 07:45:48,077 INFO L290 TraceCheckUtils]: 79: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 07:45:48,077 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {10626#true} {10862#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} #54#return; {10862#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,078 INFO L290 TraceCheckUtils]: 81: Hoare triple {10862#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10884#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,078 INFO L290 TraceCheckUtils]: 82: Hoare triple {10884#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !false; {10884#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,078 INFO L272 TraceCheckUtils]: 83: Hoare triple {10884#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-08 07:45:48,078 INFO L290 TraceCheckUtils]: 84: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-08 07:45:48,079 INFO L290 TraceCheckUtils]: 85: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-08 07:45:48,079 INFO L290 TraceCheckUtils]: 86: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 07:45:48,079 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {10626#true} {10884#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} #54#return; {10884#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,080 INFO L290 TraceCheckUtils]: 88: Hoare triple {10884#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10906#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,080 INFO L290 TraceCheckUtils]: 89: Hoare triple {10906#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} assume !false; {10906#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,080 INFO L272 TraceCheckUtils]: 90: Hoare triple {10906#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-08 07:45:48,080 INFO L290 TraceCheckUtils]: 91: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-08 07:45:48,080 INFO L290 TraceCheckUtils]: 92: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-08 07:45:48,080 INFO L290 TraceCheckUtils]: 93: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 07:45:48,081 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {10626#true} {10906#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} #54#return; {10906#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,081 INFO L290 TraceCheckUtils]: 95: Hoare triple {10906#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10928#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,082 INFO L290 TraceCheckUtils]: 96: Hoare triple {10928#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} assume !false; {10928#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,082 INFO L272 TraceCheckUtils]: 97: Hoare triple {10928#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-08 07:45:48,082 INFO L290 TraceCheckUtils]: 98: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-08 07:45:48,082 INFO L290 TraceCheckUtils]: 99: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-08 07:45:48,082 INFO L290 TraceCheckUtils]: 100: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 07:45:48,083 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10626#true} {10928#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} #54#return; {10928#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:48,083 INFO L290 TraceCheckUtils]: 102: Hoare triple {10928#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10950#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-08 07:45:48,084 INFO L290 TraceCheckUtils]: 103: Hoare triple {10950#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !false; {10950#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-08 07:45:48,084 INFO L272 TraceCheckUtils]: 104: Hoare triple {10950#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-08 07:45:48,084 INFO L290 TraceCheckUtils]: 105: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-08 07:45:48,084 INFO L290 TraceCheckUtils]: 106: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-08 07:45:48,084 INFO L290 TraceCheckUtils]: 107: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 07:45:48,084 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {10626#true} {10950#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} #54#return; {10950#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-08 07:45:48,085 INFO L290 TraceCheckUtils]: 109: Hoare triple {10950#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10972#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:45:48,085 INFO L290 TraceCheckUtils]: 110: Hoare triple {10972#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !false; {10972#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:45:48,086 INFO L272 TraceCheckUtils]: 111: Hoare triple {10972#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-08 07:45:48,086 INFO L290 TraceCheckUtils]: 112: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-08 07:45:48,086 INFO L290 TraceCheckUtils]: 113: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-08 07:45:48,086 INFO L290 TraceCheckUtils]: 114: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 07:45:48,086 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {10626#true} {10972#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} #54#return; {10972#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:45:48,087 INFO L290 TraceCheckUtils]: 116: Hoare triple {10972#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10994#(and (= main_~y~0 15) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:48,087 INFO L290 TraceCheckUtils]: 117: Hoare triple {10994#(and (= main_~y~0 15) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} assume !false; {10994#(and (= main_~y~0 15) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:48,087 INFO L272 TraceCheckUtils]: 118: Hoare triple {10994#(and (= main_~y~0 15) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-08 07:45:48,087 INFO L290 TraceCheckUtils]: 119: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-08 07:45:48,088 INFO L290 TraceCheckUtils]: 120: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-08 07:45:48,088 INFO L290 TraceCheckUtils]: 121: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 07:45:48,088 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {10626#true} {10994#(and (= main_~y~0 15) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} #54#return; {10994#(and (= main_~y~0 15) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:48,089 INFO L290 TraceCheckUtils]: 123: Hoare triple {10994#(and (= main_~y~0 15) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11016#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-08 07:45:48,089 INFO L290 TraceCheckUtils]: 124: Hoare triple {11016#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !false; {11016#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-08 07:45:48,089 INFO L272 TraceCheckUtils]: 125: Hoare triple {11016#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-08 07:45:48,089 INFO L290 TraceCheckUtils]: 126: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-08 07:45:48,089 INFO L290 TraceCheckUtils]: 127: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-08 07:45:48,089 INFO L290 TraceCheckUtils]: 128: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 07:45:48,090 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {10626#true} {11016#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} #54#return; {11016#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-08 07:45:48,091 INFO L290 TraceCheckUtils]: 130: Hoare triple {11016#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !(~c~0 < ~k~0); {11038#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} is VALID [2022-04-08 07:45:48,092 INFO L272 TraceCheckUtils]: 131: Hoare triple {11038#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11042#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:48,092 INFO L290 TraceCheckUtils]: 132: Hoare triple {11042#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11046#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:48,093 INFO L290 TraceCheckUtils]: 133: Hoare triple {11046#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10627#false} is VALID [2022-04-08 07:45:48,093 INFO L290 TraceCheckUtils]: 134: Hoare triple {10627#false} assume !false; {10627#false} is VALID [2022-04-08 07:45:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 34 proven. 408 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-08 07:45:48,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:49,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:49,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166867817] [2022-04-08 07:45:49,761 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:49,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934015375] [2022-04-08 07:45:49,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934015375] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:49,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:49,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-04-08 07:45:49,761 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:49,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1158264388] [2022-04-08 07:45:49,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1158264388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:49,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:49,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 07:45:49,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563133076] [2022-04-08 07:45:49,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:49,762 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) Word has length 135 [2022-04-08 07:45:49,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:49,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 07:45:49,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:49,830 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 07:45:49,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:49,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 07:45:49,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=1220, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 07:45:49,831 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 07:45:52,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:52,471 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2022-04-08 07:45:52,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 07:45:52,472 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) Word has length 135 [2022-04-08 07:45:52,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:52,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 07:45:52,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 96 transitions. [2022-04-08 07:45:52,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 07:45:52,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 96 transitions. [2022-04-08 07:45:52,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 96 transitions. [2022-04-08 07:45:52,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:52,576 INFO L225 Difference]: With dead ends: 84 [2022-04-08 07:45:52,576 INFO L226 Difference]: Without dead ends: 79 [2022-04-08 07:45:52,577 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=350, Invalid=1372, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 07:45:52,577 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:52,578 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 730 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-08 07:45:52,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-08 07:45:52,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-08 07:45:52,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:52,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 07:45:52,660 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 07:45:52,660 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 07:45:52,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:52,664 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-08 07:45:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-08 07:45:52,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:52,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:52,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 79 states. [2022-04-08 07:45:52,665 INFO L87 Difference]: Start difference. First operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 79 states. [2022-04-08 07:45:52,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:52,667 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-08 07:45:52,667 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-08 07:45:52,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:52,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:52,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:52,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:52,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 07:45:52,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2022-04-08 07:45:52,670 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 135 [2022-04-08 07:45:52,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:52,670 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2022-04-08 07:45:52,671 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 07:45:52,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 95 transitions. [2022-04-08 07:45:52,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:52,839 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-08 07:45:52,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-04-08 07:45:52,840 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:52,840 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:52,848 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 07:45:53,040 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 07:45:53,040 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:53,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:53,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1539623736, now seen corresponding path program 33 times [2022-04-08 07:45:53,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:53,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [994201925] [2022-04-08 07:45:53,112 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:53,113 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:53,113 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:53,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1539623736, now seen corresponding path program 34 times [2022-04-08 07:45:53,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:53,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280977911] [2022-04-08 07:45:53,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:53,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:53,136 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:53,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [3848479] [2022-04-08 07:45:53,136 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:45:53,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:53,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:53,138 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 07:45:53,159 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 07:45:53,680 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:45:53,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:53,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-08 07:45:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:53,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:54,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {11912#true} call ULTIMATE.init(); {11912#true} is VALID [2022-04-08 07:45:54,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {11912#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {11912#true} is VALID [2022-04-08 07:45:54,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-08 07:45:54,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11912#true} {11912#true} #60#return; {11912#true} is VALID [2022-04-08 07:45:54,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {11912#true} call #t~ret5 := main(); {11912#true} is VALID [2022-04-08 07:45:54,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {11912#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {11912#true} is VALID [2022-04-08 07:45:54,449 INFO L272 TraceCheckUtils]: 6: Hoare triple {11912#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {11912#true} is VALID [2022-04-08 07:45:54,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-08 07:45:54,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-08 07:45:54,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-08 07:45:54,449 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11912#true} {11912#true} #52#return; {11912#true} is VALID [2022-04-08 07:45:54,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {11912#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11950#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:54,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {11950#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {11950#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:54,462 INFO L272 TraceCheckUtils]: 13: Hoare triple {11950#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11912#true} is VALID [2022-04-08 07:45:54,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-08 07:45:54,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-08 07:45:54,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-08 07:45:54,463 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11912#true} {11950#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {11950#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:54,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {11950#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11972#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:54,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {11972#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {11972#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:54,464 INFO L272 TraceCheckUtils]: 20: Hoare triple {11972#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11912#true} is VALID [2022-04-08 07:45:54,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-08 07:45:54,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-08 07:45:54,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-08 07:45:54,464 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11912#true} {11972#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {11972#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:54,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {11972#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11994#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 07:45:54,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {11994#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !false; {11994#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 07:45:54,465 INFO L272 TraceCheckUtils]: 27: Hoare triple {11994#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11912#true} is VALID [2022-04-08 07:45:54,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-08 07:45:54,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-08 07:45:54,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-08 07:45:54,466 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11912#true} {11994#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #54#return; {11994#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 07:45:54,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {11994#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12016#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 07:45:54,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {12016#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {12016#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 07:45:54,466 INFO L272 TraceCheckUtils]: 34: Hoare triple {12016#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11912#true} is VALID [2022-04-08 07:45:54,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-08 07:45:54,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-08 07:45:54,467 INFO L290 TraceCheckUtils]: 37: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-08 07:45:54,467 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11912#true} {12016#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #54#return; {12016#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 07:45:54,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {12016#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12038#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 07:45:54,468 INFO L290 TraceCheckUtils]: 40: Hoare triple {12038#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !false; {12038#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 07:45:54,468 INFO L272 TraceCheckUtils]: 41: Hoare triple {12038#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11912#true} is VALID [2022-04-08 07:45:54,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-08 07:45:54,468 INFO L290 TraceCheckUtils]: 43: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-08 07:45:54,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-08 07:45:54,468 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11912#true} {12038#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #54#return; {12038#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 07:45:54,469 INFO L290 TraceCheckUtils]: 46: Hoare triple {12038#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12060#(and (= (+ main_~y~0 (- 4)) 1) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:45:54,469 INFO L290 TraceCheckUtils]: 47: Hoare triple {12060#(and (= (+ main_~y~0 (- 4)) 1) (= (+ (- 1) main_~c~0) 4))} assume !false; {12060#(and (= (+ main_~y~0 (- 4)) 1) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:45:54,469 INFO L272 TraceCheckUtils]: 48: Hoare triple {12060#(and (= (+ main_~y~0 (- 4)) 1) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11912#true} is VALID [2022-04-08 07:45:54,469 INFO L290 TraceCheckUtils]: 49: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-08 07:45:54,469 INFO L290 TraceCheckUtils]: 50: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-08 07:45:54,469 INFO L290 TraceCheckUtils]: 51: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-08 07:45:54,470 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11912#true} {12060#(and (= (+ main_~y~0 (- 4)) 1) (= (+ (- 1) main_~c~0) 4))} #54#return; {12060#(and (= (+ main_~y~0 (- 4)) 1) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:45:54,470 INFO L290 TraceCheckUtils]: 53: Hoare triple {12060#(and (= (+ main_~y~0 (- 4)) 1) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12082#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:54,470 INFO L290 TraceCheckUtils]: 54: Hoare triple {12082#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {12082#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:54,470 INFO L272 TraceCheckUtils]: 55: Hoare triple {12082#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11912#true} is VALID [2022-04-08 07:45:54,470 INFO L290 TraceCheckUtils]: 56: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-08 07:45:54,471 INFO L290 TraceCheckUtils]: 57: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-08 07:45:54,471 INFO L290 TraceCheckUtils]: 58: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-08 07:45:54,471 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11912#true} {12082#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #54#return; {12082#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:54,471 INFO L290 TraceCheckUtils]: 60: Hoare triple {12082#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12104#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:54,472 INFO L290 TraceCheckUtils]: 61: Hoare triple {12104#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {12104#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:54,472 INFO L272 TraceCheckUtils]: 62: Hoare triple {12104#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11912#true} is VALID [2022-04-08 07:45:54,472 INFO L290 TraceCheckUtils]: 63: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-08 07:45:54,472 INFO L290 TraceCheckUtils]: 64: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-08 07:45:54,472 INFO L290 TraceCheckUtils]: 65: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-08 07:45:54,472 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11912#true} {12104#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {12104#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:54,473 INFO L290 TraceCheckUtils]: 67: Hoare triple {12104#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12126#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 07:45:54,473 INFO L290 TraceCheckUtils]: 68: Hoare triple {12126#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {12126#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 07:45:54,473 INFO L272 TraceCheckUtils]: 69: Hoare triple {12126#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11912#true} is VALID [2022-04-08 07:45:54,473 INFO L290 TraceCheckUtils]: 70: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-08 07:45:54,473 INFO L290 TraceCheckUtils]: 71: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-08 07:45:54,473 INFO L290 TraceCheckUtils]: 72: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-08 07:45:54,474 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11912#true} {12126#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #54#return; {12126#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 07:45:54,474 INFO L290 TraceCheckUtils]: 74: Hoare triple {12126#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12148#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-08 07:45:54,474 INFO L290 TraceCheckUtils]: 75: Hoare triple {12148#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !false; {12148#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-08 07:45:54,475 INFO L272 TraceCheckUtils]: 76: Hoare triple {12148#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11912#true} is VALID [2022-04-08 07:45:54,475 INFO L290 TraceCheckUtils]: 77: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-08 07:45:54,475 INFO L290 TraceCheckUtils]: 78: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-08 07:45:54,475 INFO L290 TraceCheckUtils]: 79: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-08 07:45:54,475 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {11912#true} {12148#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} #54#return; {12148#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-08 07:45:54,475 INFO L290 TraceCheckUtils]: 81: Hoare triple {12148#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12170#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:45:54,476 INFO L290 TraceCheckUtils]: 82: Hoare triple {12170#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {12170#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:45:54,476 INFO L272 TraceCheckUtils]: 83: Hoare triple {12170#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11912#true} is VALID [2022-04-08 07:45:54,476 INFO L290 TraceCheckUtils]: 84: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-08 07:45:54,476 INFO L290 TraceCheckUtils]: 85: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-08 07:45:54,476 INFO L290 TraceCheckUtils]: 86: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-08 07:45:54,476 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {11912#true} {12170#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #54#return; {12170#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:45:54,477 INFO L290 TraceCheckUtils]: 88: Hoare triple {12170#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12192#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-08 07:45:54,477 INFO L290 TraceCheckUtils]: 89: Hoare triple {12192#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !false; {12192#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-08 07:45:54,477 INFO L272 TraceCheckUtils]: 90: Hoare triple {12192#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11912#true} is VALID [2022-04-08 07:45:54,477 INFO L290 TraceCheckUtils]: 91: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-08 07:45:54,477 INFO L290 TraceCheckUtils]: 92: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-08 07:45:54,477 INFO L290 TraceCheckUtils]: 93: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-08 07:45:54,478 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {11912#true} {12192#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} #54#return; {12192#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-08 07:45:54,478 INFO L290 TraceCheckUtils]: 95: Hoare triple {12192#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12214#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 07:45:54,478 INFO L290 TraceCheckUtils]: 96: Hoare triple {12214#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} assume !false; {12214#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 07:45:54,479 INFO L272 TraceCheckUtils]: 97: Hoare triple {12214#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11912#true} is VALID [2022-04-08 07:45:54,479 INFO L290 TraceCheckUtils]: 98: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-08 07:45:54,479 INFO L290 TraceCheckUtils]: 99: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-08 07:45:54,479 INFO L290 TraceCheckUtils]: 100: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-08 07:45:54,479 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11912#true} {12214#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} #54#return; {12214#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 07:45:54,480 INFO L290 TraceCheckUtils]: 102: Hoare triple {12214#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12236#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:45:54,480 INFO L290 TraceCheckUtils]: 103: Hoare triple {12236#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {12236#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:45:54,480 INFO L272 TraceCheckUtils]: 104: Hoare triple {12236#(and (= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11912#true} is VALID [2022-04-08 07:45:54,480 INFO L290 TraceCheckUtils]: 105: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-08 07:45:54,480 INFO L290 TraceCheckUtils]: 106: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-08 07:45:54,480 INFO L290 TraceCheckUtils]: 107: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-08 07:45:54,480 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {11912#true} {12236#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {12236#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:45:54,481 INFO L290 TraceCheckUtils]: 109: Hoare triple {12236#(and (= main_~c~0 13) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12258#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 07:45:54,481 INFO L290 TraceCheckUtils]: 110: Hoare triple {12258#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !false; {12258#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 07:45:54,481 INFO L272 TraceCheckUtils]: 111: Hoare triple {12258#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11912#true} is VALID [2022-04-08 07:45:54,481 INFO L290 TraceCheckUtils]: 112: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-08 07:45:54,481 INFO L290 TraceCheckUtils]: 113: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-08 07:45:54,481 INFO L290 TraceCheckUtils]: 114: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-08 07:45:54,482 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {11912#true} {12258#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} #54#return; {12258#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 07:45:54,482 INFO L290 TraceCheckUtils]: 116: Hoare triple {12258#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12280#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:54,482 INFO L290 TraceCheckUtils]: 117: Hoare triple {12280#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} assume !false; {12280#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:54,483 INFO L272 TraceCheckUtils]: 118: Hoare triple {12280#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11912#true} is VALID [2022-04-08 07:45:54,483 INFO L290 TraceCheckUtils]: 119: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-08 07:45:54,483 INFO L290 TraceCheckUtils]: 120: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-08 07:45:54,483 INFO L290 TraceCheckUtils]: 121: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-08 07:45:54,483 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {11912#true} {12280#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} #54#return; {12280#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:54,484 INFO L290 TraceCheckUtils]: 123: Hoare triple {12280#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12302#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:45:54,484 INFO L290 TraceCheckUtils]: 124: Hoare triple {12302#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {12302#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:45:54,484 INFO L272 TraceCheckUtils]: 125: Hoare triple {12302#(and (= main_~c~0 16) (= main_~y~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11912#true} is VALID [2022-04-08 07:45:54,484 INFO L290 TraceCheckUtils]: 126: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-08 07:45:54,484 INFO L290 TraceCheckUtils]: 127: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-08 07:45:54,484 INFO L290 TraceCheckUtils]: 128: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-08 07:45:54,484 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {11912#true} {12302#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {12302#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:45:54,485 INFO L290 TraceCheckUtils]: 130: Hoare triple {12302#(and (= main_~c~0 16) (= main_~y~0 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12324#(and (<= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} is VALID [2022-04-08 07:45:54,485 INFO L290 TraceCheckUtils]: 131: Hoare triple {12324#(and (<= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} assume !false; {12324#(and (<= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} is VALID [2022-04-08 07:45:54,485 INFO L272 TraceCheckUtils]: 132: Hoare triple {12324#(and (<= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11912#true} is VALID [2022-04-08 07:45:54,485 INFO L290 TraceCheckUtils]: 133: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-08 07:45:54,485 INFO L290 TraceCheckUtils]: 134: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-08 07:45:54,485 INFO L290 TraceCheckUtils]: 135: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-08 07:45:54,486 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {11912#true} {12324#(and (<= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} #54#return; {12324#(and (<= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} is VALID [2022-04-08 07:45:54,486 INFO L290 TraceCheckUtils]: 137: Hoare triple {12324#(and (<= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} assume !(~c~0 < ~k~0); {12346#(and (<= main_~k~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} is VALID [2022-04-08 07:45:54,487 INFO L272 TraceCheckUtils]: 138: Hoare triple {12346#(and (<= main_~k~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12350#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:54,488 INFO L290 TraceCheckUtils]: 139: Hoare triple {12350#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12354#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:54,488 INFO L290 TraceCheckUtils]: 140: Hoare triple {12354#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11913#false} is VALID [2022-04-08 07:45:54,488 INFO L290 TraceCheckUtils]: 141: Hoare triple {11913#false} assume !false; {11913#false} is VALID [2022-04-08 07:45:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 36 proven. 459 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-04-08 07:45:54,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:54,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:54,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280977911] [2022-04-08 07:45:54,769 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:54,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3848479] [2022-04-08 07:45:54,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3848479] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:54,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:54,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-04-08 07:45:54,769 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:54,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [994201925] [2022-04-08 07:45:54,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [994201925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:54,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:54,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 07:45:54,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623017633] [2022-04-08 07:45:54,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:54,770 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 142 [2022-04-08 07:45:54,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:54,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 07:45:54,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:54,847 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 07:45:54,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:54,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 07:45:54,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-04-08 07:45:54,848 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 07:45:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:57,639 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2022-04-08 07:45:57,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 07:45:57,640 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 142 [2022-04-08 07:45:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 07:45:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 100 transitions. [2022-04-08 07:45:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 07:45:57,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 100 transitions. [2022-04-08 07:45:57,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 100 transitions. [2022-04-08 07:45:57,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:57,726 INFO L225 Difference]: With dead ends: 87 [2022-04-08 07:45:57,726 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 07:45:57,726 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2022-04-08 07:45:57,727 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 2 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:57,727 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 803 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-08 07:45:57,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 07:45:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-08 07:45:57,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:57,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 07:45:57,811 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 07:45:57,811 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 07:45:57,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:57,813 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-08 07:45:57,813 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-08 07:45:57,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:57,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:57,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-08 07:45:57,814 INFO L87 Difference]: Start difference. First operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-08 07:45:57,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:57,816 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-08 07:45:57,816 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-08 07:45:57,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:57,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:57,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:57,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 07:45:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2022-04-08 07:45:57,818 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 142 [2022-04-08 07:45:57,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:57,819 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2022-04-08 07:45:57,819 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 07:45:57,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 99 transitions. [2022-04-08 07:45:57,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:57,966 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-08 07:45:57,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-08 07:45:57,966 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:57,966 INFO L499 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:57,971 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 07:45:58,167 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 07:45:58,167 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:58,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:58,168 INFO L85 PathProgramCache]: Analyzing trace with hash -157742263, now seen corresponding path program 35 times [2022-04-08 07:45:58,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:58,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [661473155] [2022-04-08 07:45:58,237 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:58,237 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:58,237 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:58,237 INFO L85 PathProgramCache]: Analyzing trace with hash -157742263, now seen corresponding path program 36 times [2022-04-08 07:45:58,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:58,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690730994] [2022-04-08 07:45:58,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:58,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:58,259 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:58,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1941136285] [2022-04-08 07:45:58,260 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:45:58,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:58,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:58,261 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 07:45:58,269 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 07:46:09,561 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-08 07:46:09,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:46:09,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-08 07:46:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:46:09,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:46:10,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {12908#true} call ULTIMATE.init(); {12908#true} is VALID [2022-04-08 07:46:10,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {12908#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {12908#true} is VALID [2022-04-08 07:46:10,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:46:10,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12908#true} {12908#true} #60#return; {12908#true} is VALID [2022-04-08 07:46:10,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {12908#true} call #t~ret5 := main(); {12908#true} is VALID [2022-04-08 07:46:10,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {12908#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {12908#true} is VALID [2022-04-08 07:46:10,364 INFO L272 TraceCheckUtils]: 6: Hoare triple {12908#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:46:10,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:46:10,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:46:10,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:46:10,364 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12908#true} {12908#true} #52#return; {12908#true} is VALID [2022-04-08 07:46:10,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {12908#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12946#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:10,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {12946#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {12946#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:10,365 INFO L272 TraceCheckUtils]: 13: Hoare triple {12946#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:46:10,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:46:10,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:46:10,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:46:10,365 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12908#true} {12946#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {12946#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:10,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {12946#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:46:10,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {12968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {12968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:46:10,366 INFO L272 TraceCheckUtils]: 20: Hoare triple {12968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:46:10,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:46:10,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:46:10,366 INFO L290 TraceCheckUtils]: 23: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:46:10,367 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {12908#true} {12968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {12968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:46:10,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {12968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12990#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:46:10,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {12990#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {12990#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:46:10,367 INFO L272 TraceCheckUtils]: 27: Hoare triple {12990#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:46:10,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:46:10,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:46:10,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:46:10,368 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12908#true} {12990#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {12990#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:46:10,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {12990#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13012#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:46:10,369 INFO L290 TraceCheckUtils]: 33: Hoare triple {13012#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {13012#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:46:10,369 INFO L272 TraceCheckUtils]: 34: Hoare triple {13012#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:46:10,369 INFO L290 TraceCheckUtils]: 35: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:46:10,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:46:10,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:46:10,372 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {12908#true} {13012#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {13012#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:46:10,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {13012#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13034#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:46:10,373 INFO L290 TraceCheckUtils]: 40: Hoare triple {13034#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {13034#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:46:10,373 INFO L272 TraceCheckUtils]: 41: Hoare triple {13034#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:46:10,373 INFO L290 TraceCheckUtils]: 42: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:46:10,373 INFO L290 TraceCheckUtils]: 43: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:46:10,373 INFO L290 TraceCheckUtils]: 44: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:46:10,375 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12908#true} {13034#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {13034#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:46:10,376 INFO L290 TraceCheckUtils]: 46: Hoare triple {13034#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13056#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 07:46:10,376 INFO L290 TraceCheckUtils]: 47: Hoare triple {13056#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !false; {13056#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 07:46:10,376 INFO L272 TraceCheckUtils]: 48: Hoare triple {13056#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:46:10,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:46:10,376 INFO L290 TraceCheckUtils]: 50: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:46:10,377 INFO L290 TraceCheckUtils]: 51: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:46:10,377 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12908#true} {13056#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #54#return; {13056#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 07:46:10,378 INFO L290 TraceCheckUtils]: 53: Hoare triple {13056#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13078#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-08 07:46:10,378 INFO L290 TraceCheckUtils]: 54: Hoare triple {13078#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !false; {13078#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-08 07:46:10,378 INFO L272 TraceCheckUtils]: 55: Hoare triple {13078#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:46:10,378 INFO L290 TraceCheckUtils]: 56: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:46:10,378 INFO L290 TraceCheckUtils]: 57: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:46:10,378 INFO L290 TraceCheckUtils]: 58: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:46:10,379 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12908#true} {13078#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} #54#return; {13078#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-08 07:46:10,379 INFO L290 TraceCheckUtils]: 60: Hoare triple {13078#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13100#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-08 07:46:10,380 INFO L290 TraceCheckUtils]: 61: Hoare triple {13100#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} assume !false; {13100#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-08 07:46:10,380 INFO L272 TraceCheckUtils]: 62: Hoare triple {13100#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:46:10,380 INFO L290 TraceCheckUtils]: 63: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:46:10,380 INFO L290 TraceCheckUtils]: 64: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:46:10,380 INFO L290 TraceCheckUtils]: 65: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:46:10,381 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12908#true} {13100#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} #54#return; {13100#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-08 07:46:10,381 INFO L290 TraceCheckUtils]: 67: Hoare triple {13100#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13122#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:46:10,382 INFO L290 TraceCheckUtils]: 68: Hoare triple {13122#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} assume !false; {13122#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:46:10,382 INFO L272 TraceCheckUtils]: 69: Hoare triple {13122#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:46:10,382 INFO L290 TraceCheckUtils]: 70: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:46:10,382 INFO L290 TraceCheckUtils]: 71: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:46:10,382 INFO L290 TraceCheckUtils]: 72: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:46:10,382 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12908#true} {13122#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} #54#return; {13122#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:46:10,383 INFO L290 TraceCheckUtils]: 74: Hoare triple {13122#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13144#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 07:46:10,383 INFO L290 TraceCheckUtils]: 75: Hoare triple {13144#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} assume !false; {13144#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 07:46:10,384 INFO L272 TraceCheckUtils]: 76: Hoare triple {13144#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:46:10,384 INFO L290 TraceCheckUtils]: 77: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:46:10,384 INFO L290 TraceCheckUtils]: 78: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:46:10,384 INFO L290 TraceCheckUtils]: 79: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:46:10,384 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12908#true} {13144#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} #54#return; {13144#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 07:46:10,385 INFO L290 TraceCheckUtils]: 81: Hoare triple {13144#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:46:10,385 INFO L290 TraceCheckUtils]: 82: Hoare triple {13166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {13166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:46:10,385 INFO L272 TraceCheckUtils]: 83: Hoare triple {13166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:46:10,385 INFO L290 TraceCheckUtils]: 84: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:46:10,385 INFO L290 TraceCheckUtils]: 85: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:46:10,386 INFO L290 TraceCheckUtils]: 86: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:46:10,386 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {12908#true} {13166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #54#return; {13166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:46:10,386 INFO L290 TraceCheckUtils]: 88: Hoare triple {13166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-08 07:46:10,387 INFO L290 TraceCheckUtils]: 89: Hoare triple {13188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !false; {13188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-08 07:46:10,387 INFO L272 TraceCheckUtils]: 90: Hoare triple {13188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:46:10,387 INFO L290 TraceCheckUtils]: 91: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:46:10,387 INFO L290 TraceCheckUtils]: 92: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:46:10,387 INFO L290 TraceCheckUtils]: 93: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:46:10,388 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {12908#true} {13188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} #54#return; {13188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-08 07:46:10,388 INFO L290 TraceCheckUtils]: 95: Hoare triple {13188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13210#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 07:46:10,389 INFO L290 TraceCheckUtils]: 96: Hoare triple {13210#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {13210#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 07:46:10,389 INFO L272 TraceCheckUtils]: 97: Hoare triple {13210#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:46:10,389 INFO L290 TraceCheckUtils]: 98: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:46:10,389 INFO L290 TraceCheckUtils]: 99: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:46:10,389 INFO L290 TraceCheckUtils]: 100: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:46:10,389 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {12908#true} {13210#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {13210#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 07:46:10,390 INFO L290 TraceCheckUtils]: 102: Hoare triple {13210#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13232#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:46:10,390 INFO L290 TraceCheckUtils]: 103: Hoare triple {13232#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {13232#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:46:10,390 INFO L272 TraceCheckUtils]: 104: Hoare triple {13232#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:46:10,391 INFO L290 TraceCheckUtils]: 105: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:46:10,391 INFO L290 TraceCheckUtils]: 106: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:46:10,391 INFO L290 TraceCheckUtils]: 107: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:46:10,391 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {12908#true} {13232#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {13232#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:46:10,392 INFO L290 TraceCheckUtils]: 109: Hoare triple {13232#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13254#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 07:46:10,392 INFO L290 TraceCheckUtils]: 110: Hoare triple {13254#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {13254#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 07:46:10,392 INFO L272 TraceCheckUtils]: 111: Hoare triple {13254#(and (= main_~y~0 14) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:46:10,392 INFO L290 TraceCheckUtils]: 112: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:46:10,392 INFO L290 TraceCheckUtils]: 113: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:46:10,392 INFO L290 TraceCheckUtils]: 114: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:46:10,393 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {12908#true} {13254#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {13254#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 07:46:10,393 INFO L290 TraceCheckUtils]: 116: Hoare triple {13254#(and (= main_~y~0 14) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13276#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:46:10,394 INFO L290 TraceCheckUtils]: 117: Hoare triple {13276#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {13276#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:46:10,394 INFO L272 TraceCheckUtils]: 118: Hoare triple {13276#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:46:10,394 INFO L290 TraceCheckUtils]: 119: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:46:10,394 INFO L290 TraceCheckUtils]: 120: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:46:10,394 INFO L290 TraceCheckUtils]: 121: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:46:10,395 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {12908#true} {13276#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #54#return; {13276#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:46:10,395 INFO L290 TraceCheckUtils]: 123: Hoare triple {13276#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13298#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 07:46:10,395 INFO L290 TraceCheckUtils]: 124: Hoare triple {13298#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} assume !false; {13298#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 07:46:10,395 INFO L272 TraceCheckUtils]: 125: Hoare triple {13298#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:46:10,396 INFO L290 TraceCheckUtils]: 126: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:46:10,396 INFO L290 TraceCheckUtils]: 127: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:46:10,396 INFO L290 TraceCheckUtils]: 128: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:46:10,396 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {12908#true} {13298#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} #54#return; {13298#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 07:46:10,396 INFO L290 TraceCheckUtils]: 130: Hoare triple {13298#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13320#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-08 07:46:10,397 INFO L290 TraceCheckUtils]: 131: Hoare triple {13320#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} assume !false; {13320#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-08 07:46:10,397 INFO L272 TraceCheckUtils]: 132: Hoare triple {13320#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:46:10,397 INFO L290 TraceCheckUtils]: 133: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:46:10,397 INFO L290 TraceCheckUtils]: 134: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:46:10,397 INFO L290 TraceCheckUtils]: 135: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:46:10,397 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {12908#true} {13320#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} #54#return; {13320#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-08 07:46:10,398 INFO L290 TraceCheckUtils]: 137: Hoare triple {13320#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13342#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 07:46:10,398 INFO L290 TraceCheckUtils]: 138: Hoare triple {13342#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {13342#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 07:46:10,398 INFO L272 TraceCheckUtils]: 139: Hoare triple {13342#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:46:10,398 INFO L290 TraceCheckUtils]: 140: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:46:10,398 INFO L290 TraceCheckUtils]: 141: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:46:10,398 INFO L290 TraceCheckUtils]: 142: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:46:10,399 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {12908#true} {13342#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #54#return; {13342#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 07:46:10,400 INFO L290 TraceCheckUtils]: 144: Hoare triple {13342#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !(~c~0 < ~k~0); {13364#(and (< 17 main_~k~0) (<= main_~k~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 07:46:10,400 INFO L272 TraceCheckUtils]: 145: Hoare triple {13364#(and (< 17 main_~k~0) (<= main_~k~0 18) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13368#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:46:10,400 INFO L290 TraceCheckUtils]: 146: Hoare triple {13368#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13372#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:46:10,401 INFO L290 TraceCheckUtils]: 147: Hoare triple {13372#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12909#false} is VALID [2022-04-08 07:46:10,401 INFO L290 TraceCheckUtils]: 148: Hoare triple {12909#false} assume !false; {12909#false} is VALID [2022-04-08 07:46:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 38 proven. 513 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2022-04-08 07:46:10,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:46:10,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:46:10,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690730994] [2022-04-08 07:46:10,711 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:46:10,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941136285] [2022-04-08 07:46:10,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941136285] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:46:10,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:46:10,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2022-04-08 07:46:10,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:46:10,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [661473155] [2022-04-08 07:46:10,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [661473155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:46:10,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:46:10,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 07:46:10,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117480877] [2022-04-08 07:46:10,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:46:10,712 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) Word has length 149 [2022-04-08 07:46:10,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:46:10,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 07:46:10,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:10,789 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 07:46:10,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:10,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 07:46:10,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2022-04-08 07:46:10,789 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 07:46:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:13,997 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2022-04-08 07:46:13,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 07:46:13,998 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) Word has length 149 [2022-04-08 07:46:13,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:46:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 07:46:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2022-04-08 07:46:14,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 07:46:14,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2022-04-08 07:46:14,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 104 transitions. [2022-04-08 07:46:14,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:14,122 INFO L225 Difference]: With dead ends: 90 [2022-04-08 07:46:14,122 INFO L226 Difference]: Without dead ends: 85 [2022-04-08 07:46:14,122 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2022-04-08 07:46:14,123 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-08 07:46:14,123 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 863 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-08 07:46:14,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-08 07:46:14,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-08 07:46:14,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:46:14,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 07:46:14,234 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 07:46:14,235 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 07:46:14,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:14,237 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-08 07:46:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-08 07:46:14,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:14,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:14,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 85 states. [2022-04-08 07:46:14,237 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 85 states. [2022-04-08 07:46:14,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:14,239 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-08 07:46:14,240 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-08 07:46:14,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:14,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:14,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:46:14,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:46:14,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 07:46:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2022-04-08 07:46:14,242 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 149 [2022-04-08 07:46:14,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:46:14,242 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2022-04-08 07:46:14,243 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 07:46:14,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 103 transitions. [2022-04-08 07:46:14,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:14,440 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-08 07:46:14,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-08 07:46:14,441 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:46:14,441 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:46:14,451 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 07:46:14,641 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 07:46:14,641 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:46:14,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:46:14,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1167462824, now seen corresponding path program 37 times [2022-04-08 07:46:14,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:14,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [589011990] [2022-04-08 07:46:14,710 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:46:14,710 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:46:14,710 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:46:14,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1167462824, now seen corresponding path program 38 times [2022-04-08 07:46:14,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:46:14,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264900077] [2022-04-08 07:46:14,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:46:14,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:46:14,724 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:46:14,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2115310494] [2022-04-08 07:46:14,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:46:14,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:46:14,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:46:14,726 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 07:46:14,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-08 07:46:15,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:46:15,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:46:15,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 85 conjunts are in the unsatisfiable core [2022-04-08 07:46:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:46:15,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:46:16,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {13944#true} call ULTIMATE.init(); {13944#true} is VALID [2022-04-08 07:46:16,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {13944#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {13944#true} is VALID [2022-04-08 07:46:16,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13944#true} {13944#true} #60#return; {13944#true} is VALID [2022-04-08 07:46:16,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {13944#true} call #t~ret5 := main(); {13944#true} is VALID [2022-04-08 07:46:16,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {13944#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {13944#true} is VALID [2022-04-08 07:46:16,353 INFO L272 TraceCheckUtils]: 6: Hoare triple {13944#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {13944#true} is VALID [2022-04-08 07:46:16,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-08 07:46:16,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-08 07:46:16,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,353 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13944#true} {13944#true} #52#return; {13944#true} is VALID [2022-04-08 07:46:16,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {13944#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {13982#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:16,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {13982#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {13982#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:16,354 INFO L272 TraceCheckUtils]: 13: Hoare triple {13982#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-08 07:46:16,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-08 07:46:16,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-08 07:46:16,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,355 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13944#true} {13982#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {13982#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:16,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {13982#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14004#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 07:46:16,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {14004#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {14004#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 07:46:16,356 INFO L272 TraceCheckUtils]: 20: Hoare triple {14004#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-08 07:46:16,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-08 07:46:16,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-08 07:46:16,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,356 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {13944#true} {14004#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #54#return; {14004#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 07:46:16,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {14004#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14026#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,357 INFO L290 TraceCheckUtils]: 26: Hoare triple {14026#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} assume !false; {14026#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,357 INFO L272 TraceCheckUtils]: 27: Hoare triple {14026#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-08 07:46:16,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-08 07:46:16,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-08 07:46:16,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,358 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13944#true} {14026#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} #54#return; {14026#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {14026#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14048#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {14048#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1) (< 0 main_~k~0))} assume !false; {14048#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,358 INFO L272 TraceCheckUtils]: 34: Hoare triple {14048#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-08 07:46:16,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-08 07:46:16,359 INFO L290 TraceCheckUtils]: 36: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-08 07:46:16,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,359 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13944#true} {14048#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1) (< 0 main_~k~0))} #54#return; {14048#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {14048#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14070#(and (= (+ main_~c~0 (- 3)) 1) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:46:16,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {14070#(and (= (+ main_~c~0 (- 3)) 1) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} assume !false; {14070#(and (= (+ main_~c~0 (- 3)) 1) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:46:16,360 INFO L272 TraceCheckUtils]: 41: Hoare triple {14070#(and (= (+ main_~c~0 (- 3)) 1) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-08 07:46:16,360 INFO L290 TraceCheckUtils]: 42: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-08 07:46:16,360 INFO L290 TraceCheckUtils]: 43: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-08 07:46:16,360 INFO L290 TraceCheckUtils]: 44: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,361 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13944#true} {14070#(and (= (+ main_~c~0 (- 3)) 1) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} #54#return; {14070#(and (= (+ main_~c~0 (- 3)) 1) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:46:16,361 INFO L290 TraceCheckUtils]: 46: Hoare triple {14070#(and (= (+ main_~c~0 (- 3)) 1) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14092#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,361 INFO L290 TraceCheckUtils]: 47: Hoare triple {14092#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} assume !false; {14092#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,361 INFO L272 TraceCheckUtils]: 48: Hoare triple {14092#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-08 07:46:16,361 INFO L290 TraceCheckUtils]: 49: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-08 07:46:16,361 INFO L290 TraceCheckUtils]: 50: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-08 07:46:16,362 INFO L290 TraceCheckUtils]: 51: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,363 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13944#true} {14092#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} #54#return; {14092#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,364 INFO L290 TraceCheckUtils]: 53: Hoare triple {14092#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14114#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,364 INFO L290 TraceCheckUtils]: 54: Hoare triple {14114#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6) (< 0 main_~k~0))} assume !false; {14114#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,364 INFO L272 TraceCheckUtils]: 55: Hoare triple {14114#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-08 07:46:16,364 INFO L290 TraceCheckUtils]: 56: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-08 07:46:16,365 INFO L290 TraceCheckUtils]: 57: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-08 07:46:16,365 INFO L290 TraceCheckUtils]: 58: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,365 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13944#true} {14114#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6) (< 0 main_~k~0))} #54#return; {14114#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,366 INFO L290 TraceCheckUtils]: 60: Hoare triple {14114#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14136#(and (= (+ (- 1) main_~c~0) 6) (= 2 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,366 INFO L290 TraceCheckUtils]: 61: Hoare triple {14136#(and (= (+ (- 1) main_~c~0) 6) (= 2 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} assume !false; {14136#(and (= (+ (- 1) main_~c~0) 6) (= 2 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,366 INFO L272 TraceCheckUtils]: 62: Hoare triple {14136#(and (= (+ (- 1) main_~c~0) 6) (= 2 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-08 07:46:16,366 INFO L290 TraceCheckUtils]: 63: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-08 07:46:16,366 INFO L290 TraceCheckUtils]: 64: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-08 07:46:16,367 INFO L290 TraceCheckUtils]: 65: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,367 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13944#true} {14136#(and (= (+ (- 1) main_~c~0) 6) (= 2 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} #54#return; {14136#(and (= (+ (- 1) main_~c~0) 6) (= 2 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,368 INFO L290 TraceCheckUtils]: 67: Hoare triple {14136#(and (= (+ (- 1) main_~c~0) 6) (= 2 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14158#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,368 INFO L290 TraceCheckUtils]: 68: Hoare triple {14158#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8) (< 0 main_~k~0))} assume !false; {14158#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,368 INFO L272 TraceCheckUtils]: 69: Hoare triple {14158#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-08 07:46:16,368 INFO L290 TraceCheckUtils]: 70: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-08 07:46:16,368 INFO L290 TraceCheckUtils]: 71: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-08 07:46:16,368 INFO L290 TraceCheckUtils]: 72: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,369 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13944#true} {14158#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8) (< 0 main_~k~0))} #54#return; {14158#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,369 INFO L290 TraceCheckUtils]: 74: Hoare triple {14158#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14180#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,370 INFO L290 TraceCheckUtils]: 75: Hoare triple {14180#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} assume !false; {14180#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,370 INFO L272 TraceCheckUtils]: 76: Hoare triple {14180#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-08 07:46:16,370 INFO L290 TraceCheckUtils]: 77: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-08 07:46:16,370 INFO L290 TraceCheckUtils]: 78: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-08 07:46:16,370 INFO L290 TraceCheckUtils]: 79: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,370 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13944#true} {14180#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} #54#return; {14180#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,371 INFO L290 TraceCheckUtils]: 81: Hoare triple {14180#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14202#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,371 INFO L290 TraceCheckUtils]: 82: Hoare triple {14202#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} assume !false; {14202#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,371 INFO L272 TraceCheckUtils]: 83: Hoare triple {14202#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-08 07:46:16,371 INFO L290 TraceCheckUtils]: 84: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-08 07:46:16,371 INFO L290 TraceCheckUtils]: 85: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-08 07:46:16,371 INFO L290 TraceCheckUtils]: 86: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,372 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13944#true} {14202#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} #54#return; {14202#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,372 INFO L290 TraceCheckUtils]: 88: Hoare triple {14202#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14224#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,372 INFO L290 TraceCheckUtils]: 89: Hoare triple {14224#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} assume !false; {14224#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,373 INFO L272 TraceCheckUtils]: 90: Hoare triple {14224#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-08 07:46:16,373 INFO L290 TraceCheckUtils]: 91: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-08 07:46:16,373 INFO L290 TraceCheckUtils]: 92: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-08 07:46:16,373 INFO L290 TraceCheckUtils]: 93: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,373 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {13944#true} {14224#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} #54#return; {14224#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,374 INFO L290 TraceCheckUtils]: 95: Hoare triple {14224#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14246#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,374 INFO L290 TraceCheckUtils]: 96: Hoare triple {14246#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} assume !false; {14246#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,374 INFO L272 TraceCheckUtils]: 97: Hoare triple {14246#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-08 07:46:16,374 INFO L290 TraceCheckUtils]: 98: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-08 07:46:16,374 INFO L290 TraceCheckUtils]: 99: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-08 07:46:16,374 INFO L290 TraceCheckUtils]: 100: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,375 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {13944#true} {14246#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} #54#return; {14246#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,375 INFO L290 TraceCheckUtils]: 102: Hoare triple {14246#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14268#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-08 07:46:16,375 INFO L290 TraceCheckUtils]: 103: Hoare triple {14268#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !false; {14268#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-08 07:46:16,375 INFO L272 TraceCheckUtils]: 104: Hoare triple {14268#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-08 07:46:16,375 INFO L290 TraceCheckUtils]: 105: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-08 07:46:16,375 INFO L290 TraceCheckUtils]: 106: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-08 07:46:16,376 INFO L290 TraceCheckUtils]: 107: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,376 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {13944#true} {14268#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} #54#return; {14268#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-08 07:46:16,376 INFO L290 TraceCheckUtils]: 109: Hoare triple {14268#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14290#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:46:16,377 INFO L290 TraceCheckUtils]: 110: Hoare triple {14290#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !false; {14290#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:46:16,377 INFO L272 TraceCheckUtils]: 111: Hoare triple {14290#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-08 07:46:16,377 INFO L290 TraceCheckUtils]: 112: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-08 07:46:16,377 INFO L290 TraceCheckUtils]: 113: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-08 07:46:16,377 INFO L290 TraceCheckUtils]: 114: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,377 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {13944#true} {14290#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} #54#return; {14290#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:46:16,378 INFO L290 TraceCheckUtils]: 116: Hoare triple {14290#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14312#(and (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:46:16,378 INFO L290 TraceCheckUtils]: 117: Hoare triple {14312#(and (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} assume !false; {14312#(and (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:46:16,378 INFO L272 TraceCheckUtils]: 118: Hoare triple {14312#(and (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-08 07:46:16,378 INFO L290 TraceCheckUtils]: 119: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-08 07:46:16,378 INFO L290 TraceCheckUtils]: 120: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-08 07:46:16,378 INFO L290 TraceCheckUtils]: 121: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,379 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {13944#true} {14312#(and (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} #54#return; {14312#(and (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:46:16,379 INFO L290 TraceCheckUtils]: 123: Hoare triple {14312#(and (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14334#(and (= (+ main_~y~0 (- 3)) 13) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,380 INFO L290 TraceCheckUtils]: 124: Hoare triple {14334#(and (= (+ main_~y~0 (- 3)) 13) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} assume !false; {14334#(and (= (+ main_~y~0 (- 3)) 13) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,380 INFO L272 TraceCheckUtils]: 125: Hoare triple {14334#(and (= (+ main_~y~0 (- 3)) 13) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-08 07:46:16,380 INFO L290 TraceCheckUtils]: 126: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-08 07:46:16,380 INFO L290 TraceCheckUtils]: 127: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-08 07:46:16,380 INFO L290 TraceCheckUtils]: 128: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,380 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {13944#true} {14334#(and (= (+ main_~y~0 (- 3)) 13) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} #54#return; {14334#(and (= (+ main_~y~0 (- 3)) 13) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:16,381 INFO L290 TraceCheckUtils]: 130: Hoare triple {14334#(and (= (+ main_~y~0 (- 3)) 13) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14356#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-08 07:46:16,382 INFO L290 TraceCheckUtils]: 131: Hoare triple {14356#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} assume !false; {14356#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-08 07:46:16,382 INFO L272 TraceCheckUtils]: 132: Hoare triple {14356#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-08 07:46:16,382 INFO L290 TraceCheckUtils]: 133: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-08 07:46:16,382 INFO L290 TraceCheckUtils]: 134: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-08 07:46:16,382 INFO L290 TraceCheckUtils]: 135: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,382 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {13944#true} {14356#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} #54#return; {14356#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-08 07:46:16,383 INFO L290 TraceCheckUtils]: 137: Hoare triple {14356#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14378#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 07:46:16,383 INFO L290 TraceCheckUtils]: 138: Hoare triple {14378#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !false; {14378#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 07:46:16,383 INFO L272 TraceCheckUtils]: 139: Hoare triple {14378#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-08 07:46:16,383 INFO L290 TraceCheckUtils]: 140: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-08 07:46:16,383 INFO L290 TraceCheckUtils]: 141: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-08 07:46:16,383 INFO L290 TraceCheckUtils]: 142: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,384 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {13944#true} {14378#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} #54#return; {14378#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 07:46:16,384 INFO L290 TraceCheckUtils]: 144: Hoare triple {14378#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14400#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} is VALID [2022-04-08 07:46:16,384 INFO L290 TraceCheckUtils]: 145: Hoare triple {14400#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} assume !false; {14400#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} is VALID [2022-04-08 07:46:16,385 INFO L272 TraceCheckUtils]: 146: Hoare triple {14400#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-08 07:46:16,385 INFO L290 TraceCheckUtils]: 147: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-08 07:46:16,385 INFO L290 TraceCheckUtils]: 148: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-08 07:46:16,385 INFO L290 TraceCheckUtils]: 149: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-08 07:46:16,385 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {13944#true} {14400#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} #54#return; {14400#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} is VALID [2022-04-08 07:46:16,386 INFO L290 TraceCheckUtils]: 151: Hoare triple {14400#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} assume !(~c~0 < ~k~0); {14422#(and (< 18 main_~k~0) (<= main_~k~0 19) (= 19 main_~y~0))} is VALID [2022-04-08 07:46:16,387 INFO L272 TraceCheckUtils]: 152: Hoare triple {14422#(and (< 18 main_~k~0) (<= main_~k~0 19) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14426#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:46:16,387 INFO L290 TraceCheckUtils]: 153: Hoare triple {14426#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14430#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:46:16,388 INFO L290 TraceCheckUtils]: 154: Hoare triple {14430#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13945#false} is VALID [2022-04-08 07:46:16,388 INFO L290 TraceCheckUtils]: 155: Hoare triple {13945#false} assume !false; {13945#false} is VALID [2022-04-08 07:46:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 40 proven. 570 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-04-08 07:46:16,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:46:18,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:46:18,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264900077] [2022-04-08 07:46:18,441 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:46:18,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115310494] [2022-04-08 07:46:18,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115310494] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:46:18,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:46:18,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2022-04-08 07:46:18,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:46:18,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [589011990] [2022-04-08 07:46:18,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [589011990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:46:18,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:46:18,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 07:46:18,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588251211] [2022-04-08 07:46:18,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:46:18,442 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) Word has length 156 [2022-04-08 07:46:18,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:46:18,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 07:46:18,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:18,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 07:46:18,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:18,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 07:46:18,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1613, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 07:46:18,529 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 07:46:22,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:22,248 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2022-04-08 07:46:22,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 07:46:22,249 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) Word has length 156 [2022-04-08 07:46:22,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:46:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 07:46:22,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-08 07:46:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 07:46:22,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-08 07:46:22,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 108 transitions. [2022-04-08 07:46:22,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:22,389 INFO L225 Difference]: With dead ends: 93 [2022-04-08 07:46:22,389 INFO L226 Difference]: Without dead ends: 88 [2022-04-08 07:46:22,390 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=467, Invalid=1789, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 07:46:22,390 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-08 07:46:22,390 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 907 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-08 07:46:22,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-08 07:46:22,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-04-08 07:46:22,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:46:22,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 07:46:22,511 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 07:46:22,511 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 07:46:22,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:22,513 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-08 07:46:22,513 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-08 07:46:22,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:22,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:22,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 88 states. [2022-04-08 07:46:22,514 INFO L87 Difference]: Start difference. First operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 88 states. [2022-04-08 07:46:22,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:22,516 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-08 07:46:22,516 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-08 07:46:22,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:22,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:22,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:46:22,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:46:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 07:46:22,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2022-04-08 07:46:22,521 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 156 [2022-04-08 07:46:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:46:22,521 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2022-04-08 07:46:22,521 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 07:46:22,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 107 transitions. [2022-04-08 07:46:22,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-08 07:46:22,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-08 07:46:22,720 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:46:22,720 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:46:22,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-08 07:46:22,923 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-08 07:46:22,924 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:46:22,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:46:22,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1670771305, now seen corresponding path program 39 times [2022-04-08 07:46:22,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:22,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [931174571] [2022-04-08 07:46:23,001 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:46:23,002 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:46:23,002 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:46:23,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1670771305, now seen corresponding path program 40 times [2022-04-08 07:46:23,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:46:23,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316296290] [2022-04-08 07:46:23,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:46:23,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:46:23,024 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:46:23,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1914226017] [2022-04-08 07:46:23,024 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:46:23,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:46:23,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:46:23,026 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:46:23,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-08 07:46:23,520 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:46:23,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:46:23,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 88 conjunts are in the unsatisfiable core [2022-04-08 07:46:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:46:23,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:46:24,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {15416#true} call ULTIMATE.init(); {15416#true} is VALID [2022-04-08 07:46:24,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {15416#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {15416#true} is VALID [2022-04-08 07:46:24,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15416#true} {15416#true} #60#return; {15416#true} is VALID [2022-04-08 07:46:24,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {15416#true} call #t~ret5 := main(); {15416#true} is VALID [2022-04-08 07:46:24,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {15416#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {15416#true} is VALID [2022-04-08 07:46:24,460 INFO L272 TraceCheckUtils]: 6: Hoare triple {15416#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,461 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15416#true} {15416#true} #52#return; {15416#true} is VALID [2022-04-08 07:46:24,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {15416#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {15454#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:24,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {15454#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {15454#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:24,461 INFO L272 TraceCheckUtils]: 13: Hoare triple {15454#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,462 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15416#true} {15454#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {15454#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:24,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {15454#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15476#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:46:24,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {15476#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {15476#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:46:24,463 INFO L272 TraceCheckUtils]: 20: Hoare triple {15476#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,463 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {15416#true} {15476#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {15476#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:46:24,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {15476#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15498#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:46:24,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {15498#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {15498#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:46:24,464 INFO L272 TraceCheckUtils]: 27: Hoare triple {15498#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,465 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15416#true} {15498#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {15498#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:46:24,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {15498#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15520#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 07:46:24,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {15520#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {15520#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 07:46:24,465 INFO L272 TraceCheckUtils]: 34: Hoare triple {15520#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,466 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {15416#true} {15520#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #54#return; {15520#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 07:46:24,466 INFO L290 TraceCheckUtils]: 39: Hoare triple {15520#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15542#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:46:24,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {15542#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {15542#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:46:24,467 INFO L272 TraceCheckUtils]: 41: Hoare triple {15542#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,467 INFO L290 TraceCheckUtils]: 42: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,467 INFO L290 TraceCheckUtils]: 43: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,467 INFO L290 TraceCheckUtils]: 44: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,467 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {15416#true} {15542#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {15542#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:46:24,468 INFO L290 TraceCheckUtils]: 46: Hoare triple {15542#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15564#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 07:46:24,468 INFO L290 TraceCheckUtils]: 47: Hoare triple {15564#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {15564#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 07:46:24,468 INFO L272 TraceCheckUtils]: 48: Hoare triple {15564#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,468 INFO L290 TraceCheckUtils]: 49: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,468 INFO L290 TraceCheckUtils]: 50: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,468 INFO L290 TraceCheckUtils]: 51: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,469 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15416#true} {15564#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {15564#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 07:46:24,469 INFO L290 TraceCheckUtils]: 53: Hoare triple {15564#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15586#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:46:24,469 INFO L290 TraceCheckUtils]: 54: Hoare triple {15586#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {15586#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:46:24,470 INFO L272 TraceCheckUtils]: 55: Hoare triple {15586#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,470 INFO L290 TraceCheckUtils]: 56: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,470 INFO L290 TraceCheckUtils]: 57: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,470 INFO L290 TraceCheckUtils]: 58: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,470 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15416#true} {15586#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {15586#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:46:24,470 INFO L290 TraceCheckUtils]: 60: Hoare triple {15586#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15608#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:46:24,471 INFO L290 TraceCheckUtils]: 61: Hoare triple {15608#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {15608#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:46:24,471 INFO L272 TraceCheckUtils]: 62: Hoare triple {15608#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,471 INFO L290 TraceCheckUtils]: 63: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,471 INFO L290 TraceCheckUtils]: 64: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,471 INFO L290 TraceCheckUtils]: 65: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,471 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15416#true} {15608#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {15608#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:46:24,472 INFO L290 TraceCheckUtils]: 67: Hoare triple {15608#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15630#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:46:24,472 INFO L290 TraceCheckUtils]: 68: Hoare triple {15630#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !false; {15630#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:46:24,472 INFO L272 TraceCheckUtils]: 69: Hoare triple {15630#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,472 INFO L290 TraceCheckUtils]: 70: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,472 INFO L290 TraceCheckUtils]: 71: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,472 INFO L290 TraceCheckUtils]: 72: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,473 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15416#true} {15630#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} #54#return; {15630#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:46:24,473 INFO L290 TraceCheckUtils]: 74: Hoare triple {15630#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15652#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 07:46:24,473 INFO L290 TraceCheckUtils]: 75: Hoare triple {15652#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} assume !false; {15652#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 07:46:24,474 INFO L272 TraceCheckUtils]: 76: Hoare triple {15652#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,474 INFO L290 TraceCheckUtils]: 77: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,474 INFO L290 TraceCheckUtils]: 78: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,474 INFO L290 TraceCheckUtils]: 79: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,474 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15416#true} {15652#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} #54#return; {15652#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 07:46:24,474 INFO L290 TraceCheckUtils]: 81: Hoare triple {15652#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15674#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:46:24,475 INFO L290 TraceCheckUtils]: 82: Hoare triple {15674#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} assume !false; {15674#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:46:24,475 INFO L272 TraceCheckUtils]: 83: Hoare triple {15674#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,475 INFO L290 TraceCheckUtils]: 84: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,475 INFO L290 TraceCheckUtils]: 85: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,475 INFO L290 TraceCheckUtils]: 86: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,475 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {15416#true} {15674#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} #54#return; {15674#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:46:24,476 INFO L290 TraceCheckUtils]: 88: Hoare triple {15674#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15696#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-08 07:46:24,476 INFO L290 TraceCheckUtils]: 89: Hoare triple {15696#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} assume !false; {15696#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-08 07:46:24,476 INFO L272 TraceCheckUtils]: 90: Hoare triple {15696#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,476 INFO L290 TraceCheckUtils]: 91: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,476 INFO L290 TraceCheckUtils]: 92: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,476 INFO L290 TraceCheckUtils]: 93: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,477 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {15416#true} {15696#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} #54#return; {15696#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-08 07:46:24,477 INFO L290 TraceCheckUtils]: 95: Hoare triple {15696#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15718#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 07:46:24,477 INFO L290 TraceCheckUtils]: 96: Hoare triple {15718#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {15718#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 07:46:24,478 INFO L272 TraceCheckUtils]: 97: Hoare triple {15718#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,478 INFO L290 TraceCheckUtils]: 98: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,478 INFO L290 TraceCheckUtils]: 99: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,478 INFO L290 TraceCheckUtils]: 100: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,478 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {15416#true} {15718#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {15718#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 07:46:24,479 INFO L290 TraceCheckUtils]: 102: Hoare triple {15718#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15740#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:46:24,479 INFO L290 TraceCheckUtils]: 103: Hoare triple {15740#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {15740#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:46:24,479 INFO L272 TraceCheckUtils]: 104: Hoare triple {15740#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,479 INFO L290 TraceCheckUtils]: 105: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,479 INFO L290 TraceCheckUtils]: 106: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,479 INFO L290 TraceCheckUtils]: 107: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,479 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {15416#true} {15740#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {15740#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:46:24,480 INFO L290 TraceCheckUtils]: 109: Hoare triple {15740#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15762#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 07:46:24,480 INFO L290 TraceCheckUtils]: 110: Hoare triple {15762#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !false; {15762#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 07:46:24,480 INFO L272 TraceCheckUtils]: 111: Hoare triple {15762#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,480 INFO L290 TraceCheckUtils]: 112: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,480 INFO L290 TraceCheckUtils]: 113: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,480 INFO L290 TraceCheckUtils]: 114: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,481 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {15416#true} {15762#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} #54#return; {15762#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 07:46:24,481 INFO L290 TraceCheckUtils]: 116: Hoare triple {15762#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15784#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:46:24,482 INFO L290 TraceCheckUtils]: 117: Hoare triple {15784#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {15784#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:46:24,482 INFO L272 TraceCheckUtils]: 118: Hoare triple {15784#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,482 INFO L290 TraceCheckUtils]: 119: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,482 INFO L290 TraceCheckUtils]: 120: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,482 INFO L290 TraceCheckUtils]: 121: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,482 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {15416#true} {15784#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #54#return; {15784#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:46:24,483 INFO L290 TraceCheckUtils]: 123: Hoare triple {15784#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15806#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 07:46:24,483 INFO L290 TraceCheckUtils]: 124: Hoare triple {15806#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} assume !false; {15806#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 07:46:24,483 INFO L272 TraceCheckUtils]: 125: Hoare triple {15806#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,483 INFO L290 TraceCheckUtils]: 126: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,483 INFO L290 TraceCheckUtils]: 127: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,483 INFO L290 TraceCheckUtils]: 128: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,484 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {15416#true} {15806#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} #54#return; {15806#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 07:46:24,484 INFO L290 TraceCheckUtils]: 130: Hoare triple {15806#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15828#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-08 07:46:24,484 INFO L290 TraceCheckUtils]: 131: Hoare triple {15828#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !false; {15828#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-08 07:46:24,484 INFO L272 TraceCheckUtils]: 132: Hoare triple {15828#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,484 INFO L290 TraceCheckUtils]: 133: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,484 INFO L290 TraceCheckUtils]: 134: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,484 INFO L290 TraceCheckUtils]: 135: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,485 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {15416#true} {15828#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} #54#return; {15828#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-08 07:46:24,485 INFO L290 TraceCheckUtils]: 137: Hoare triple {15828#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15850#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 07:46:24,486 INFO L290 TraceCheckUtils]: 138: Hoare triple {15850#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {15850#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 07:46:24,486 INFO L272 TraceCheckUtils]: 139: Hoare triple {15850#(and (= main_~c~0 18) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,486 INFO L290 TraceCheckUtils]: 140: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,486 INFO L290 TraceCheckUtils]: 141: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,486 INFO L290 TraceCheckUtils]: 142: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,487 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {15416#true} {15850#(and (= main_~c~0 18) (= main_~y~0 18))} #54#return; {15850#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 07:46:24,488 INFO L290 TraceCheckUtils]: 144: Hoare triple {15850#(and (= main_~c~0 18) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15872#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 07:46:24,488 INFO L290 TraceCheckUtils]: 145: Hoare triple {15872#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} assume !false; {15872#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 07:46:24,488 INFO L272 TraceCheckUtils]: 146: Hoare triple {15872#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,488 INFO L290 TraceCheckUtils]: 147: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,489 INFO L290 TraceCheckUtils]: 148: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,489 INFO L290 TraceCheckUtils]: 149: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,489 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {15416#true} {15872#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} #54#return; {15872#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 07:46:24,490 INFO L290 TraceCheckUtils]: 151: Hoare triple {15872#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15894#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-08 07:46:24,490 INFO L290 TraceCheckUtils]: 152: Hoare triple {15894#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} assume !false; {15894#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-08 07:46:24,490 INFO L272 TraceCheckUtils]: 153: Hoare triple {15894#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-08 07:46:24,491 INFO L290 TraceCheckUtils]: 154: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-08 07:46:24,491 INFO L290 TraceCheckUtils]: 155: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-08 07:46:24,491 INFO L290 TraceCheckUtils]: 156: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-08 07:46:24,491 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {15416#true} {15894#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} #54#return; {15894#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-08 07:46:24,492 INFO L290 TraceCheckUtils]: 158: Hoare triple {15894#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} assume !(~c~0 < ~k~0); {15916#(and (<= main_~k~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-08 07:46:24,493 INFO L272 TraceCheckUtils]: 159: Hoare triple {15916#(and (<= main_~k~0 20) (< 19 main_~k~0) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15920#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:46:24,493 INFO L290 TraceCheckUtils]: 160: Hoare triple {15920#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15924#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:46:24,494 INFO L290 TraceCheckUtils]: 161: Hoare triple {15924#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15417#false} is VALID [2022-04-08 07:46:24,494 INFO L290 TraceCheckUtils]: 162: Hoare triple {15417#false} assume !false; {15417#false} is VALID [2022-04-08 07:46:24,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 42 proven. 630 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-08 07:46:24,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:46:24,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:46:24,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316296290] [2022-04-08 07:46:24,795 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:46:24,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914226017] [2022-04-08 07:46:24,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914226017] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:46:24,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:46:24,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2022-04-08 07:46:24,795 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:46:24,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [931174571] [2022-04-08 07:46:24,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [931174571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:46:24,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:46:24,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 07:46:24,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581243883] [2022-04-08 07:46:24,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:46:24,796 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) Word has length 163 [2022-04-08 07:46:24,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:46:24,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-08 07:46:24,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:24,888 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 07:46:24,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:24,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 07:46:24,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-04-08 07:46:24,888 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-08 07:46:28,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:28,864 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-04-08 07:46:28,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 07:46:28,865 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) Word has length 163 [2022-04-08 07:46:28,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:46:28,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-08 07:46:28,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 112 transitions. [2022-04-08 07:46:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-08 07:46:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 112 transitions. [2022-04-08 07:46:28,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 112 transitions. [2022-04-08 07:46:28,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:28,978 INFO L225 Difference]: With dead ends: 96 [2022-04-08 07:46:28,978 INFO L226 Difference]: Without dead ends: 91 [2022-04-08 07:46:28,978 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2022-04-08 07:46:28,978 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-08 07:46:28,979 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 989 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-08 07:46:28,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-08 07:46:29,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-08 07:46:29,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:46:29,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 07:46:29,115 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 07:46:29,115 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 07:46:29,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:29,117 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-08 07:46:29,118 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-08 07:46:29,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:29,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:29,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 91 states. [2022-04-08 07:46:29,118 INFO L87 Difference]: Start difference. First operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 91 states. [2022-04-08 07:46:29,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:29,120 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-08 07:46:29,121 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-08 07:46:29,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:29,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:29,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:46:29,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:46:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 07:46:29,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2022-04-08 07:46:29,124 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 163 [2022-04-08 07:46:29,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:46:29,124 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2022-04-08 07:46:29,124 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-08 07:46:29,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 111 transitions. [2022-04-08 07:46:29,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:29,355 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-08 07:46:29,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-04-08 07:46:29,356 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:46:29,356 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:46:29,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-08 07:46:29,557 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:46:29,557 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:46:29,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:46:29,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1329797496, now seen corresponding path program 41 times [2022-04-08 07:46:29,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:29,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [937542865] [2022-04-08 07:46:29,629 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:46:29,629 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:46:29,629 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:46:29,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1329797496, now seen corresponding path program 42 times [2022-04-08 07:46:29,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:46:29,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739066383] [2022-04-08 07:46:29,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:46:29,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:46:29,646 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:46:29,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [820923041] [2022-04-08 07:46:29,646 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:46:29,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:46:29,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:46:29,647 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:46:29,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-08 07:46:30,393 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-08 07:46:30,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:46:30,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 07:46:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:46:30,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:46:31,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {16532#true} call ULTIMATE.init(); {16532#true} is VALID [2022-04-08 07:46:31,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {16532#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {16532#true} is VALID [2022-04-08 07:46:31,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16532#true} {16532#true} #60#return; {16532#true} is VALID [2022-04-08 07:46:31,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {16532#true} call #t~ret5 := main(); {16532#true} is VALID [2022-04-08 07:46:31,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {16532#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {16532#true} is VALID [2022-04-08 07:46:31,737 INFO L272 TraceCheckUtils]: 6: Hoare triple {16532#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {16532#true} ~cond := #in~cond; {16558#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 07:46:31,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {16558#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {16562#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:46:31,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {16562#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {16562#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:46:31,738 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16562#(not (= |assume_abort_if_not_#in~cond| 0))} {16532#true} #52#return; {16569#(and (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-08 07:46:31,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {16569#(and (<= main_~k~0 20) (<= 0 main_~k~0))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {16573#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-08 07:46:31,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {16573#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0))} assume !false; {16573#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-08 07:46:31,739 INFO L272 TraceCheckUtils]: 13: Hoare triple {16573#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-08 07:46:31,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-08 07:46:31,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,739 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16532#true} {16573#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0))} #54#return; {16573#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-08 07:46:31,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {16573#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16595#(and (<= 1 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-08 07:46:31,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {16595#(and (<= 1 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !false; {16595#(and (<= 1 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-08 07:46:31,742 INFO L272 TraceCheckUtils]: 20: Hoare triple {16595#(and (<= 1 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-08 07:46:31,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-08 07:46:31,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,743 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {16532#true} {16595#(and (<= 1 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} #54#return; {16595#(and (<= 1 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-08 07:46:31,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {16595#(and (<= 1 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16617#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-08 07:46:31,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {16617#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !false; {16617#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-08 07:46:31,746 INFO L272 TraceCheckUtils]: 27: Hoare triple {16617#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,747 INFO L290 TraceCheckUtils]: 28: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-08 07:46:31,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-08 07:46:31,747 INFO L290 TraceCheckUtils]: 30: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,747 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16532#true} {16617#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} #54#return; {16617#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-08 07:46:31,749 INFO L290 TraceCheckUtils]: 32: Hoare triple {16617#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16639#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-08 07:46:31,749 INFO L290 TraceCheckUtils]: 33: Hoare triple {16639#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 3 main_~c~0))} assume !false; {16639#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-08 07:46:31,749 INFO L272 TraceCheckUtils]: 34: Hoare triple {16639#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 3 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-08 07:46:31,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-08 07:46:31,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,750 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {16532#true} {16639#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 3 main_~c~0))} #54#return; {16639#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-08 07:46:31,751 INFO L290 TraceCheckUtils]: 39: Hoare triple {16639#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 3 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16661#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-08 07:46:31,752 INFO L290 TraceCheckUtils]: 40: Hoare triple {16661#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 4 main_~c~0))} assume !false; {16661#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-08 07:46:31,752 INFO L272 TraceCheckUtils]: 41: Hoare triple {16661#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 4 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,752 INFO L290 TraceCheckUtils]: 42: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-08 07:46:31,752 INFO L290 TraceCheckUtils]: 43: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-08 07:46:31,752 INFO L290 TraceCheckUtils]: 44: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,753 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16532#true} {16661#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 4 main_~c~0))} #54#return; {16661#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-08 07:46:31,754 INFO L290 TraceCheckUtils]: 46: Hoare triple {16661#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 4 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-08 07:46:31,754 INFO L290 TraceCheckUtils]: 47: Hoare triple {16683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !false; {16683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-08 07:46:31,755 INFO L272 TraceCheckUtils]: 48: Hoare triple {16683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,755 INFO L290 TraceCheckUtils]: 49: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-08 07:46:31,755 INFO L290 TraceCheckUtils]: 50: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-08 07:46:31,755 INFO L290 TraceCheckUtils]: 51: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,755 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16532#true} {16683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 5 main_~c~0))} #54#return; {16683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-08 07:46:31,757 INFO L290 TraceCheckUtils]: 53: Hoare triple {16683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16705#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-08 07:46:31,757 INFO L290 TraceCheckUtils]: 54: Hoare triple {16705#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} assume !false; {16705#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-08 07:46:31,757 INFO L272 TraceCheckUtils]: 55: Hoare triple {16705#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,758 INFO L290 TraceCheckUtils]: 56: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-08 07:46:31,758 INFO L290 TraceCheckUtils]: 57: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-08 07:46:31,758 INFO L290 TraceCheckUtils]: 58: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,758 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16532#true} {16705#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} #54#return; {16705#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-08 07:46:31,760 INFO L290 TraceCheckUtils]: 60: Hoare triple {16705#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16727#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-08 07:46:31,761 INFO L290 TraceCheckUtils]: 61: Hoare triple {16727#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} assume !false; {16727#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-08 07:46:31,761 INFO L272 TraceCheckUtils]: 62: Hoare triple {16727#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,761 INFO L290 TraceCheckUtils]: 63: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-08 07:46:31,761 INFO L290 TraceCheckUtils]: 64: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-08 07:46:31,761 INFO L290 TraceCheckUtils]: 65: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,761 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16532#true} {16727#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} #54#return; {16727#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-08 07:46:31,762 INFO L290 TraceCheckUtils]: 67: Hoare triple {16727#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-08 07:46:31,763 INFO L290 TraceCheckUtils]: 68: Hoare triple {16749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 8 main_~c~0))} assume !false; {16749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-08 07:46:31,763 INFO L272 TraceCheckUtils]: 69: Hoare triple {16749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 8 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,763 INFO L290 TraceCheckUtils]: 70: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-08 07:46:31,763 INFO L290 TraceCheckUtils]: 71: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-08 07:46:31,763 INFO L290 TraceCheckUtils]: 72: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,763 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16532#true} {16749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 8 main_~c~0))} #54#return; {16749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-08 07:46:31,765 INFO L290 TraceCheckUtils]: 74: Hoare triple {16749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 8 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16771#(and (<= 9 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-08 07:46:31,765 INFO L290 TraceCheckUtils]: 75: Hoare triple {16771#(and (<= 9 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !false; {16771#(and (<= 9 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-08 07:46:31,765 INFO L272 TraceCheckUtils]: 76: Hoare triple {16771#(and (<= 9 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,765 INFO L290 TraceCheckUtils]: 77: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-08 07:46:31,765 INFO L290 TraceCheckUtils]: 78: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-08 07:46:31,766 INFO L290 TraceCheckUtils]: 79: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,766 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {16532#true} {16771#(and (<= 9 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} #54#return; {16771#(and (<= 9 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-08 07:46:31,767 INFO L290 TraceCheckUtils]: 81: Hoare triple {16771#(and (<= 9 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16793#(and (<= 10 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-08 07:46:31,768 INFO L290 TraceCheckUtils]: 82: Hoare triple {16793#(and (<= 10 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !false; {16793#(and (<= 10 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-08 07:46:31,768 INFO L272 TraceCheckUtils]: 83: Hoare triple {16793#(and (<= 10 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,768 INFO L290 TraceCheckUtils]: 84: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-08 07:46:31,768 INFO L290 TraceCheckUtils]: 85: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-08 07:46:31,768 INFO L290 TraceCheckUtils]: 86: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,769 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {16532#true} {16793#(and (<= 10 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} #54#return; {16793#(and (<= 10 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-08 07:46:31,770 INFO L290 TraceCheckUtils]: 88: Hoare triple {16793#(and (<= 10 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16815#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-08 07:46:31,770 INFO L290 TraceCheckUtils]: 89: Hoare triple {16815#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !false; {16815#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-08 07:46:31,770 INFO L272 TraceCheckUtils]: 90: Hoare triple {16815#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,770 INFO L290 TraceCheckUtils]: 91: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-08 07:46:31,770 INFO L290 TraceCheckUtils]: 92: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-08 07:46:31,770 INFO L290 TraceCheckUtils]: 93: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,771 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {16532#true} {16815#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} #54#return; {16815#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-08 07:46:31,772 INFO L290 TraceCheckUtils]: 95: Hoare triple {16815#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16837#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0))} is VALID [2022-04-08 07:46:31,772 INFO L290 TraceCheckUtils]: 96: Hoare triple {16837#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0))} assume !false; {16837#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0))} is VALID [2022-04-08 07:46:31,773 INFO L272 TraceCheckUtils]: 97: Hoare triple {16837#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,773 INFO L290 TraceCheckUtils]: 98: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-08 07:46:31,773 INFO L290 TraceCheckUtils]: 99: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-08 07:46:31,773 INFO L290 TraceCheckUtils]: 100: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,773 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {16532#true} {16837#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0))} #54#return; {16837#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0))} is VALID [2022-04-08 07:46:31,774 INFO L290 TraceCheckUtils]: 102: Hoare triple {16837#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16859#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0))} is VALID [2022-04-08 07:46:31,775 INFO L290 TraceCheckUtils]: 103: Hoare triple {16859#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0))} assume !false; {16859#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0))} is VALID [2022-04-08 07:46:31,775 INFO L272 TraceCheckUtils]: 104: Hoare triple {16859#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,775 INFO L290 TraceCheckUtils]: 105: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-08 07:46:31,775 INFO L290 TraceCheckUtils]: 106: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-08 07:46:31,775 INFO L290 TraceCheckUtils]: 107: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,775 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {16532#true} {16859#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0))} #54#return; {16859#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0))} is VALID [2022-04-08 07:46:31,776 INFO L290 TraceCheckUtils]: 109: Hoare triple {16859#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16881#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} is VALID [2022-04-08 07:46:31,776 INFO L290 TraceCheckUtils]: 110: Hoare triple {16881#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} assume !false; {16881#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} is VALID [2022-04-08 07:46:31,777 INFO L272 TraceCheckUtils]: 111: Hoare triple {16881#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,777 INFO L290 TraceCheckUtils]: 112: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-08 07:46:31,777 INFO L290 TraceCheckUtils]: 113: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-08 07:46:31,777 INFO L290 TraceCheckUtils]: 114: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,777 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {16532#true} {16881#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} #54#return; {16881#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} is VALID [2022-04-08 07:46:31,779 INFO L290 TraceCheckUtils]: 116: Hoare triple {16881#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16903#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 15 main_~c~0))} is VALID [2022-04-08 07:46:31,779 INFO L290 TraceCheckUtils]: 117: Hoare triple {16903#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 15 main_~c~0))} assume !false; {16903#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 15 main_~c~0))} is VALID [2022-04-08 07:46:31,779 INFO L272 TraceCheckUtils]: 118: Hoare triple {16903#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 15 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,779 INFO L290 TraceCheckUtils]: 119: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-08 07:46:31,779 INFO L290 TraceCheckUtils]: 120: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-08 07:46:31,779 INFO L290 TraceCheckUtils]: 121: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,780 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {16532#true} {16903#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 15 main_~c~0))} #54#return; {16903#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 15 main_~c~0))} is VALID [2022-04-08 07:46:31,782 INFO L290 TraceCheckUtils]: 123: Hoare triple {16903#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 15 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16925#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 16 main_~c~0))} is VALID [2022-04-08 07:46:31,782 INFO L290 TraceCheckUtils]: 124: Hoare triple {16925#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 16 main_~c~0))} assume !false; {16925#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 16 main_~c~0))} is VALID [2022-04-08 07:46:31,782 INFO L272 TraceCheckUtils]: 125: Hoare triple {16925#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 16 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,782 INFO L290 TraceCheckUtils]: 126: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-08 07:46:31,782 INFO L290 TraceCheckUtils]: 127: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-08 07:46:31,782 INFO L290 TraceCheckUtils]: 128: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,783 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {16532#true} {16925#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 16 main_~c~0))} #54#return; {16925#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 16 main_~c~0))} is VALID [2022-04-08 07:46:31,784 INFO L290 TraceCheckUtils]: 130: Hoare triple {16925#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 16 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 17 main_~c~0))} is VALID [2022-04-08 07:46:31,784 INFO L290 TraceCheckUtils]: 131: Hoare triple {16947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 17 main_~c~0))} assume !false; {16947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 17 main_~c~0))} is VALID [2022-04-08 07:46:31,784 INFO L272 TraceCheckUtils]: 132: Hoare triple {16947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 17 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,784 INFO L290 TraceCheckUtils]: 133: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-08 07:46:31,784 INFO L290 TraceCheckUtils]: 134: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-08 07:46:31,784 INFO L290 TraceCheckUtils]: 135: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,785 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {16532#true} {16947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 17 main_~c~0))} #54#return; {16947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 17 main_~c~0))} is VALID [2022-04-08 07:46:31,786 INFO L290 TraceCheckUtils]: 137: Hoare triple {16947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 17 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16969#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-08 07:46:31,786 INFO L290 TraceCheckUtils]: 138: Hoare triple {16969#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !false; {16969#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-08 07:46:31,786 INFO L272 TraceCheckUtils]: 139: Hoare triple {16969#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,786 INFO L290 TraceCheckUtils]: 140: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-08 07:46:31,786 INFO L290 TraceCheckUtils]: 141: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-08 07:46:31,787 INFO L290 TraceCheckUtils]: 142: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,787 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {16532#true} {16969#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} #54#return; {16969#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-08 07:46:31,789 INFO L290 TraceCheckUtils]: 144: Hoare triple {16969#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16991#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0))} is VALID [2022-04-08 07:46:31,789 INFO L290 TraceCheckUtils]: 145: Hoare triple {16991#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0))} assume !false; {16991#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0))} is VALID [2022-04-08 07:46:31,789 INFO L272 TraceCheckUtils]: 146: Hoare triple {16991#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,789 INFO L290 TraceCheckUtils]: 147: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-08 07:46:31,789 INFO L290 TraceCheckUtils]: 148: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-08 07:46:31,789 INFO L290 TraceCheckUtils]: 149: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,790 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {16532#true} {16991#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0))} #54#return; {16991#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0))} is VALID [2022-04-08 07:46:31,791 INFO L290 TraceCheckUtils]: 151: Hoare triple {16991#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17013#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 20 main_~c~0))} is VALID [2022-04-08 07:46:31,792 INFO L290 TraceCheckUtils]: 152: Hoare triple {17013#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 20 main_~c~0))} assume !false; {17013#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 20 main_~c~0))} is VALID [2022-04-08 07:46:31,792 INFO L272 TraceCheckUtils]: 153: Hoare triple {17013#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 20 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-08 07:46:31,792 INFO L290 TraceCheckUtils]: 154: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-08 07:46:31,792 INFO L290 TraceCheckUtils]: 155: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-08 07:46:31,792 INFO L290 TraceCheckUtils]: 156: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-08 07:46:31,792 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {16532#true} {17013#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 20 main_~c~0))} #54#return; {17013#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 20 main_~c~0))} is VALID [2022-04-08 07:46:31,794 INFO L290 TraceCheckUtils]: 158: Hoare triple {17013#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 20 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16533#false} is VALID [2022-04-08 07:46:31,794 INFO L290 TraceCheckUtils]: 159: Hoare triple {16533#false} assume !false; {16533#false} is VALID [2022-04-08 07:46:31,794 INFO L272 TraceCheckUtils]: 160: Hoare triple {16533#false} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16533#false} is VALID [2022-04-08 07:46:31,794 INFO L290 TraceCheckUtils]: 161: Hoare triple {16533#false} ~cond := #in~cond; {16533#false} is VALID [2022-04-08 07:46:31,794 INFO L290 TraceCheckUtils]: 162: Hoare triple {16533#false} assume !(0 == ~cond); {16533#false} is VALID [2022-04-08 07:46:31,794 INFO L290 TraceCheckUtils]: 163: Hoare triple {16533#false} assume true; {16533#false} is VALID [2022-04-08 07:46:31,794 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {16533#false} {16533#false} #54#return; {16533#false} is VALID [2022-04-08 07:46:31,794 INFO L290 TraceCheckUtils]: 165: Hoare triple {16533#false} assume !(~c~0 < ~k~0); {16533#false} is VALID [2022-04-08 07:46:31,794 INFO L272 TraceCheckUtils]: 166: Hoare triple {16533#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16533#false} is VALID [2022-04-08 07:46:31,794 INFO L290 TraceCheckUtils]: 167: Hoare triple {16533#false} ~cond := #in~cond; {16533#false} is VALID [2022-04-08 07:46:31,795 INFO L290 TraceCheckUtils]: 168: Hoare triple {16533#false} assume 0 == ~cond; {16533#false} is VALID [2022-04-08 07:46:31,795 INFO L290 TraceCheckUtils]: 169: Hoare triple {16533#false} assume !false; {16533#false} is VALID [2022-04-08 07:46:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 819 proven. 0 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2022-04-08 07:46:31,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:46:31,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:46:31,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739066383] [2022-04-08 07:46:31,796 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:46:31,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820923041] [2022-04-08 07:46:31,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820923041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:46:31,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:46:31,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 07:46:31,796 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:46:31,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [937542865] [2022-04-08 07:46:31,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [937542865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:46:31,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:46:31,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 07:46:31,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30158929] [2022-04-08 07:46:31,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:46:31,797 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 23 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) Word has length 170 [2022-04-08 07:46:31,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:46:31,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 23 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-08 07:46:31,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:31,903 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 07:46:31,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:31,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 07:46:31,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2022-04-08 07:46:31,903 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 23 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-08 07:46:33,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:33,311 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2022-04-08 07:46:33,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 07:46:33,311 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 23 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) Word has length 170 [2022-04-08 07:46:33,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:46:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 23 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-08 07:46:33,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 110 transitions. [2022-04-08 07:46:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 23 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-08 07:46:33,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 110 transitions. [2022-04-08 07:46:33,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 110 transitions. [2022-04-08 07:46:33,448 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 07:46:33,448 INFO L225 Difference]: With dead ends: 95 [2022-04-08 07:46:33,448 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 07:46:33,449 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=284, Invalid=418, Unknown=0, NotChecked=0, Total=702 [2022-04-08 07:46:33,449 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 07:46:33,449 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 548 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 07:46:33,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 07:46:33,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 07:46:33,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:46:33,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 07:46:33,450 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 07:46:33,450 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 07:46:33,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:33,450 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 07:46:33,450 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 07:46:33,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:33,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:33,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 07:46:33,450 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 07:46:33,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:33,450 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 07:46:33,450 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 07:46:33,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:33,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:33,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:46:33,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:46:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 07:46:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 07:46:33,451 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 170 [2022-04-08 07:46:33,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:46:33,451 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 07:46:33,451 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 23 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-08 07:46:33,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 07:46:33,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:33,451 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 07:46:33,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:33,454 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 07:46:33,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-08 07:46:33,661 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:46:33,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 07:46:35,627 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 07:46:35,627 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 07:46:35,627 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 07:46:35,627 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-08 07:46:35,628 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-08 07:46:35,628 INFO L878 garLoopResultBuilder]: At program point L7-2(lines 6 8) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-08 07:46:35,628 INFO L878 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 6 8) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-08 07:46:35,628 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 17 40) the Hoare annotation is: true [2022-04-08 07:46:35,628 INFO L878 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 20)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and .cse0 (= main_~c~0 16) (= main_~y~0 16) .cse1 (< 15 main_~k~0)) (and (= 7 main_~y~0) (= 7 main_~c~0) .cse0 .cse1 (< 6 main_~k~0)) (and (= main_~y~0 9) .cse0 (= main_~c~0 9) (< 8 main_~k~0) .cse1) (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and (< 7 main_~k~0) (= main_~y~0 8) .cse0 (= main_~c~0 8) .cse1) (and (= main_~c~0 17) .cse0 .cse1 (< 16 main_~k~0) (= main_~y~0 17)) (and (= main_~y~0 12) .cse0 (= main_~c~0 12) (< 11 main_~k~0) .cse1) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and (< 17 main_~k~0) .cse0 (= main_~c~0 18) .cse1 (= main_~y~0 18)) (and .cse0 (= 5 main_~c~0) (= 5 main_~y~0) .cse1 (< 4 main_~k~0)) (and .cse0 (= main_~y~0 10) (< 9 main_~k~0) (= main_~c~0 10) .cse1) (and .cse0 (< 18 main_~k~0) (= 19 main_~y~0) .cse1 (= 19 main_~c~0)) (and (= main_~c~0 15) .cse0 (= main_~y~0 15) (< 14 main_~k~0) .cse1) (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and (<= main_~c~0 20) .cse0 (< 19 main_~k~0) (= main_~y~0 20) (<= 20 main_~c~0) .cse1) (and (= main_~y~0 2) (< 1 main_~k~0) .cse0 (= main_~c~0 2) .cse1) (and (< 12 main_~k~0) .cse0 (= main_~c~0 13) (= main_~y~0 13) .cse1) (and (< 10 main_~k~0) .cse0 (= main_~c~0 11) (= main_~y~0 11) .cse1) (and (= main_~y~0 6) .cse0 (= main_~c~0 6) (< 5 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3)) (and (= main_~y~0 14) .cse0 (< 13 main_~k~0) (= main_~c~0 14) .cse1))) [2022-04-08 07:46:35,628 INFO L878 garLoopResultBuilder]: At program point L28-1(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 20)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and .cse0 (= main_~c~0 16) (= main_~y~0 16) .cse1 (< 15 main_~k~0)) (and (= 7 main_~y~0) (= 7 main_~c~0) .cse0 .cse1 (< 6 main_~k~0)) (and (= main_~y~0 9) .cse0 (= main_~c~0 9) (< 8 main_~k~0) .cse1) (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and (< 7 main_~k~0) (= main_~y~0 8) .cse0 (= main_~c~0 8) .cse1) (and (= main_~c~0 17) .cse0 .cse1 (< 16 main_~k~0) (= main_~y~0 17)) (and (= main_~y~0 12) .cse0 (= main_~c~0 12) (< 11 main_~k~0) .cse1) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and (< 17 main_~k~0) .cse0 (= main_~c~0 18) .cse1 (= main_~y~0 18)) (and .cse0 (= 5 main_~c~0) (= 5 main_~y~0) .cse1 (< 4 main_~k~0)) (and .cse0 (= main_~y~0 10) (< 9 main_~k~0) (= main_~c~0 10) .cse1) (and .cse0 (< 18 main_~k~0) (= 19 main_~y~0) .cse1 (= 19 main_~c~0)) (and (= main_~c~0 15) .cse0 (= main_~y~0 15) (< 14 main_~k~0) .cse1) (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and (<= main_~c~0 20) .cse0 (< 19 main_~k~0) (= main_~y~0 20) (<= 20 main_~c~0) .cse1) (and (= main_~y~0 2) (< 1 main_~k~0) .cse0 (= main_~c~0 2) .cse1) (and (< 12 main_~k~0) .cse0 (= main_~c~0 13) (= main_~y~0 13) .cse1) (and (< 10 main_~k~0) .cse0 (= main_~c~0 11) (= main_~y~0 11) .cse1) (and (= main_~y~0 6) .cse0 (= main_~c~0 6) (< 5 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3)) (and (= main_~y~0 14) .cse0 (< 13 main_~k~0) (= main_~c~0 14) .cse1))) [2022-04-08 07:46:35,628 INFO L878 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 20)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and .cse0 (= main_~c~0 16) (= main_~y~0 16) .cse1 (< 15 main_~k~0)) (and (= 7 main_~y~0) (= 7 main_~c~0) .cse0 .cse1 (< 6 main_~k~0)) (and (= main_~y~0 9) .cse0 (= main_~c~0 9) (< 8 main_~k~0) .cse1) (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and (< 7 main_~k~0) (= main_~y~0 8) .cse0 (= main_~c~0 8) .cse1) (and (= main_~c~0 17) .cse0 .cse1 (< 16 main_~k~0) (= main_~y~0 17)) (and (= main_~y~0 12) .cse0 (= main_~c~0 12) (< 11 main_~k~0) .cse1) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and (< 17 main_~k~0) .cse0 (= main_~c~0 18) .cse1 (= main_~y~0 18)) (and .cse0 (= 5 main_~c~0) (= 5 main_~y~0) .cse1 (< 4 main_~k~0)) (and .cse0 (= main_~y~0 10) (< 9 main_~k~0) (= main_~c~0 10) .cse1) (and .cse0 (< 18 main_~k~0) (= 19 main_~y~0) .cse1 (= 19 main_~c~0)) (and (= main_~c~0 15) .cse0 (= main_~y~0 15) (< 14 main_~k~0) .cse1) (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and (<= main_~c~0 20) .cse0 (< 19 main_~k~0) (= main_~y~0 20) (<= 20 main_~c~0) .cse1) (and (= main_~y~0 2) (< 1 main_~k~0) .cse0 (= main_~c~0 2) .cse1) (and (< 12 main_~k~0) .cse0 (= main_~c~0 13) (= main_~y~0 13) .cse1) (and (< 10 main_~k~0) .cse0 (= main_~c~0 11) (= main_~y~0 11) .cse1) (and (= main_~y~0 6) .cse0 (= main_~c~0 6) (< 5 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3)) (and (= main_~y~0 14) .cse0 (< 13 main_~k~0) (= main_~c~0 14) .cse1))) [2022-04-08 07:46:35,628 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 17 40) the Hoare annotation is: true [2022-04-08 07:46:35,628 INFO L878 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (let ((.cse1 (+ (- 1) main_~y~0)) (.cse2 (+ (- 2) main_~y~0)) (.cse0 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (<= main_~k~0 6) (< 5 main_~k~0) .cse0 (<= main_~c~0 6) (= 5 .cse1)) (and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15) (<= main_~k~0 15) .cse0) (and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (<= main_~c~0 10) (< 9 main_~k~0) .cse0) (and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0) (<= main_~c~0 9) .cse0) (and (<= main_~c~0 20) (<= main_~k~0 20) (< 19 main_~k~0) (= main_~y~0 20) .cse0) (and (<= main_~c~0 17) (<= main_~k~0 17) (= 16 .cse1) .cse0 (< 16 main_~k~0)) (and (<= main_~c~0 3) (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0) .cse0) (and (< 12 main_~k~0) (<= main_~c~0 13) (<= main_~k~0 13) (= main_~y~0 13) .cse0) (and (= .cse1 0) (<= main_~k~0 1) (< 0 main_~k~0) .cse0 (<= main_~c~0 1)) (and (<= main_~c~0 5) (<= main_~k~0 5) (= 5 main_~y~0) .cse0 (< 4 main_~k~0)) (and (= 3 .cse1) (< 3 main_~k~0) (<= main_~k~0 4) .cse0 (<= main_~c~0 4)) (and (< 1 main_~k~0) (= .cse2 0) (<= main_~k~0 2) (<= main_~c~0 2) .cse0) (and (< 17 main_~k~0) (<= main_~c~0 18) (<= main_~k~0 18) .cse0 (= .cse1 17)) (and (= main_~y~0 14) (< 13 main_~k~0) .cse0 (<= main_~k~0 14) (<= main_~c~0 14)) (and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0) .cse0 (<= main_~k~0 12)) (and (< 7 main_~k~0) (<= main_~c~0 8) (= .cse2 6) (<= main_~k~0 8) .cse0) (and (<= main_~k~0 7) (<= main_~c~0 7) (= 7 main_~y~0) .cse0 (< 6 main_~k~0)) (and (<= main_~k~0 16) (= main_~y~0 16) .cse0 (< 15 main_~k~0) (<= main_~c~0 16)) (and (< 18 main_~k~0) (<= main_~c~0 19) (<= main_~k~0 19) (= 19 main_~y~0) .cse0) (and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11) .cse0))) [2022-04-08 07:46:35,628 INFO L885 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-08 07:46:35,629 INFO L878 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (<= main_~k~0 20) (<= 0 main_~k~0)) [2022-04-08 07:46:35,629 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 17 40) the Hoare annotation is: true [2022-04-08 07:46:35,629 INFO L885 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: true [2022-04-08 07:46:35,629 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)) [2022-04-08 07:46:35,629 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 07:46:35,629 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 07:46:35,629 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 07:46:35,629 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 07:46:35,629 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 07:46:35,629 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 07:46:35,629 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 07:46:35,629 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-08 07:46:35,629 INFO L878 garLoopResultBuilder]: At program point L11(lines 11 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 07:46:35,629 INFO L878 garLoopResultBuilder]: At program point L10(lines 10 13) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-08 07:46:35,629 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-08 07:46:35,629 INFO L878 garLoopResultBuilder]: At program point L10-2(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-08 07:46:35,629 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 07:46:35,635 INFO L719 BasicCegarLoop]: Path program histogram: [42, 2, 2, 2] [2022-04-08 07:46:35,636 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 07:46:35,638 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 07:46:35,639 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 07:46:35,750 INFO L163 areAnnotationChecker]: CFG has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 07:46:35,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 07:46:35 BoogieIcfgContainer [2022-04-08 07:46:35,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 07:46:35,768 INFO L158 Benchmark]: Toolchain (without parser) took 94647.53ms. Allocated memory was 183.5MB in the beginning and 264.2MB in the end (delta: 80.7MB). Free memory was 132.2MB in the beginning and 138.2MB in the end (delta: -6.0MB). Peak memory consumption was 130.6MB. Max. memory is 8.0GB. [2022-04-08 07:46:35,768 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 07:46:35,769 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.08ms. Allocated memory is still 183.5MB. Free memory was 132.1MB in the beginning and 158.9MB in the end (delta: -26.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 07:46:35,769 INFO L158 Benchmark]: Boogie Preprocessor took 25.17ms. Allocated memory is still 183.5MB. Free memory was 158.6MB in the beginning and 157.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 07:46:35,769 INFO L158 Benchmark]: RCFGBuilder took 250.87ms. Allocated memory is still 183.5MB. Free memory was 157.1MB in the beginning and 146.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 07:46:35,769 INFO L158 Benchmark]: TraceAbstraction took 94151.69ms. Allocated memory was 183.5MB in the beginning and 264.2MB in the end (delta: 80.7MB). Free memory was 146.0MB in the beginning and 138.2MB in the end (delta: 7.8MB). Peak memory consumption was 144.5MB. Max. memory is 8.0GB. [2022-04-08 07:46:35,770 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.08ms. Allocated memory is still 183.5MB. Free memory was 132.1MB in the beginning and 158.9MB in the end (delta: -26.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.17ms. Allocated memory is still 183.5MB. Free memory was 158.6MB in the beginning and 157.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 250.87ms. Allocated memory is still 183.5MB. Free memory was 157.1MB in the beginning and 146.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 94151.69ms. Allocated memory was 183.5MB in the beginning and 264.2MB in the end (delta: 80.7MB). Free memory was 146.0MB in the beginning and 138.2MB in the end (delta: 7.8MB). Peak memory consumption was 144.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 94.0s, OverallIterations: 24, TraceHistogramMax: 23, PathProgramHistogramMax: 42, EmptinessCheckTime: 0.0s, AutomataDifference: 34.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 14.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 10579 SdHoareTripleChecker+Invalid, 14.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9364 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13155 IncrementalHoareTripleChecker+Invalid, 13185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 1215 mSDtfsCounter, 13155 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2767 GetRequests, 2274 SyntacticMatches, 22 SemanticMatches, 471 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=23, InterpolantAutomatonStates: 369, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 316 PreInvPairs, 504 NumberOfFragments, 2797 HoareAnnotationTreeSize, 316 FomulaSimplifications, 2055 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 28 FomulaSimplificationsInter, 38 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((k <= 20 && c == 16) && y == 16) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 15 < k) || ((((7 == y && 7 == c) && k <= 20) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 6 < k)) || ((((y == 9 && k <= 20) && c == 9) && 8 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 20 && y == 1) && 0 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c == 1)) || ((((7 < k && y == 8) && k <= 20) && c == 8) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((c == 17 && k <= 20) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 16 < k) && y == 17)) || ((((y == 12 && k <= 20) && c == 12) && 11 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 20 && y == 4) && c == 4) && 3 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((17 < k && k <= 20) && c == 18) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && y == 18)) || ((((k <= 20 && 5 == c) && 5 == y) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 4 < k)) || ((((k <= 20 && y == 10) && 9 < k) && c == 10) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 20 && 18 < k) && 19 == y) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 19 == c)) || ((((c == 15 && k <= 20) && y == 15) && 14 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 20 && 0 <= k) && c == 0) && y == 0) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || (((((c <= 20 && k <= 20) && 19 < k) && y == 20) && 20 <= c) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((y == 2 && 1 < k) && k <= 20) && c == 2) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((12 < k && k <= 20) && c == 13) && y == 13) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((10 < k && k <= 20) && c == 11) && y == 11) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((y == 6 && k <= 20) && c == 6) && 5 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 20 && y == 3) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c < k + 1) && c == 3)) || ((((y == 14 && k <= 20) && 13 < k) && c == 14) && y * y * y * y + y * y + y * y * y * 2 == x * 4) - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: !(1 <= \old(cond)) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-08 07:46:35,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...