/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_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 07:44:21,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 07:44:21,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 07:44:21,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 07:44:21,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 07:44:21,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 07:44:21,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 07:44:21,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 07:44:21,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 07:44:21,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 07:44:21,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 07:44:21,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 07:44:21,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 07:44:21,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 07:44:21,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 07:44:21,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 07:44:21,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 07:44:21,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 07:44:21,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 07:44:21,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 07:44:21,746 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 07:44:21,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 07:44:21,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 07:44:21,752 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 07:44:21,753 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 07:44:21,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 07:44:21,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 07:44:21,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 07:44:21,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 07:44:21,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 07:44:21,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 07:44:21,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 07:44:21,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 07:44:21,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 07:44:21,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 07:44:21,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 07:44:21,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 07:44:21,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 07:44:21,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 07:44:21,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 07:44:21,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 07:44:21,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 07:44:21,765 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:44:21,772 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 07:44:21,772 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 07:44:21,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 07:44:21,773 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 07:44:21,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 07:44:21,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 07:44:21,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 07:44:21,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 07:44:21,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 07:44:21,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 07:44:21,774 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 07:44:21,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 07:44:21,774 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 07:44:21,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 07:44:21,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 07:44:21,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 07:44:21,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 07:44:21,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 07:44:21,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:44:21,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 07:44:21,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 07:44:21,776 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 07:44:21,776 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 07:44:21,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 07:44:21,776 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 07:44:21,777 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:44:21,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 07:44:22,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 07:44:22,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 07:44:22,011 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 07:44:22,012 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 07:44:22,013 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound10.c [2022-04-08 07:44:22,082 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31f00544b/2d04a24791d44be4a5cbef05eecf1556/FLAG45ccc55e5 [2022-04-08 07:44:22,417 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 07:44:22,418 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound10.c [2022-04-08 07:44:22,422 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31f00544b/2d04a24791d44be4a5cbef05eecf1556/FLAG45ccc55e5 [2022-04-08 07:44:22,854 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31f00544b/2d04a24791d44be4a5cbef05eecf1556 [2022-04-08 07:44:22,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 07:44:22,861 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 07:44:22,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 07:44:22,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 07:44:22,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 07:44:22,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:44:22" (1/1) ... [2022-04-08 07:44:22,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66fa082f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:22, skipping insertion in model container [2022-04-08 07:44:22,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:44:22" (1/1) ... [2022-04-08 07:44:22,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 07:44:22,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 07:44:23,004 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_valuebound10.c[458,471] [2022-04-08 07:44:23,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:44:23,043 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 07:44:23,053 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_valuebound10.c[458,471] [2022-04-08 07:44:23,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:44:23,073 INFO L208 MainTranslator]: Completed translation [2022-04-08 07:44:23,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:23 WrapperNode [2022-04-08 07:44:23,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 07:44:23,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 07:44:23,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 07:44:23,075 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 07:44:23,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:23" (1/1) ... [2022-04-08 07:44:23,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:23" (1/1) ... [2022-04-08 07:44:23,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:23" (1/1) ... [2022-04-08 07:44:23,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:23" (1/1) ... [2022-04-08 07:44:23,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:23" (1/1) ... [2022-04-08 07:44:23,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:23" (1/1) ... [2022-04-08 07:44:23,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:23" (1/1) ... [2022-04-08 07:44:23,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 07:44:23,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 07:44:23,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 07:44:23,099 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 07:44:23,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:23" (1/1) ... [2022-04-08 07:44:23,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:44:23,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:23,136 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:44:23,138 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:44:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 07:44:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 07:44:23,165 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 07:44:23,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 07:44:23,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 07:44:23,165 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 07:44:23,165 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 07:44:23,166 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 07:44:23,166 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 07:44:23,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 07:44:23,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 07:44:23,167 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 07:44:23,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 07:44:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 07:44:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 07:44:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 07:44:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 07:44:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 07:44:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 07:44:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 07:44:23,224 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 07:44:23,225 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 07:44:23,323 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 07:44:23,329 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 07:44:23,329 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 07:44:23,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:44:23 BoogieIcfgContainer [2022-04-08 07:44:23,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 07:44:23,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 07:44:23,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 07:44:23,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 07:44:23,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 07:44:22" (1/3) ... [2022-04-08 07:44:23,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb12d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:44:23, skipping insertion in model container [2022-04-08 07:44:23,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:23" (2/3) ... [2022-04-08 07:44:23,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb12d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:44:23, skipping insertion in model container [2022-04-08 07:44:23,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:44:23" (3/3) ... [2022-04-08 07:44:23,338 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound10.c [2022-04-08 07:44:23,342 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 07:44:23,342 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 07:44:23,412 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 07:44:23,425 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:44:23,425 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 07:44:23,457 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:44:23,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 07:44:23,463 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:23,464 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:44:23,464 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:23,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:23,469 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-08 07:44:23,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:23,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [546333642] [2022-04-08 07:44:23,489 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:44:23,489 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 2 times [2022-04-08 07:44:23,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:23,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299386461] [2022-04-08 07:44:23,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:23,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:23,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 07:44:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:23,707 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:44:23,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 07:44:23,708 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-08 07:44:23,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 07:44:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:23,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-08 07:44:23,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-08 07:44:23,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-08 07:44:23,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-08 07:44:23,724 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:44:23,725 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:44:23,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 07:44:23,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-08 07:44:23,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-08 07:44:23,726 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:44:23,727 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {31#true} is VALID [2022-04-08 07:44:23,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-08 07:44:23,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-08 07:44:23,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-08 07:44:23,728 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-08 07:44:23,728 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:44:23,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-08 07:44:23,730 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:44:23,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-08 07:44:23,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-08 07:44:23,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-08 07:44:23,732 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:44:23,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:23,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299386461] [2022-04-08 07:44:23,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299386461] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:23,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:23,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:44:23,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:23,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [546333642] [2022-04-08 07:44:23,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [546333642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:23,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:23,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:44:23,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982574784] [2022-04-08 07:44:23,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:23,745 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:44:23,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:23,749 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:44:23,778 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:44:23,778 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 07:44:23,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:23,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 07:44:23,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 07:44:23,814 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:44:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:23,940 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-08 07:44:23,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 07:44:23,941 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:44:23,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:23,942 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:44:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-08 07:44:23,951 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:44:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-08 07:44:23,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-08 07:44:24,034 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:44:24,042 INFO L225 Difference]: With dead ends: 47 [2022-04-08 07:44:24,042 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 07:44:24,045 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:44:24,050 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:44:24,052 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:44:24,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 07:44:24,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 07:44:24,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:24,084 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:44:24,085 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:44:24,085 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:44:24,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:24,089 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-08 07:44:24,089 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 07:44:24,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:24,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:24,090 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:44:24,091 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:44:24,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:24,094 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-08 07:44:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 07:44:24,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:24,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:24,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:24,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:24,096 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:44:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-08 07:44:24,099 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-08 07:44:24,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:24,099 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-08 07:44:24,100 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:44:24,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-08 07:44:24,129 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:44:24,130 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 07:44:24,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 07:44:24,130 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:24,131 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:44:24,131 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 07:44:24,131 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:24,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:24,132 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-08 07:44:24,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:24,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1294576088] [2022-04-08 07:44:24,133 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:44:24,134 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 2 times [2022-04-08 07:44:24,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:24,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134462903] [2022-04-08 07:44:24,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:24,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:24,152 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:24,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [711266842] [2022-04-08 07:44:24,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:44:24,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:24,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:24,155 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:44:24,177 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:44:24,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 07:44:24,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:24,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 07:44:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:24,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:24,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {229#true} is VALID [2022-04-08 07:44:24,352 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:44:24,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-08 07:44:24,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} #60#return; {229#true} is VALID [2022-04-08 07:44:24,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#true} call #t~ret5 := main(); {229#true} is VALID [2022-04-08 07:44:24,353 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:44:24,353 INFO L272 TraceCheckUtils]: 6: Hoare triple {229#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {229#true} is VALID [2022-04-08 07:44:24,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#true} ~cond := #in~cond; {229#true} is VALID [2022-04-08 07:44:24,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#true} assume !(0 == ~cond); {229#true} is VALID [2022-04-08 07:44:24,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-08 07:44:24,354 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {229#true} {229#true} #52#return; {229#true} is VALID [2022-04-08 07:44:24,355 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:44:24,355 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:44:24,356 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:44:24,357 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:44:24,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {278#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {230#false} is VALID [2022-04-08 07:44:24,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-04-08 07:44:24,359 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:44:24,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:44:24,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:24,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134462903] [2022-04-08 07:44:24,361 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:24,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711266842] [2022-04-08 07:44:24,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711266842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:24,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:24,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:44:24,363 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:24,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1294576088] [2022-04-08 07:44:24,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1294576088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:24,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:24,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:44:24,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492923409] [2022-04-08 07:44:24,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:24,365 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:44:24,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:24,366 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:44:24,381 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:44:24,381 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:44:24,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:24,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:44:24,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 07:44:24,383 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:44:24,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:24,529 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 07:44:24,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:44:24,529 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:44:24,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:24,530 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:44:24,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-08 07:44:24,532 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:44:24,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-08 07:44:24,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-08 07:44:24,566 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:44:24,569 INFO L225 Difference]: With dead ends: 34 [2022-04-08 07:44:24,569 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 07:44:24,569 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:44:24,570 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:44:24,571 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:44:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 07:44:24,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 07:44:24,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:24,625 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:44:24,625 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:44:24,626 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:44:24,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:24,628 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-08 07:44:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-08 07:44:24,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:24,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:24,629 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:44:24,630 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:44:24,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:24,632 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-08 07:44:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-08 07:44:24,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:24,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:24,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:24,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:24,633 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:44:24,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-08 07:44:24,635 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-08 07:44:24,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:24,635 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-08 07:44:24,636 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:44:24,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-08 07:44:24,668 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:44:24,668 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-08 07:44:24,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 07:44:24,669 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:24,669 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:44:24,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 07:44:24,889 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:44:24,890 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:24,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:24,891 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-08 07:44:24,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:24,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1768560799] [2022-04-08 07:44:25,082 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:25,083 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:25,083 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:25,083 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 2 times [2022-04-08 07:44:25,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:25,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804974510] [2022-04-08 07:44:25,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:25,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:25,104 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:25,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [631950265] [2022-04-08 07:44:25,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:44:25,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:25,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:25,106 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:44:25,107 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:44:25,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:44:25,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:25,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 07:44:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:25,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:25,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-08 07:44:25,306 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:44:25,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:44:25,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-08 07:44:25,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-08 07:44:25,307 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:44:25,307 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {474#true} is VALID [2022-04-08 07:44:25,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 07:44:25,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 07:44:25,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:44:25,308 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-08 07:44:25,308 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:44:25,309 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:44:25,309 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:44:25,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 07:44:25,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 07:44:25,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:44:25,310 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:44:25,311 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:44:25,311 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:44:25,312 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:44:25,312 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:44:25,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-08 07:44:25,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-08 07:44:25,314 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:44:25,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:25,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-08 07:44:25,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-08 07:44:25,506 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:44:25,507 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:44:25,507 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:44:25,548 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:44:25,549 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:44:25,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:44:25,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 07:44:25,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 07:44:25,550 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:44:25,551 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:44:25,551 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:44:25,551 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-08 07:44:25,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:44:25,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 07:44:25,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 07:44:25,552 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {474#true} is VALID [2022-04-08 07:44:25,552 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:44:25,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-08 07:44:25,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-08 07:44:25,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:44:25,553 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:44:25,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-08 07:44:25,553 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:44:25,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:25,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804974510] [2022-04-08 07:44:25,554 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:25,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631950265] [2022-04-08 07:44:25,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631950265] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 07:44:25,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:44:25,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 07:44:25,554 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:25,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1768560799] [2022-04-08 07:44:25,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1768560799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:25,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:25,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:44:25,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853454975] [2022-04-08 07:44:25,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:25,556 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:44:25,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:25,556 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:44:25,588 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:44:25,588 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:44:25,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:25,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:44:25,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 07:44:25,589 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:44:25,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:25,718 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-08 07:44:25,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:44:25,719 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:44:25,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:25,719 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:44:25,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-08 07:44:25,721 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:44:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-08 07:44:25,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-08 07:44:25,755 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:44:25,757 INFO L225 Difference]: With dead ends: 36 [2022-04-08 07:44:25,757 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 07:44:25,757 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:44:25,758 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:44:25,759 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:44:25,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 07:44:25,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 07:44:25,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:25,777 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:44:25,778 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:44:25,778 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:44:25,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:25,781 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 07:44:25,783 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 07:44:25,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:25,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:25,785 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:44:25,785 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:44:25,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:25,787 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 07:44:25,787 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 07:44:25,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:25,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:25,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:25,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:25,788 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:44:25,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-08 07:44:25,790 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2022-04-08 07:44:25,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:25,790 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-08 07:44:25,790 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:44:25,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-08 07:44:25,842 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:44:25,842 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 07:44:25,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 07:44:25,843 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:25,843 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:44:25,860 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:44:26,047 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:44:26,048 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:26,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:26,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 1 times [2022-04-08 07:44:26,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:26,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [913246637] [2022-04-08 07:44:26,168 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:26,168 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:26,169 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:26,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 2 times [2022-04-08 07:44:26,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:26,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069722354] [2022-04-08 07:44:26,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:26,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:26,182 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:26,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2053610351] [2022-04-08 07:44:26,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:44:26,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:26,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:26,183 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:44:26,207 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:44:26,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:44:26,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:26,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 07:44:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:26,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:26,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {822#true} is VALID [2022-04-08 07:44:26,534 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:44:26,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-08 07:44:26,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #60#return; {822#true} is VALID [2022-04-08 07:44:26,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret5 := main(); {822#true} is VALID [2022-04-08 07:44:26,534 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:44:26,534 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {822#true} is VALID [2022-04-08 07:44:26,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-08 07:44:26,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-08 07:44:26,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-08 07:44:26,535 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #52#return; {822#true} is VALID [2022-04-08 07:44:26,535 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:44:26,538 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:44:26,538 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:44:26,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-08 07:44:26,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-08 07:44:26,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-08 07:44:26,539 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:44:26,540 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:44:26,540 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:44:26,540 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:44:26,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-08 07:44:26,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-08 07:44:26,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-08 07:44:26,542 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:44:26,543 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:44:26,544 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:44:26,544 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:44:26,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {823#false} is VALID [2022-04-08 07:44:26,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-08 07:44:26,547 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:44:26,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:26,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:26,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069722354] [2022-04-08 07:44:26,835 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:26,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053610351] [2022-04-08 07:44:26,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053610351] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:44:26,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:44:26,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 07:44:26,836 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:26,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [913246637] [2022-04-08 07:44:26,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [913246637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:26,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:26,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 07:44:26,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104951080] [2022-04-08 07:44:26,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:26,838 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:44:26,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:26,839 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:44:26,859 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:44:26,860 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 07:44:26,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:26,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 07:44:26,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 07:44:26,861 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:44:27,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:27,057 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-08 07:44:27,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 07:44:27,057 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:44:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:27,057 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:44:27,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-08 07:44:27,060 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:44:27,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-08 07:44:27,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-08 07:44:27,096 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:44:27,097 INFO L225 Difference]: With dead ends: 39 [2022-04-08 07:44:27,097 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 07:44:27,097 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:44:27,098 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:27,099 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.0s Time] [2022-04-08 07:44:27,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 07:44:27,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 07:44:27,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:27,116 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:44:27,116 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:44:27,116 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:44:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:27,118 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-08 07:44:27,118 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-08 07:44:27,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:27,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:27,119 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:44:27,119 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:44:27,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:27,121 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-08 07:44:27,121 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-08 07:44:27,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:27,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:27,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:27,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:27,122 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:44:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-08 07:44:27,123 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2022-04-08 07:44:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:27,124 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-08 07:44:27,124 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:44:27,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 35 transitions. [2022-04-08 07:44:27,170 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:44:27,170 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-08 07:44:27,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 07:44:27,171 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:27,171 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:44:27,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 07:44:27,387 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:44:27,387 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:27,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:27,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 3 times [2022-04-08 07:44:27,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:27,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2011485282] [2022-04-08 07:44:27,487 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:27,487 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:27,487 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:27,487 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 4 times [2022-04-08 07:44:27,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:27,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154271698] [2022-04-08 07:44:27,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:27,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:27,499 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:27,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [982795924] [2022-04-08 07:44:27,499 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:44:27,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:27,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:27,500 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:44:27,508 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:44:27,551 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:44:27,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:27,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 07:44:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:27,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:27,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {1178#true} call ULTIMATE.init(); {1178#true} is VALID [2022-04-08 07:44:27,937 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:44:27,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 07:44:27,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1178#true} {1178#true} #60#return; {1178#true} is VALID [2022-04-08 07:44:27,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {1178#true} call #t~ret5 := main(); {1178#true} is VALID [2022-04-08 07:44:27,937 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:44:27,938 INFO L272 TraceCheckUtils]: 6: Hoare triple {1178#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1178#true} is VALID [2022-04-08 07:44:27,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-08 07:44:27,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-08 07:44:27,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 07:44:27,938 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1178#true} {1178#true} #52#return; {1178#true} is VALID [2022-04-08 07:44:27,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:27,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:27,948 INFO L272 TraceCheckUtils]: 13: Hoare triple {1216#(and (= main_~x~0 0) (= 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:44:27,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-08 07:44:27,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-08 07:44:27,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 07:44:27,949 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1178#true} {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:27,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-08 07:44:27,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} assume !false; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-08 07:44:27,951 INFO L272 TraceCheckUtils]: 20: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~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:44:27,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-08 07:44:27,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-08 07:44:27,951 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 07:44:27,952 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1178#true} {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} #54#return; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-08 07:44:27,953 INFO L290 TraceCheckUtils]: 25: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~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; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= (+ (* main_~y~0 (* main_~y~0 main_~y~0)) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) main_~x~0) (<= main_~c~0 2))} is VALID [2022-04-08 07:44:27,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= (+ (* main_~y~0 (* main_~y~0 main_~y~0)) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) main_~x~0) (<= main_~c~0 2))} assume !false; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= (+ (* main_~y~0 (* main_~y~0 main_~y~0)) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) main_~x~0) (<= main_~c~0 2))} is VALID [2022-04-08 07:44:27,954 INFO L272 TraceCheckUtils]: 27: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= (+ (* main_~y~0 (* main_~y~0 main_~y~0)) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) main_~x~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:44:27,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#true} ~cond := #in~cond; {1270#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:27,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {1270#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1274#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:44:27,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {1274#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1274#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:44:27,956 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1274#(not (= |__VERIFIER_assert_#in~cond| 0))} {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= (+ (* main_~y~0 (* main_~y~0 main_~y~0)) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) main_~x~0) (<= main_~c~0 2))} #54#return; {1281#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 07:44:27,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {1281#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1285#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-08 07:44:27,957 INFO L272 TraceCheckUtils]: 33: Hoare triple {1285#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1289#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:44:27,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {1289#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1293#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:27,958 INFO L290 TraceCheckUtils]: 35: Hoare triple {1293#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1179#false} is VALID [2022-04-08 07:44:27,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {1179#false} assume !false; {1179#false} is VALID [2022-04-08 07:44:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 07:44:27,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:42,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:42,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154271698] [2022-04-08 07:44:42,600 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:42,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982795924] [2022-04-08 07:44:42,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982795924] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:44:42,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:44:42,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 07:44:42,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:42,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2011485282] [2022-04-08 07:44:42,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2011485282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:42,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:42,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 07:44:42,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502544430] [2022-04-08 07:44:42,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:42,602 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 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:44:42,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:42,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:44:42,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:42,637 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 07:44:42,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:42,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 07:44:42,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-08 07:44:42,638 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:44:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:43,145 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-04-08 07:44:43,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 07:44:43,145 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 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:44:43,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:44:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-08 07:44:43,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:44:43,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-08 07:44:43,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2022-04-08 07:44:43,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:43,191 INFO L225 Difference]: With dead ends: 46 [2022-04-08 07:44:43,191 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 07:44:43,192 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-04-08 07:44:43,193 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:43,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 154 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 07:44:43,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 07:44:43,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-08 07:44:43,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:43,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:43,219 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:43,219 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:43,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:43,221 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-04-08 07:44:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-08 07:44:43,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:43,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:43,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 41 states. [2022-04-08 07:44:43,222 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 41 states. [2022-04-08 07:44:43,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:43,224 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-04-08 07:44:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-08 07:44:43,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:43,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:43,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:43,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:43,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:43,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2022-04-08 07:44:43,226 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 37 [2022-04-08 07:44:43,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:43,227 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2022-04-08 07:44:43,227 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:44:43,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 42 transitions. [2022-04-08 07:44:43,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:43,285 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-08 07:44:43,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 07:44:43,286 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:43,286 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:44:43,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-08 07:44:43,491 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:44:43,491 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:43,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:43,492 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 5 times [2022-04-08 07:44:43,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:43,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [275918971] [2022-04-08 07:44:43,597 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:43,597 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:43,598 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:43,598 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 6 times [2022-04-08 07:44:43,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:43,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318328410] [2022-04-08 07:44:43,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:43,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:43,622 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:43,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140307255] [2022-04-08 07:44:43,622 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:44:43,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:43,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:43,635 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:44:43,660 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:44:43,722 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 07:44:43,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:43,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 07:44:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:43,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:44,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {1605#true} call ULTIMATE.init(); {1605#true} is VALID [2022-04-08 07:44:44,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {1605#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); {1605#true} is VALID [2022-04-08 07:44:44,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-08 07:44:44,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1605#true} {1605#true} #60#return; {1605#true} is VALID [2022-04-08 07:44:44,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {1605#true} call #t~ret5 := main(); {1605#true} is VALID [2022-04-08 07:44:44,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {1605#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; {1605#true} is VALID [2022-04-08 07:44:44,061 INFO L272 TraceCheckUtils]: 6: Hoare triple {1605#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1605#true} is VALID [2022-04-08 07:44:44,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-08 07:44:44,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-08 07:44:44,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-08 07:44:44,061 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1605#true} {1605#true} #52#return; {1605#true} is VALID [2022-04-08 07:44:44,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {1605#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1643#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:44,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {1643#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1643#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:44,063 INFO L272 TraceCheckUtils]: 13: Hoare triple {1643#(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)); {1605#true} is VALID [2022-04-08 07:44:44,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-08 07:44:44,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-08 07:44:44,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-08 07:44:44,064 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1605#true} {1643#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1643#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:44,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {1643#(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; {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:44:44,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:44:44,066 INFO L272 TraceCheckUtils]: 20: Hoare triple {1665#(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)); {1605#true} is VALID [2022-04-08 07:44:44,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-08 07:44:44,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-08 07:44:44,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-08 07:44:44,067 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1605#true} {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:44:44,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {1665#(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; {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:44:44,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:44:44,068 INFO L272 TraceCheckUtils]: 27: Hoare triple {1687#(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)); {1605#true} is VALID [2022-04-08 07:44:44,071 INFO L290 TraceCheckUtils]: 28: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-08 07:44:44,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-08 07:44:44,072 INFO L290 TraceCheckUtils]: 30: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-08 07:44:44,072 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1605#true} {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:44:44,073 INFO L290 TraceCheckUtils]: 32: Hoare triple {1687#(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; {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:44:44,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:44:44,073 INFO L272 TraceCheckUtils]: 34: Hoare triple {1709#(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)); {1605#true} is VALID [2022-04-08 07:44:44,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-08 07:44:44,074 INFO L290 TraceCheckUtils]: 36: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-08 07:44:44,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-08 07:44:44,074 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1605#true} {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #54#return; {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:44:44,075 INFO L290 TraceCheckUtils]: 39: Hoare triple {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1731#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:44:44,076 INFO L272 TraceCheckUtils]: 40: Hoare triple {1731#(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)); {1735#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:44:44,076 INFO L290 TraceCheckUtils]: 41: Hoare triple {1735#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1739#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:44,079 INFO L290 TraceCheckUtils]: 42: Hoare triple {1739#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1606#false} is VALID [2022-04-08 07:44:44,080 INFO L290 TraceCheckUtils]: 43: Hoare triple {1606#false} assume !false; {1606#false} is VALID [2022-04-08 07:44:44,080 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:44:44,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:44,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:44,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318328410] [2022-04-08 07:44:44,375 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:44,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140307255] [2022-04-08 07:44:44,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140307255] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:44:44,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:44:44,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 07:44:44,375 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:44,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [275918971] [2022-04-08 07:44:44,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [275918971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:44,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:44,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 07:44:44,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057378319] [2022-04-08 07:44:44,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:44,377 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:44:44,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:44,377 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:44:44,406 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:44:44,406 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 07:44:44,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:44,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 07:44:44,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:44:44,407 INFO L87 Difference]: Start difference. First operand 41 states and 42 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:44:44,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:44,759 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-04-08 07:44:44,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 07:44:44,759 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:44:44,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:44,760 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:44:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-08 07:44:44,761 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:44:44,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-08 07:44:44,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-08 07:44:44,795 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:44:44,796 INFO L225 Difference]: With dead ends: 49 [2022-04-08 07:44:44,796 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 07:44:44,796 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:44:44,797 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:44:44,797 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:44:44,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 07:44:44,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-08 07:44:44,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:44,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:44,822 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:44,822 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:44,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:44,824 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-08 07:44:44,824 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 07:44:44,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:44,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:44,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-08 07:44:44,825 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-08 07:44:44,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:44,827 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-08 07:44:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 07:44:44,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:44,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:44,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:44,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:44,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-08 07:44:44,829 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 44 [2022-04-08 07:44:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:44,829 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-08 07:44:44,830 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:44:44,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-08 07:44:44,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 07:44:44,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 07:44:44,896 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:44,896 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:44:44,922 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:44:45,096 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:44:45,097 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:45,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:45,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 7 times [2022-04-08 07:44:45,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:45,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1463256850] [2022-04-08 07:44:45,228 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:45,229 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:45,229 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:45,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 8 times [2022-04-08 07:44:45,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:45,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22727454] [2022-04-08 07:44:45,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:45,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:45,261 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:45,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2026861768] [2022-04-08 07:44:45,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:44:45,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:45,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:45,264 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:44:45,266 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:44:45,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:44:45,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:45,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 07:44:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:45,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:45,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {2065#true} call ULTIMATE.init(); {2065#true} is VALID [2022-04-08 07:44:45,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {2065#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); {2065#true} is VALID [2022-04-08 07:44:45,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-08 07:44:45,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2065#true} {2065#true} #60#return; {2065#true} is VALID [2022-04-08 07:44:45,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {2065#true} call #t~ret5 := main(); {2065#true} is VALID [2022-04-08 07:44:45,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {2065#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; {2065#true} is VALID [2022-04-08 07:44:45,789 INFO L272 TraceCheckUtils]: 6: Hoare triple {2065#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {2065#true} is VALID [2022-04-08 07:44:45,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-08 07:44:45,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-08 07:44:45,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-08 07:44:45,789 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2065#true} {2065#true} #52#return; {2065#true} is VALID [2022-04-08 07:44:45,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {2065#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2103#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:45,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {2103#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2103#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:45,790 INFO L272 TraceCheckUtils]: 13: Hoare triple {2103#(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)); {2065#true} is VALID [2022-04-08 07:44:45,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-08 07:44:45,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-08 07:44:45,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-08 07:44:45,791 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2065#true} {2103#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2103#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:45,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {2103#(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; {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:44:45,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:44:45,792 INFO L272 TraceCheckUtils]: 20: Hoare triple {2125#(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)); {2065#true} is VALID [2022-04-08 07:44:45,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-08 07:44:45,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-08 07:44:45,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-08 07:44:45,793 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2065#true} {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:44:45,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {2125#(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; {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:44:45,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:44:45,794 INFO L272 TraceCheckUtils]: 27: Hoare triple {2147#(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)); {2065#true} is VALID [2022-04-08 07:44:45,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-08 07:44:45,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-08 07:44:45,795 INFO L290 TraceCheckUtils]: 30: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-08 07:44:45,795 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2065#true} {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:44:45,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {2147#(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; {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:44:45,796 INFO L290 TraceCheckUtils]: 33: Hoare triple {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:44:45,797 INFO L272 TraceCheckUtils]: 34: Hoare triple {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~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)); {2065#true} is VALID [2022-04-08 07:44:45,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-08 07:44:45,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-08 07:44:45,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-08 07:44:45,797 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2065#true} {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #54#return; {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:44:45,798 INFO L290 TraceCheckUtils]: 39: Hoare triple {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~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; {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 07:44:45,799 INFO L290 TraceCheckUtils]: 40: Hoare triple {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 07:44:45,799 INFO L272 TraceCheckUtils]: 41: Hoare triple {2191#(and (= main_~y~0 4) (< 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)); {2065#true} is VALID [2022-04-08 07:44:45,799 INFO L290 TraceCheckUtils]: 42: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-08 07:44:45,799 INFO L290 TraceCheckUtils]: 43: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-08 07:44:45,799 INFO L290 TraceCheckUtils]: 44: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-08 07:44:45,800 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2065#true} {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #54#return; {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 07:44:45,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2213#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 07:44:45,802 INFO L272 TraceCheckUtils]: 47: Hoare triple {2213#(and (= main_~y~0 4) (< 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)); {2217#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:44:45,804 INFO L290 TraceCheckUtils]: 48: Hoare triple {2217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:45,805 INFO L290 TraceCheckUtils]: 49: Hoare triple {2221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2066#false} is VALID [2022-04-08 07:44:45,805 INFO L290 TraceCheckUtils]: 50: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2022-04-08 07:44:45,806 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:44:45,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:46,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:46,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22727454] [2022-04-08 07:44:46,157 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:46,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026861768] [2022-04-08 07:44:46,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026861768] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:44:46,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:44:46,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 07:44:46,158 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:46,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1463256850] [2022-04-08 07:44:46,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1463256850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:46,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:46,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 07:44:46,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139264482] [2022-04-08 07:44:46,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:46,159 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:44:46,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:46,159 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:44:46,196 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:44:46,196 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 07:44:46,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:46,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 07:44:46,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 07:44:46,197 INFO L87 Difference]: Start difference. First operand 44 states and 46 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:44:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:46,647 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-04-08 07:44:46,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 07:44:46,647 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:44:46,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:46,648 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:44:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-08 07:44:46,649 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:44:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-08 07:44:46,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2022-04-08 07:44:46,691 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:44:46,692 INFO L225 Difference]: With dead ends: 52 [2022-04-08 07:44:46,692 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 07:44:46,692 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-08 07:44:46,693 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:44:46,693 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:44:46,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 07:44:46,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-08 07:44:46,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:46,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:46,726 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:46,726 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:46,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:46,729 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-08 07:44:46,729 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-08 07:44:46,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:46,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:46,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-04-08 07:44:46,731 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-04-08 07:44:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:46,738 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-08 07:44:46,738 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-08 07:44:46,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:46,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:46,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:46,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:46,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-04-08 07:44:46,742 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 51 [2022-04-08 07:44:46,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:46,742 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-04-08 07:44:46,742 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:44:46,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2022-04-08 07:44:46,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:46,814 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-08 07:44:46,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 07:44:46,815 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:46,815 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:44:46,833 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:44:47,015 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:44:47,015 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:47,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:47,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 9 times [2022-04-08 07:44:47,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:47,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [813860915] [2022-04-08 07:44:47,107 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:47,108 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:47,108 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:47,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 10 times [2022-04-08 07:44:47,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:47,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206081101] [2022-04-08 07:44:47,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:47,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:47,119 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:47,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1479103403] [2022-04-08 07:44:47,119 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:44:47,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:47,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:47,121 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:44:47,131 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:44:47,276 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:44:47,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:47,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 07:44:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:47,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:47,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {2565#true} call ULTIMATE.init(); {2565#true} is VALID [2022-04-08 07:44:47,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {2565#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); {2565#true} is VALID [2022-04-08 07:44:47,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-08 07:44:47,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2565#true} {2565#true} #60#return; {2565#true} is VALID [2022-04-08 07:44:47,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {2565#true} call #t~ret5 := main(); {2565#true} is VALID [2022-04-08 07:44:47,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {2565#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; {2565#true} is VALID [2022-04-08 07:44:47,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {2565#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {2565#true} is VALID [2022-04-08 07:44:47,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-08 07:44:47,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-08 07:44:47,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-08 07:44:47,681 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2565#true} {2565#true} #52#return; {2565#true} is VALID [2022-04-08 07:44:47,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {2565#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2603#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:47,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {2603#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2603#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:47,688 INFO L272 TraceCheckUtils]: 13: Hoare triple {2603#(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)); {2565#true} is VALID [2022-04-08 07:44:47,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-08 07:44:47,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-08 07:44:47,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-08 07:44:47,689 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2565#true} {2603#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2603#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:47,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {2603#(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; {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:47,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:47,691 INFO L272 TraceCheckUtils]: 20: Hoare triple {2625#(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)); {2565#true} is VALID [2022-04-08 07:44:47,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-08 07:44:47,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-08 07:44:47,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-08 07:44:47,692 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2565#true} {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:47,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {2625#(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; {2647#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:44:47,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {2647#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {2647#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:44:47,693 INFO L272 TraceCheckUtils]: 27: Hoare triple {2647#(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)); {2565#true} is VALID [2022-04-08 07:44:47,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-08 07:44:47,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-08 07:44:47,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-08 07:44:47,694 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2565#true} {2647#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {2647#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:44:47,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {2647#(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; {2669#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:44:47,695 INFO L290 TraceCheckUtils]: 33: Hoare triple {2669#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {2669#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:44:47,695 INFO L272 TraceCheckUtils]: 34: Hoare triple {2669#(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)); {2565#true} is VALID [2022-04-08 07:44:47,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-08 07:44:47,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-08 07:44:47,696 INFO L290 TraceCheckUtils]: 37: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-08 07:44:47,696 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2565#true} {2669#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {2669#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:44:47,697 INFO L290 TraceCheckUtils]: 39: Hoare triple {2669#(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; {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:44:47,697 INFO L290 TraceCheckUtils]: 40: Hoare triple {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:44:47,697 INFO L272 TraceCheckUtils]: 41: Hoare triple {2691#(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)); {2565#true} is VALID [2022-04-08 07:44:47,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-08 07:44:47,698 INFO L290 TraceCheckUtils]: 43: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-08 07:44:47,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-08 07:44:47,698 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2565#true} {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:44:47,699 INFO L290 TraceCheckUtils]: 46: Hoare triple {2691#(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; {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-08 07:44:47,699 INFO L290 TraceCheckUtils]: 47: Hoare triple {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !false; {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-08 07:44:47,699 INFO L272 TraceCheckUtils]: 48: Hoare triple {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 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)); {2565#true} is VALID [2022-04-08 07:44:47,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-08 07:44:47,700 INFO L290 TraceCheckUtils]: 50: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-08 07:44:47,700 INFO L290 TraceCheckUtils]: 51: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-08 07:44:47,700 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2565#true} {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #54#return; {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-08 07:44:47,701 INFO L290 TraceCheckUtils]: 53: Hoare triple {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2735#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-08 07:44:47,702 INFO L272 TraceCheckUtils]: 54: Hoare triple {2735#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2739#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:44:47,702 INFO L290 TraceCheckUtils]: 55: Hoare triple {2739#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2743#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:47,703 INFO L290 TraceCheckUtils]: 56: Hoare triple {2743#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2566#false} is VALID [2022-04-08 07:44:47,703 INFO L290 TraceCheckUtils]: 57: Hoare triple {2566#false} assume !false; {2566#false} is VALID [2022-04-08 07:44:47,703 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:44:47,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:47,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:47,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206081101] [2022-04-08 07:44:47,975 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:47,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479103403] [2022-04-08 07:44:47,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479103403] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:44:47,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:44:47,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 07:44:47,976 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:47,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [813860915] [2022-04-08 07:44:47,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [813860915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:47,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:47,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 07:44:47,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560435158] [2022-04-08 07:44:47,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:47,977 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:44:47,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:47,977 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:44:48,006 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:44:48,006 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 07:44:48,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:48,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 07:44:48,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:44:48,007 INFO L87 Difference]: Start difference. First operand 47 states and 50 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:44:48,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:48,542 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-04-08 07:44:48,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 07:44:48,542 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:44:48,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:48,542 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:44:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-08 07:44:48,544 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:44:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-08 07:44:48,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2022-04-08 07:44:48,588 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:44:48,589 INFO L225 Difference]: With dead ends: 55 [2022-04-08 07:44:48,589 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 07:44:48,590 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 07:44:48,590 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:44:48,590 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:44:48,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 07:44:48,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-08 07:44:48,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:48,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:48,624 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:48,624 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:48,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:48,626 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-08 07:44:48,626 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-08 07:44:48,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:48,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:48,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 50 states. [2022-04-08 07:44:48,627 INFO L87 Difference]: Start difference. First operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 50 states. [2022-04-08 07:44:48,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:48,629 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-08 07:44:48,629 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-08 07:44:48,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:48,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:48,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:48,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:48,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:48,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-08 07:44:48,631 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 58 [2022-04-08 07:44:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:48,632 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-08 07:44:48,632 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:44:48,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-08 07:44:48,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:48,708 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-08 07:44:48,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 07:44:48,709 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:48,709 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:44:48,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-08 07:44:48,909 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:44:48,910 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:48,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:48,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 11 times [2022-04-08 07:44:48,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:48,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [705105350] [2022-04-08 07:44:49,014 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:49,014 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:49,014 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:49,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 12 times [2022-04-08 07:44:49,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:49,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462793671] [2022-04-08 07:44:49,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:49,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:49,031 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:49,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [312118928] [2022-04-08 07:44:49,031 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:44:49,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:49,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:49,032 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:44:49,035 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:44:49,177 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 07:44:49,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:49,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 07:44:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:49,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:49,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {3105#true} call ULTIMATE.init(); {3105#true} is VALID [2022-04-08 07:44:49,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {3105#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); {3105#true} is VALID [2022-04-08 07:44:49,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-08 07:44:49,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3105#true} {3105#true} #60#return; {3105#true} is VALID [2022-04-08 07:44:49,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {3105#true} call #t~ret5 := main(); {3105#true} is VALID [2022-04-08 07:44:49,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {3105#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; {3105#true} is VALID [2022-04-08 07:44:49,628 INFO L272 TraceCheckUtils]: 6: Hoare triple {3105#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {3105#true} is VALID [2022-04-08 07:44:49,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-08 07:44:49,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-08 07:44:49,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-08 07:44:49,628 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3105#true} {3105#true} #52#return; {3105#true} is VALID [2022-04-08 07:44:49,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {3105#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3143#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:49,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {3143#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3143#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:49,634 INFO L272 TraceCheckUtils]: 13: Hoare triple {3143#(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)); {3105#true} is VALID [2022-04-08 07:44:49,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-08 07:44:49,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-08 07:44:49,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-08 07:44:49,634 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3105#true} {3143#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3143#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:49,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {3143#(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; {3165#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:49,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {3165#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {3165#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:49,635 INFO L272 TraceCheckUtils]: 20: Hoare triple {3165#(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)); {3105#true} is VALID [2022-04-08 07:44:49,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-08 07:44:49,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-08 07:44:49,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-08 07:44:49,639 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3105#true} {3165#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {3165#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:49,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {3165#(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; {3187#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:44:49,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {3187#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {3187#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:44:49,640 INFO L272 TraceCheckUtils]: 27: Hoare triple {3187#(and (= (+ (- 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)); {3105#true} is VALID [2022-04-08 07:44:49,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-08 07:44:49,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-08 07:44:49,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-08 07:44:49,641 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3105#true} {3187#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {3187#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:44:49,642 INFO L290 TraceCheckUtils]: 32: Hoare triple {3187#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3209#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:44:49,642 INFO L290 TraceCheckUtils]: 33: Hoare triple {3209#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} assume !false; {3209#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:44:49,642 INFO L272 TraceCheckUtils]: 34: Hoare triple {3209#(and (= (+ main_~y~0 (- 3)) 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)); {3105#true} is VALID [2022-04-08 07:44:49,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-08 07:44:49,642 INFO L290 TraceCheckUtils]: 36: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-08 07:44:49,643 INFO L290 TraceCheckUtils]: 37: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-08 07:44:49,643 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3105#true} {3209#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} #54#return; {3209#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:44:49,644 INFO L290 TraceCheckUtils]: 39: Hoare triple {3209#(and (= (+ main_~y~0 (- 3)) 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; {3231#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-08 07:44:49,644 INFO L290 TraceCheckUtils]: 40: Hoare triple {3231#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} assume !false; {3231#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-08 07:44:49,644 INFO L272 TraceCheckUtils]: 41: Hoare triple {3231#(and (= (+ main_~y~0 (- 4)) 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)); {3105#true} is VALID [2022-04-08 07:44:49,645 INFO L290 TraceCheckUtils]: 42: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-08 07:44:49,645 INFO L290 TraceCheckUtils]: 43: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-08 07:44:49,645 INFO L290 TraceCheckUtils]: 44: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-08 07:44:49,645 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3105#true} {3231#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} #54#return; {3231#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-08 07:44:49,646 INFO L290 TraceCheckUtils]: 46: Hoare triple {3231#(and (= (+ main_~y~0 (- 4)) 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; {3253#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:44:49,646 INFO L290 TraceCheckUtils]: 47: Hoare triple {3253#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3253#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:44:49,646 INFO L272 TraceCheckUtils]: 48: Hoare triple {3253#(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)); {3105#true} is VALID [2022-04-08 07:44:49,647 INFO L290 TraceCheckUtils]: 49: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-08 07:44:49,647 INFO L290 TraceCheckUtils]: 50: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-08 07:44:49,647 INFO L290 TraceCheckUtils]: 51: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-08 07:44:49,647 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3105#true} {3253#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {3253#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:44:49,648 INFO L290 TraceCheckUtils]: 53: Hoare triple {3253#(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; {3275#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 07:44:49,648 INFO L290 TraceCheckUtils]: 54: Hoare triple {3275#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {3275#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 07:44:49,648 INFO L272 TraceCheckUtils]: 55: Hoare triple {3275#(and (= main_~y~0 6) (< 5 main_~k~0) (<= 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)); {3105#true} is VALID [2022-04-08 07:44:49,649 INFO L290 TraceCheckUtils]: 56: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-08 07:44:49,649 INFO L290 TraceCheckUtils]: 57: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-08 07:44:49,649 INFO L290 TraceCheckUtils]: 58: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-08 07:44:49,649 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3105#true} {3275#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #54#return; {3275#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 07:44:49,650 INFO L290 TraceCheckUtils]: 60: Hoare triple {3275#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {3297#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 07:44:49,651 INFO L272 TraceCheckUtils]: 61: Hoare triple {3297#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3301#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:44:49,651 INFO L290 TraceCheckUtils]: 62: Hoare triple {3301#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:49,652 INFO L290 TraceCheckUtils]: 63: Hoare triple {3305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3106#false} is VALID [2022-04-08 07:44:49,652 INFO L290 TraceCheckUtils]: 64: Hoare triple {3106#false} assume !false; {3106#false} is VALID [2022-04-08 07:44:49,652 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:44:49,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:50,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:50,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462793671] [2022-04-08 07:44:50,041 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:50,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312118928] [2022-04-08 07:44:50,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312118928] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:44:50,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:44:50,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 07:44:50,042 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:50,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [705105350] [2022-04-08 07:44:50,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [705105350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:50,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:50,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 07:44:50,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031598495] [2022-04-08 07:44:50,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:50,043 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:44:50,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:50,043 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:44:50,080 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:44:50,080 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 07:44:50,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:50,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 07:44:50,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-08 07:44:50,080 INFO L87 Difference]: Start difference. First operand 50 states and 54 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:44:50,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:50,736 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-04-08 07:44:50,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 07:44:50,737 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:44:50,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:50,737 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:44:50,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-08 07:44:50,739 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:44:50,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-08 07:44:50,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-08 07:44:50,805 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:44:50,806 INFO L225 Difference]: With dead ends: 58 [2022-04-08 07:44:50,806 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 07:44:50,806 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:44:50,807 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:44:50,807 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:44:50,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 07:44:50,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-08 07:44:50,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:50,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:44:50,843 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:44:50,844 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:44:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:50,846 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-08 07:44:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-08 07:44:50,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:50,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:50,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 53 states. [2022-04-08 07:44:50,847 INFO L87 Difference]: Start difference. First operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 53 states. [2022-04-08 07:44:50,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:50,848 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-08 07:44:50,849 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-08 07:44:50,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:50,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:50,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:50,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:50,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:44:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-04-08 07:44:50,851 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 65 [2022-04-08 07:44:50,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:50,851 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-04-08 07:44:50,851 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:44:50,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 58 transitions. [2022-04-08 07:44:50,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-08 07:44:50,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-08 07:44:50,935 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:50,935 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:44:50,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 07:44:51,136 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:44:51,136 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:51,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:51,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1734448024, now seen corresponding path program 13 times [2022-04-08 07:44:51,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:51,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [886984228] [2022-04-08 07:44:51,258 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:51,258 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:51,258 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:51,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1734448024, now seen corresponding path program 14 times [2022-04-08 07:44:51,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:51,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624341768] [2022-04-08 07:44:51,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:51,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:51,268 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:51,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1240742329] [2022-04-08 07:44:51,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:44:51,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:51,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:51,270 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:44:51,274 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:44:51,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:44:51,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:51,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 07:44:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:51,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:51,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {3685#true} call ULTIMATE.init(); {3685#true} is VALID [2022-04-08 07:44:51,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {3685#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); {3685#true} is VALID [2022-04-08 07:44:51,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-04-08 07:44:51,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3685#true} {3685#true} #60#return; {3685#true} is VALID [2022-04-08 07:44:51,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {3685#true} call #t~ret5 := main(); {3685#true} is VALID [2022-04-08 07:44:51,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {3685#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; {3685#true} is VALID [2022-04-08 07:44:51,913 INFO L272 TraceCheckUtils]: 6: Hoare triple {3685#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {3685#true} is VALID [2022-04-08 07:44:51,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {3685#true} ~cond := #in~cond; {3685#true} is VALID [2022-04-08 07:44:51,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {3685#true} assume !(0 == ~cond); {3685#true} is VALID [2022-04-08 07:44:51,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-04-08 07:44:51,914 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3685#true} {3685#true} #52#return; {3685#true} is VALID [2022-04-08 07:44:51,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {3685#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3723#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:51,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {3723#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3723#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:51,919 INFO L272 TraceCheckUtils]: 13: Hoare triple {3723#(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)); {3685#true} is VALID [2022-04-08 07:44:51,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {3685#true} ~cond := #in~cond; {3685#true} is VALID [2022-04-08 07:44:51,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {3685#true} assume !(0 == ~cond); {3685#true} is VALID [2022-04-08 07:44:51,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-04-08 07:44:51,920 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3685#true} {3723#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3723#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:51,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {3723#(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; {3745#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:51,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {3745#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {3745#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:51,921 INFO L272 TraceCheckUtils]: 20: Hoare triple {3745#(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)); {3685#true} is VALID [2022-04-08 07:44:51,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {3685#true} ~cond := #in~cond; {3685#true} is VALID [2022-04-08 07:44:51,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {3685#true} assume !(0 == ~cond); {3685#true} is VALID [2022-04-08 07:44:51,921 INFO L290 TraceCheckUtils]: 23: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-04-08 07:44:51,921 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3685#true} {3745#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {3745#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:51,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {3745#(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; {3767#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:44:51,922 INFO L290 TraceCheckUtils]: 26: Hoare triple {3767#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {3767#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:44:51,923 INFO L272 TraceCheckUtils]: 27: Hoare triple {3767#(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)); {3685#true} is VALID [2022-04-08 07:44:51,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {3685#true} ~cond := #in~cond; {3685#true} is VALID [2022-04-08 07:44:51,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {3685#true} assume !(0 == ~cond); {3685#true} is VALID [2022-04-08 07:44:51,923 INFO L290 TraceCheckUtils]: 30: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-04-08 07:44:51,923 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3685#true} {3767#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {3767#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:44:51,924 INFO L290 TraceCheckUtils]: 32: Hoare triple {3767#(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; {3789#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 07:44:51,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {3789#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !false; {3789#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 07:44:51,924 INFO L272 TraceCheckUtils]: 34: Hoare triple {3789#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) 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)); {3685#true} is VALID [2022-04-08 07:44:51,925 INFO L290 TraceCheckUtils]: 35: Hoare triple {3685#true} ~cond := #in~cond; {3685#true} is VALID [2022-04-08 07:44:51,925 INFO L290 TraceCheckUtils]: 36: Hoare triple {3685#true} assume !(0 == ~cond); {3685#true} is VALID [2022-04-08 07:44:51,925 INFO L290 TraceCheckUtils]: 37: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-04-08 07:44:51,925 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3685#true} {3789#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} #54#return; {3789#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 07:44:51,926 INFO L290 TraceCheckUtils]: 39: Hoare triple {3789#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3811#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:44:51,926 INFO L290 TraceCheckUtils]: 40: Hoare triple {3811#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {3811#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:44:51,926 INFO L272 TraceCheckUtils]: 41: Hoare triple {3811#(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)); {3685#true} is VALID [2022-04-08 07:44:51,927 INFO L290 TraceCheckUtils]: 42: Hoare triple {3685#true} ~cond := #in~cond; {3685#true} is VALID [2022-04-08 07:44:51,927 INFO L290 TraceCheckUtils]: 43: Hoare triple {3685#true} assume !(0 == ~cond); {3685#true} is VALID [2022-04-08 07:44:51,927 INFO L290 TraceCheckUtils]: 44: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-04-08 07:44:51,927 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3685#true} {3811#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #54#return; {3811#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:44:51,928 INFO L290 TraceCheckUtils]: 46: Hoare triple {3811#(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; {3833#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 07:44:51,928 INFO L290 TraceCheckUtils]: 47: Hoare triple {3833#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {3833#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 07:44:51,928 INFO L272 TraceCheckUtils]: 48: Hoare triple {3833#(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)); {3685#true} is VALID [2022-04-08 07:44:51,928 INFO L290 TraceCheckUtils]: 49: Hoare triple {3685#true} ~cond := #in~cond; {3685#true} is VALID [2022-04-08 07:44:51,929 INFO L290 TraceCheckUtils]: 50: Hoare triple {3685#true} assume !(0 == ~cond); {3685#true} is VALID [2022-04-08 07:44:51,929 INFO L290 TraceCheckUtils]: 51: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-04-08 07:44:51,929 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3685#true} {3833#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {3833#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 07:44:51,930 INFO L290 TraceCheckUtils]: 53: Hoare triple {3833#(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; {3855#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:44:51,930 INFO L290 TraceCheckUtils]: 54: Hoare triple {3855#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} assume !false; {3855#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:44:51,930 INFO L272 TraceCheckUtils]: 55: Hoare triple {3855#(and (= 4 (+ (- 2) main_~c~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)); {3685#true} is VALID [2022-04-08 07:44:51,930 INFO L290 TraceCheckUtils]: 56: Hoare triple {3685#true} ~cond := #in~cond; {3685#true} is VALID [2022-04-08 07:44:51,930 INFO L290 TraceCheckUtils]: 57: Hoare triple {3685#true} assume !(0 == ~cond); {3685#true} is VALID [2022-04-08 07:44:51,930 INFO L290 TraceCheckUtils]: 58: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-04-08 07:44:51,931 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3685#true} {3855#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} #54#return; {3855#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:44:51,932 INFO L290 TraceCheckUtils]: 60: Hoare triple {3855#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3877#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-08 07:44:51,932 INFO L290 TraceCheckUtils]: 61: Hoare triple {3877#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} assume !false; {3877#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-08 07:44:51,932 INFO L272 TraceCheckUtils]: 62: Hoare triple {3877#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 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)); {3685#true} is VALID [2022-04-08 07:44:51,932 INFO L290 TraceCheckUtils]: 63: Hoare triple {3685#true} ~cond := #in~cond; {3685#true} is VALID [2022-04-08 07:44:51,932 INFO L290 TraceCheckUtils]: 64: Hoare triple {3685#true} assume !(0 == ~cond); {3685#true} is VALID [2022-04-08 07:44:51,932 INFO L290 TraceCheckUtils]: 65: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-04-08 07:44:51,933 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3685#true} {3877#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} #54#return; {3877#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-08 07:44:51,934 INFO L290 TraceCheckUtils]: 67: Hoare triple {3877#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3899#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-08 07:44:51,935 INFO L272 TraceCheckUtils]: 68: Hoare triple {3899#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3903#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:44:51,935 INFO L290 TraceCheckUtils]: 69: Hoare triple {3903#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3907#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:51,935 INFO L290 TraceCheckUtils]: 70: Hoare triple {3907#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3686#false} is VALID [2022-04-08 07:44:51,935 INFO L290 TraceCheckUtils]: 71: Hoare triple {3686#false} assume !false; {3686#false} is VALID [2022-04-08 07:44:51,936 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:44:51,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:52,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:52,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624341768] [2022-04-08 07:44:52,204 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:52,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240742329] [2022-04-08 07:44:52,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240742329] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:44:52,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:44:52,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 07:44:52,204 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:52,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [886984228] [2022-04-08 07:44:52,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [886984228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:52,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:52,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 07:44:52,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051819760] [2022-04-08 07:44:52,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:52,206 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:44:52,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:52,206 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:44:52,242 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:44:52,242 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 07:44:52,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:52,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 07:44:52,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-08 07:44:52,243 INFO L87 Difference]: Start difference. First operand 53 states and 58 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:44:52,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:52,975 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-04-08 07:44:52,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 07:44:52,975 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:44:52,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:52,975 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:44:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-08 07:44:52,977 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:44:52,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-08 07:44:52,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-08 07:44:53,035 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:44:53,036 INFO L225 Difference]: With dead ends: 61 [2022-04-08 07:44:53,036 INFO L226 Difference]: Without dead ends: 56 [2022-04-08 07:44:53,036 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:44:53,037 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:44:53,037 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:44:53,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-08 07:44:53,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-08 07:44:53,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:53,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 13 states have call successors, (13), 7 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:44:53,083 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 13 states have call successors, (13), 7 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:44:53,084 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 13 states have call successors, (13), 7 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:44:53,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:53,086 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-08 07:44:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-04-08 07:44:53,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:53,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:53,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 13 states have call successors, (13), 7 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 56 states. [2022-04-08 07:44:53,087 INFO L87 Difference]: Start difference. First operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 13 states have call successors, (13), 7 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 56 states. [2022-04-08 07:44:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:53,089 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-08 07:44:53,089 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-04-08 07:44:53,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:53,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:53,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:53,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 13 states have call successors, (13), 7 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:44:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-04-08 07:44:53,091 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 72 [2022-04-08 07:44:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:53,091 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-04-08 07:44:53,091 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:44:53,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 62 transitions. [2022-04-08 07:44:53,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-04-08 07:44:53,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 07:44:53,192 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:53,192 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:44:53,199 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:44:53,396 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:44:53,396 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:53,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:53,396 INFO L85 PathProgramCache]: Analyzing trace with hash 708181929, now seen corresponding path program 15 times [2022-04-08 07:44:53,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:53,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [496945367] [2022-04-08 07:44:53,472 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:53,473 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:53,473 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:53,473 INFO L85 PathProgramCache]: Analyzing trace with hash 708181929, now seen corresponding path program 16 times [2022-04-08 07:44:53,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:53,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238104617] [2022-04-08 07:44:53,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:53,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:53,484 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:53,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [158275962] [2022-04-08 07:44:53,484 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:44:53,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:53,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:53,486 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:44:53,500 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:44:54,178 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:44:54,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:54,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 07:44:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:54,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:54,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {4305#true} call ULTIMATE.init(); {4305#true} is VALID [2022-04-08 07:44:54,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {4305#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); {4305#true} is VALID [2022-04-08 07:44:54,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-08 07:44:54,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4305#true} {4305#true} #60#return; {4305#true} is VALID [2022-04-08 07:44:54,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {4305#true} call #t~ret5 := main(); {4305#true} is VALID [2022-04-08 07:44:54,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {4305#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; {4305#true} is VALID [2022-04-08 07:44:54,681 INFO L272 TraceCheckUtils]: 6: Hoare triple {4305#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {4305#true} is VALID [2022-04-08 07:44:54,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-08 07:44:54,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-08 07:44:54,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-08 07:44:54,682 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4305#true} {4305#true} #52#return; {4305#true} is VALID [2022-04-08 07:44:54,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {4305#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4343#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:54,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {4343#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4343#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:54,682 INFO L272 TraceCheckUtils]: 13: Hoare triple {4343#(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)); {4305#true} is VALID [2022-04-08 07:44:54,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-08 07:44:54,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-08 07:44:54,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-08 07:44:54,683 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4305#true} {4343#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {4343#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:54,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {4343#(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; {4365#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:44:54,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {4365#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {4365#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:44:54,684 INFO L272 TraceCheckUtils]: 20: Hoare triple {4365#(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)); {4305#true} is VALID [2022-04-08 07:44:54,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-08 07:44:54,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-08 07:44:54,684 INFO L290 TraceCheckUtils]: 23: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-08 07:44:54,684 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4305#true} {4365#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {4365#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:44:54,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {4365#(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; {4387#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 07:44:54,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {4387#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {4387#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 07:44:54,685 INFO L272 TraceCheckUtils]: 27: Hoare triple {4387#(and (= (+ (- 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)); {4305#true} is VALID [2022-04-08 07:44:54,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-08 07:44:54,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-08 07:44:54,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-08 07:44:54,686 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4305#true} {4387#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #54#return; {4387#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 07:44:54,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {4387#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4409#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 07:44:54,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {4409#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {4409#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 07:44:54,687 INFO L272 TraceCheckUtils]: 34: Hoare triple {4409#(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)); {4305#true} is VALID [2022-04-08 07:44:54,687 INFO L290 TraceCheckUtils]: 35: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-08 07:44:54,687 INFO L290 TraceCheckUtils]: 36: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-08 07:44:54,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-08 07:44:54,687 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4305#true} {4409#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #54#return; {4409#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 07:44:54,688 INFO L290 TraceCheckUtils]: 39: Hoare triple {4409#(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; {4431#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:44:54,688 INFO L290 TraceCheckUtils]: 40: Hoare triple {4431#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {4431#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:44:54,688 INFO L272 TraceCheckUtils]: 41: Hoare triple {4431#(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)); {4305#true} is VALID [2022-04-08 07:44:54,688 INFO L290 TraceCheckUtils]: 42: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-08 07:44:54,688 INFO L290 TraceCheckUtils]: 43: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-08 07:44:54,688 INFO L290 TraceCheckUtils]: 44: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-08 07:44:54,689 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4305#true} {4431#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {4431#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:44:54,689 INFO L290 TraceCheckUtils]: 46: Hoare triple {4431#(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; {4453#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:44:54,689 INFO L290 TraceCheckUtils]: 47: Hoare triple {4453#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {4453#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:44:54,689 INFO L272 TraceCheckUtils]: 48: Hoare triple {4453#(and (= 5 main_~c~0) (= (+ (- 1) 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)); {4305#true} is VALID [2022-04-08 07:44:54,689 INFO L290 TraceCheckUtils]: 49: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-08 07:44:54,690 INFO L290 TraceCheckUtils]: 50: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-08 07:44:54,690 INFO L290 TraceCheckUtils]: 51: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-08 07:44:54,690 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4305#true} {4453#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #54#return; {4453#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:44:54,690 INFO L290 TraceCheckUtils]: 53: Hoare triple {4453#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4475#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 07:44:54,691 INFO L290 TraceCheckUtils]: 54: Hoare triple {4475#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !false; {4475#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 07:44:54,691 INFO L272 TraceCheckUtils]: 55: Hoare triple {4475#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) 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)); {4305#true} is VALID [2022-04-08 07:44:54,691 INFO L290 TraceCheckUtils]: 56: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-08 07:44:54,691 INFO L290 TraceCheckUtils]: 57: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-08 07:44:54,691 INFO L290 TraceCheckUtils]: 58: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-08 07:44:54,705 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4305#true} {4475#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #54#return; {4475#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 07:44:54,706 INFO L290 TraceCheckUtils]: 60: Hoare triple {4475#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4497#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-08 07:44:54,706 INFO L290 TraceCheckUtils]: 61: Hoare triple {4497#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 4))} assume !false; {4497#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-08 07:44:54,706 INFO L272 TraceCheckUtils]: 62: Hoare triple {4497#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~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)); {4305#true} is VALID [2022-04-08 07:44:54,706 INFO L290 TraceCheckUtils]: 63: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-08 07:44:54,706 INFO L290 TraceCheckUtils]: 64: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-08 07:44:54,706 INFO L290 TraceCheckUtils]: 65: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-08 07:44:54,707 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4305#true} {4497#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 4))} #54#return; {4497#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-08 07:44:54,708 INFO L290 TraceCheckUtils]: 67: Hoare triple {4497#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4519#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 07:44:54,709 INFO L290 TraceCheckUtils]: 68: Hoare triple {4519#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !false; {4519#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 07:44:54,709 INFO L272 TraceCheckUtils]: 69: Hoare triple {4519#(and (< 7 main_~k~0) (= 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)); {4305#true} is VALID [2022-04-08 07:44:54,709 INFO L290 TraceCheckUtils]: 70: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-08 07:44:54,709 INFO L290 TraceCheckUtils]: 71: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-08 07:44:54,709 INFO L290 TraceCheckUtils]: 72: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-08 07:44:54,710 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4305#true} {4519#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #54#return; {4519#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 07:44:54,710 INFO L290 TraceCheckUtils]: 74: Hoare triple {4519#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {4541#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-08 07:44:54,711 INFO L272 TraceCheckUtils]: 75: Hoare triple {4541#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4545#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:44:54,711 INFO L290 TraceCheckUtils]: 76: Hoare triple {4545#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4549#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:54,711 INFO L290 TraceCheckUtils]: 77: Hoare triple {4549#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4306#false} is VALID [2022-04-08 07:44:54,711 INFO L290 TraceCheckUtils]: 78: Hoare triple {4306#false} assume !false; {4306#false} is VALID [2022-04-08 07:44:54,712 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:44:54,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:54,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:54,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238104617] [2022-04-08 07:44:54,995 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:54,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158275962] [2022-04-08 07:44:54,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158275962] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:44:54,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:44:54,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-08 07:44:54,995 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:54,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [496945367] [2022-04-08 07:44:54,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [496945367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:54,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:54,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 07:44:54,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641032361] [2022-04-08 07:44:54,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:54,996 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:44:54,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:54,997 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:44:55,035 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:44:55,035 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 07:44:55,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:55,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 07:44:55,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 07:44:55,036 INFO L87 Difference]: Start difference. First operand 56 states and 62 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:44:55,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:55,870 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-04-08 07:44:55,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 07:44:55,870 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:44:55,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:55,871 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:44:55,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-08 07:44:55,872 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:44:55,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-08 07:44:55,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 64 transitions. [2022-04-08 07:44:55,927 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:44:55,928 INFO L225 Difference]: With dead ends: 64 [2022-04-08 07:44:55,928 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 07:44:55,929 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:44:55,929 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:44:55,929 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:44:55,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 07:44:55,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-08 07:44:55,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:55,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:44:55,970 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:44:55,970 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:44:55,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:55,972 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-04-08 07:44:55,972 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-04-08 07:44:55,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:55,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:55,972 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 59 states. [2022-04-08 07:44:55,972 INFO L87 Difference]: Start difference. First operand has 59 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 59 states. [2022-04-08 07:44:55,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:55,974 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-04-08 07:44:55,974 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-04-08 07:44:55,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:55,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:55,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:55,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:44:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-04-08 07:44:55,976 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 79 [2022-04-08 07:44:55,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:55,976 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-04-08 07:44:55,976 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:44:55,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 66 transitions. [2022-04-08 07:44:56,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:56,061 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-04-08 07:44:56,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-08 07:44:56,062 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:56,062 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:44:56,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 07:44:56,266 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:44:56,267 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:56,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:56,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1649446584, now seen corresponding path program 17 times [2022-04-08 07:44:56,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:56,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2119210926] [2022-04-08 07:44:56,354 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:56,354 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:56,354 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:56,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1649446584, now seen corresponding path program 18 times [2022-04-08 07:44:56,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:56,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108344296] [2022-04-08 07:44:56,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:56,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:56,366 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:56,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1399515285] [2022-04-08 07:44:56,366 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:44:56,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:56,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:56,367 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:44:56,373 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:44:56,664 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 07:44:56,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:56,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 07:44:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:56,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:57,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {4965#true} call ULTIMATE.init(); {4965#true} is VALID [2022-04-08 07:44:57,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {4965#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); {4965#true} is VALID [2022-04-08 07:44:57,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-08 07:44:57,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4965#true} {4965#true} #60#return; {4965#true} is VALID [2022-04-08 07:44:57,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {4965#true} call #t~ret5 := main(); {4965#true} is VALID [2022-04-08 07:44:57,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {4965#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; {4965#true} is VALID [2022-04-08 07:44:57,174 INFO L272 TraceCheckUtils]: 6: Hoare triple {4965#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {4965#true} is VALID [2022-04-08 07:44:57,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-08 07:44:57,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-08 07:44:57,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-08 07:44:57,174 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4965#true} {4965#true} #52#return; {4965#true} is VALID [2022-04-08 07:44:57,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {4965#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5003#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:57,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {5003#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5003#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:57,175 INFO L272 TraceCheckUtils]: 13: Hoare triple {5003#(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)); {4965#true} is VALID [2022-04-08 07:44:57,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-08 07:44:57,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-08 07:44:57,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-08 07:44:57,175 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4965#true} {5003#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {5003#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:57,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {5003#(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; {5025#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:44:57,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {5025#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {5025#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:44:57,176 INFO L272 TraceCheckUtils]: 20: Hoare triple {5025#(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)); {4965#true} is VALID [2022-04-08 07:44:57,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-08 07:44:57,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-08 07:44:57,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-08 07:44:57,177 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4965#true} {5025#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {5025#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:44:57,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {5025#(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; {5047#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:44:57,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {5047#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {5047#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:44:57,178 INFO L272 TraceCheckUtils]: 27: Hoare triple {5047#(and (= (+ (- 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)); {4965#true} is VALID [2022-04-08 07:44:57,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-08 07:44:57,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-08 07:44:57,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-08 07:44:57,178 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4965#true} {5047#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {5047#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:44:57,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {5047#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5069#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:44:57,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {5069#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {5069#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:44:57,179 INFO L272 TraceCheckUtils]: 34: Hoare triple {5069#(and (= main_~y~0 3) (= (+ (- 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)); {4965#true} is VALID [2022-04-08 07:44:57,179 INFO L290 TraceCheckUtils]: 35: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-08 07:44:57,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-08 07:44:57,179 INFO L290 TraceCheckUtils]: 37: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-08 07:44:57,181 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4965#true} {5069#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {5069#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:44:57,181 INFO L290 TraceCheckUtils]: 39: Hoare triple {5069#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5091#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:44:57,181 INFO L290 TraceCheckUtils]: 40: Hoare triple {5091#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {5091#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:44:57,181 INFO L272 TraceCheckUtils]: 41: Hoare triple {5091#(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)); {4965#true} is VALID [2022-04-08 07:44:57,181 INFO L290 TraceCheckUtils]: 42: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-08 07:44:57,182 INFO L290 TraceCheckUtils]: 43: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-08 07:44:57,182 INFO L290 TraceCheckUtils]: 44: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-08 07:44:57,182 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4965#true} {5091#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {5091#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:44:57,182 INFO L290 TraceCheckUtils]: 46: Hoare triple {5091#(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; {5113#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:44:57,183 INFO L290 TraceCheckUtils]: 47: Hoare triple {5113#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !false; {5113#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:44:57,183 INFO L272 TraceCheckUtils]: 48: Hoare triple {5113#(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)); {4965#true} is VALID [2022-04-08 07:44:57,183 INFO L290 TraceCheckUtils]: 49: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-08 07:44:57,183 INFO L290 TraceCheckUtils]: 50: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-08 07:44:57,183 INFO L290 TraceCheckUtils]: 51: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-08 07:44:57,183 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4965#true} {5113#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} #54#return; {5113#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:44:57,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {5113#(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; {5135#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:44:57,184 INFO L290 TraceCheckUtils]: 54: Hoare triple {5135#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {5135#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:44:57,184 INFO L272 TraceCheckUtils]: 55: Hoare triple {5135#(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)); {4965#true} is VALID [2022-04-08 07:44:57,184 INFO L290 TraceCheckUtils]: 56: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-08 07:44:57,184 INFO L290 TraceCheckUtils]: 57: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-08 07:44:57,184 INFO L290 TraceCheckUtils]: 58: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-08 07:44:57,185 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4965#true} {5135#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #54#return; {5135#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:44:57,185 INFO L290 TraceCheckUtils]: 60: Hoare triple {5135#(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; {5157#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 07:44:57,186 INFO L290 TraceCheckUtils]: 61: Hoare triple {5157#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {5157#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 07:44:57,186 INFO L272 TraceCheckUtils]: 62: Hoare triple {5157#(and (= 7 main_~y~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)); {4965#true} is VALID [2022-04-08 07:44:57,186 INFO L290 TraceCheckUtils]: 63: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-08 07:44:57,186 INFO L290 TraceCheckUtils]: 64: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-08 07:44:57,186 INFO L290 TraceCheckUtils]: 65: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-08 07:44:57,186 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4965#true} {5157#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {5157#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 07:44:57,187 INFO L290 TraceCheckUtils]: 67: Hoare triple {5157#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5179#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:44:57,187 INFO L290 TraceCheckUtils]: 68: Hoare triple {5179#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {5179#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:44:57,187 INFO L272 TraceCheckUtils]: 69: Hoare triple {5179#(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)); {4965#true} is VALID [2022-04-08 07:44:57,187 INFO L290 TraceCheckUtils]: 70: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-08 07:44:57,187 INFO L290 TraceCheckUtils]: 71: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-08 07:44:57,187 INFO L290 TraceCheckUtils]: 72: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-08 07:44:57,188 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4965#true} {5179#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {5179#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:44:57,188 INFO L290 TraceCheckUtils]: 74: Hoare triple {5179#(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; {5201#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 07:44:57,188 INFO L290 TraceCheckUtils]: 75: Hoare triple {5201#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {5201#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 07:44:57,188 INFO L272 TraceCheckUtils]: 76: Hoare triple {5201#(and (= 8 (+ (- 1) main_~y~0)) (< 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)); {4965#true} is VALID [2022-04-08 07:44:57,189 INFO L290 TraceCheckUtils]: 77: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-08 07:44:57,189 INFO L290 TraceCheckUtils]: 78: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-08 07:44:57,189 INFO L290 TraceCheckUtils]: 79: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-08 07:44:57,189 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {4965#true} {5201#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} #54#return; {5201#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 07:44:57,190 INFO L290 TraceCheckUtils]: 81: Hoare triple {5201#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {5223#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 07:44:57,190 INFO L272 TraceCheckUtils]: 82: Hoare triple {5223#(and (= 8 (+ (- 1) main_~y~0)) (<= 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)); {5227#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:44:57,191 INFO L290 TraceCheckUtils]: 83: Hoare triple {5227#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5231#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:57,191 INFO L290 TraceCheckUtils]: 84: Hoare triple {5231#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4966#false} is VALID [2022-04-08 07:44:57,191 INFO L290 TraceCheckUtils]: 85: Hoare triple {4966#false} assume !false; {4966#false} is VALID [2022-04-08 07:44:57,191 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:44:57,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:57,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:57,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108344296] [2022-04-08 07:44:57,523 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:57,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399515285] [2022-04-08 07:44:57,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399515285] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:44:57,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:44:57,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-08 07:44:57,523 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:57,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2119210926] [2022-04-08 07:44:57,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2119210926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:57,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:57,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 07:44:57,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998601642] [2022-04-08 07:44:57,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:57,524 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:44:57,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:57,524 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:44:57,566 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:44:57,566 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 07:44:57,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:57,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 07:44:57,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-08 07:44:57,567 INFO L87 Difference]: Start difference. First operand 59 states and 66 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:44:58,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:58,566 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-08 07:44:58,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 07:44:58,566 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:44:58,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:58,566 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:44:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-08 07:44:58,568 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:44:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-08 07:44:58,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 68 transitions. [2022-04-08 07:44:58,627 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:44:58,628 INFO L225 Difference]: With dead ends: 67 [2022-04-08 07:44:58,628 INFO L226 Difference]: Without dead ends: 62 [2022-04-08 07:44:58,629 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-08 07:44:58,629 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:58,629 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 395 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 07:44:58,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-08 07:44:58,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-08 07:44:58,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:58,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:44:58,668 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:44:58,668 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:44:58,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:58,670 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-04-08 07:44:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-04-08 07:44:58,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:58,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:58,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 62 states. [2022-04-08 07:44:58,671 INFO L87 Difference]: Start difference. First operand has 62 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 62 states. [2022-04-08 07:44:58,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:58,673 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-04-08 07:44:58,673 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-04-08 07:44:58,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:58,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:58,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:58,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:44:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2022-04-08 07:44:58,675 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 86 [2022-04-08 07:44:58,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:58,676 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2022-04-08 07:44:58,676 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:44:58,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 70 transitions. [2022-04-08 07:44:58,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-04-08 07:44:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-08 07:44:58,771 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:58,771 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:44:58,778 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:44:58,975 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:44:58,975 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:58,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:58,976 INFO L85 PathProgramCache]: Analyzing trace with hash -373309751, now seen corresponding path program 19 times [2022-04-08 07:44:58,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:58,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2121855644] [2022-04-08 07:44:59,062 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:59,062 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:59,062 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:59,062 INFO L85 PathProgramCache]: Analyzing trace with hash -373309751, now seen corresponding path program 20 times [2022-04-08 07:44:59,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:59,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071707799] [2022-04-08 07:44:59,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:59,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:59,073 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:59,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [795419074] [2022-04-08 07:44:59,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:44:59,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:59,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:59,074 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:44:59,080 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:44:59,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:44:59,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:59,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 07:44:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:59,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:00,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {5665#true} call ULTIMATE.init(); {5665#true} is VALID [2022-04-08 07:45:00,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {5665#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); {5665#true} is VALID [2022-04-08 07:45:00,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:00,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5665#true} {5665#true} #60#return; {5665#true} is VALID [2022-04-08 07:45:00,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {5665#true} call #t~ret5 := main(); {5665#true} is VALID [2022-04-08 07:45:00,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {5665#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; {5665#true} is VALID [2022-04-08 07:45:00,878 INFO L272 TraceCheckUtils]: 6: Hoare triple {5665#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {5665#true} is VALID [2022-04-08 07:45:00,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {5665#true} ~cond := #in~cond; {5691#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 07:45:00,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {5691#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {5695#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:45:00,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {5695#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5695#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:45:00,879 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5695#(not (= |assume_abort_if_not_#in~cond| 0))} {5665#true} #52#return; {5702#(and (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-08 07:45:00,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {5702#(and (<= main_~k~0 10) (<= 0 main_~k~0))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5706#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:00,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {5706#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0) (= main_~y~0 0))} assume !false; {5706#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:00,880 INFO L272 TraceCheckUtils]: 13: Hoare triple {5706#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~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)); {5665#true} is VALID [2022-04-08 07:45:00,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:00,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:00,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:00,880 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5665#true} {5706#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0) (= main_~y~0 0))} #54#return; {5706#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:00,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {5706#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~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; {5728#(and (<= 1 main_~c~0) (<= main_~k~0 10) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~k~0))} is VALID [2022-04-08 07:45:00,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {5728#(and (<= 1 main_~c~0) (<= main_~k~0 10) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~k~0))} assume !false; {5728#(and (<= 1 main_~c~0) (<= main_~k~0 10) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~k~0))} is VALID [2022-04-08 07:45:00,882 INFO L272 TraceCheckUtils]: 20: Hoare triple {5728#(and (<= 1 main_~c~0) (<= main_~k~0 10) (= (+ (- 1) 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)); {5665#true} is VALID [2022-04-08 07:45:00,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:00,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:00,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:00,882 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5665#true} {5728#(and (<= 1 main_~c~0) (<= main_~k~0 10) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~k~0))} #54#return; {5728#(and (<= 1 main_~c~0) (<= main_~k~0 10) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~k~0))} is VALID [2022-04-08 07:45:00,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {5728#(and (<= 1 main_~c~0) (<= main_~k~0 10) (= (+ (- 1) 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; {5750#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-08 07:45:00,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {5750#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !false; {5750#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-08 07:45:00,883 INFO L272 TraceCheckUtils]: 27: Hoare triple {5750#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 0) (<= 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)); {5665#true} is VALID [2022-04-08 07:45:00,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:00,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:00,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:00,884 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5665#true} {5750#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~k~0) (<= 2 main_~c~0))} #54#return; {5750#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-08 07:45:00,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {5750#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 0) (<= 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; {5772#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 07:45:00,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {5772#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0) (= (+ main_~y~0 (- 3)) 0))} assume !false; {5772#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 07:45:00,885 INFO L272 TraceCheckUtils]: 34: Hoare triple {5772#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~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)); {5665#true} is VALID [2022-04-08 07:45:00,885 INFO L290 TraceCheckUtils]: 35: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:00,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:00,885 INFO L290 TraceCheckUtils]: 37: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:00,887 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5665#true} {5772#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0) (= (+ main_~y~0 (- 3)) 0))} #54#return; {5772#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 07:45:00,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {5772#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~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; {5794#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= main_~y~0 4) (<= 4 main_~c~0))} is VALID [2022-04-08 07:45:00,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {5794#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= main_~y~0 4) (<= 4 main_~c~0))} assume !false; {5794#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= main_~y~0 4) (<= 4 main_~c~0))} is VALID [2022-04-08 07:45:00,888 INFO L272 TraceCheckUtils]: 41: Hoare triple {5794#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= main_~y~0 4) (<= 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)); {5665#true} is VALID [2022-04-08 07:45:00,889 INFO L290 TraceCheckUtils]: 42: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:00,889 INFO L290 TraceCheckUtils]: 43: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:00,889 INFO L290 TraceCheckUtils]: 44: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:00,889 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5665#true} {5794#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= main_~y~0 4) (<= 4 main_~c~0))} #54#return; {5794#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= main_~y~0 4) (<= 4 main_~c~0))} is VALID [2022-04-08 07:45:00,890 INFO L290 TraceCheckUtils]: 46: Hoare triple {5794#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= main_~y~0 4) (<= 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; {5816#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= 5 main_~y~0) (<= 5 main_~c~0))} is VALID [2022-04-08 07:45:00,892 INFO L290 TraceCheckUtils]: 47: Hoare triple {5816#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= 5 main_~y~0) (<= 5 main_~c~0))} assume !false; {5816#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= 5 main_~y~0) (<= 5 main_~c~0))} is VALID [2022-04-08 07:45:00,892 INFO L272 TraceCheckUtils]: 48: Hoare triple {5816#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= 5 main_~y~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)); {5665#true} is VALID [2022-04-08 07:45:00,892 INFO L290 TraceCheckUtils]: 49: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:00,892 INFO L290 TraceCheckUtils]: 50: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:00,893 INFO L290 TraceCheckUtils]: 51: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:00,893 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5665#true} {5816#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= 5 main_~y~0) (<= 5 main_~c~0))} #54#return; {5816#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= 5 main_~y~0) (<= 5 main_~c~0))} is VALID [2022-04-08 07:45:00,894 INFO L290 TraceCheckUtils]: 53: Hoare triple {5816#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= 5 main_~y~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; {5838#(and (= main_~y~0 6) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-08 07:45:00,894 INFO L290 TraceCheckUtils]: 54: Hoare triple {5838#(and (= main_~y~0 6) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} assume !false; {5838#(and (= main_~y~0 6) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-08 07:45:00,894 INFO L272 TraceCheckUtils]: 55: Hoare triple {5838#(and (= main_~y~0 6) (<= main_~k~0 10) (<= 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)); {5665#true} is VALID [2022-04-08 07:45:00,894 INFO L290 TraceCheckUtils]: 56: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:00,894 INFO L290 TraceCheckUtils]: 57: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:00,894 INFO L290 TraceCheckUtils]: 58: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:00,895 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5665#true} {5838#(and (= main_~y~0 6) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} #54#return; {5838#(and (= main_~y~0 6) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-08 07:45:00,896 INFO L290 TraceCheckUtils]: 60: Hoare triple {5838#(and (= main_~y~0 6) (<= main_~k~0 10) (<= 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; {5860#(and (= 7 main_~y~0) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-08 07:45:00,896 INFO L290 TraceCheckUtils]: 61: Hoare triple {5860#(and (= 7 main_~y~0) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} assume !false; {5860#(and (= 7 main_~y~0) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-08 07:45:00,896 INFO L272 TraceCheckUtils]: 62: Hoare triple {5860#(and (= 7 main_~y~0) (<= main_~k~0 10) (<= 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)); {5665#true} is VALID [2022-04-08 07:45:00,896 INFO L290 TraceCheckUtils]: 63: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:00,896 INFO L290 TraceCheckUtils]: 64: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:00,896 INFO L290 TraceCheckUtils]: 65: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:00,898 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5665#true} {5860#(and (= 7 main_~y~0) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} #54#return; {5860#(and (= 7 main_~y~0) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-08 07:45:00,899 INFO L290 TraceCheckUtils]: 67: Hoare triple {5860#(and (= 7 main_~y~0) (<= main_~k~0 10) (<= 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; {5882#(and (<= main_~k~0 10) (= 7 (+ (- 1) main_~y~0)) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-08 07:45:00,899 INFO L290 TraceCheckUtils]: 68: Hoare triple {5882#(and (<= main_~k~0 10) (= 7 (+ (- 1) main_~y~0)) (<= 0 main_~k~0) (<= 8 main_~c~0))} assume !false; {5882#(and (<= main_~k~0 10) (= 7 (+ (- 1) main_~y~0)) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-08 07:45:00,900 INFO L272 TraceCheckUtils]: 69: Hoare triple {5882#(and (<= main_~k~0 10) (= 7 (+ (- 1) main_~y~0)) (<= 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)); {5665#true} is VALID [2022-04-08 07:45:00,900 INFO L290 TraceCheckUtils]: 70: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:00,900 INFO L290 TraceCheckUtils]: 71: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:00,900 INFO L290 TraceCheckUtils]: 72: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:00,900 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5665#true} {5882#(and (<= main_~k~0 10) (= 7 (+ (- 1) main_~y~0)) (<= 0 main_~k~0) (<= 8 main_~c~0))} #54#return; {5882#(and (<= main_~k~0 10) (= 7 (+ (- 1) main_~y~0)) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-08 07:45:00,901 INFO L290 TraceCheckUtils]: 74: Hoare triple {5882#(and (<= main_~k~0 10) (= 7 (+ (- 1) main_~y~0)) (<= 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; {5904#(and (<= 9 main_~c~0) (<= main_~k~0 10) (= main_~y~0 9) (<= 0 main_~k~0))} is VALID [2022-04-08 07:45:00,901 INFO L290 TraceCheckUtils]: 75: Hoare triple {5904#(and (<= 9 main_~c~0) (<= main_~k~0 10) (= main_~y~0 9) (<= 0 main_~k~0))} assume !false; {5904#(and (<= 9 main_~c~0) (<= main_~k~0 10) (= main_~y~0 9) (<= 0 main_~k~0))} is VALID [2022-04-08 07:45:00,901 INFO L272 TraceCheckUtils]: 76: Hoare triple {5904#(and (<= 9 main_~c~0) (<= main_~k~0 10) (= main_~y~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)); {5665#true} is VALID [2022-04-08 07:45:00,901 INFO L290 TraceCheckUtils]: 77: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:00,901 INFO L290 TraceCheckUtils]: 78: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:00,901 INFO L290 TraceCheckUtils]: 79: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:00,902 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {5665#true} {5904#(and (<= 9 main_~c~0) (<= main_~k~0 10) (= main_~y~0 9) (<= 0 main_~k~0))} #54#return; {5904#(and (<= 9 main_~c~0) (<= main_~k~0 10) (= main_~y~0 9) (<= 0 main_~k~0))} is VALID [2022-04-08 07:45:00,902 INFO L290 TraceCheckUtils]: 81: Hoare triple {5904#(and (<= 9 main_~c~0) (<= main_~k~0 10) (= main_~y~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; {5926#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 07:45:00,903 INFO L290 TraceCheckUtils]: 82: Hoare triple {5926#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} assume !false; {5926#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 07:45:00,903 INFO L272 TraceCheckUtils]: 83: Hoare triple {5926#(and (<= main_~k~0 10) (= main_~y~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)); {5665#true} is VALID [2022-04-08 07:45:00,903 INFO L290 TraceCheckUtils]: 84: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:00,903 INFO L290 TraceCheckUtils]: 85: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:00,903 INFO L290 TraceCheckUtils]: 86: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:00,903 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {5665#true} {5926#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} #54#return; {5926#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 07:45:00,904 INFO L290 TraceCheckUtils]: 88: Hoare triple {5926#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {5926#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 07:45:00,904 INFO L272 TraceCheckUtils]: 89: Hoare triple {5926#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5951#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:00,905 INFO L290 TraceCheckUtils]: 90: Hoare triple {5951#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5955#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:00,905 INFO L290 TraceCheckUtils]: 91: Hoare triple {5955#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5666#false} is VALID [2022-04-08 07:45:00,905 INFO L290 TraceCheckUtils]: 92: Hoare triple {5666#false} assume !false; {5666#false} is VALID [2022-04-08 07:45:00,905 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:00,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:02,127 INFO L290 TraceCheckUtils]: 92: Hoare triple {5666#false} assume !false; {5666#false} is VALID [2022-04-08 07:45:02,128 INFO L290 TraceCheckUtils]: 91: Hoare triple {5955#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5666#false} is VALID [2022-04-08 07:45:02,128 INFO L290 TraceCheckUtils]: 90: Hoare triple {5951#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5955#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:02,129 INFO L272 TraceCheckUtils]: 89: Hoare triple {5971#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5951#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:02,129 INFO L290 TraceCheckUtils]: 88: Hoare triple {5971#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} assume !(~c~0 < ~k~0); {5971#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} is VALID [2022-04-08 07:45:02,130 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {5665#true} {5971#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} #54#return; {5971#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} is VALID [2022-04-08 07:45:02,130 INFO L290 TraceCheckUtils]: 86: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:02,130 INFO L290 TraceCheckUtils]: 85: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:02,130 INFO L290 TraceCheckUtils]: 84: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:02,130 INFO L272 TraceCheckUtils]: 83: Hoare triple {5971#(= (* main_~y~0 main_~y~0) (* main_~k~0 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)); {5665#true} is VALID [2022-04-08 07:45:02,143 INFO L290 TraceCheckUtils]: 82: Hoare triple {5971#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} assume !false; {5971#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} is VALID [2022-04-08 07:45:02,157 INFO L290 TraceCheckUtils]: 81: Hoare triple {5996#(or (not (< main_~c~0 main_~k~0)) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5971#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} is VALID [2022-04-08 07:45:02,158 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {5665#true} {5996#(or (not (< main_~c~0 main_~k~0)) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} #54#return; {5996#(or (not (< main_~c~0 main_~k~0)) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} is VALID [2022-04-08 07:45:02,158 INFO L290 TraceCheckUtils]: 79: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:02,158 INFO L290 TraceCheckUtils]: 78: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:02,158 INFO L290 TraceCheckUtils]: 77: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:02,158 INFO L272 TraceCheckUtils]: 76: Hoare triple {5996#(or (not (< main_~c~0 main_~k~0)) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 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)); {5665#true} is VALID [2022-04-08 07:45:02,159 INFO L290 TraceCheckUtils]: 75: Hoare triple {5996#(or (not (< main_~c~0 main_~k~0)) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} assume !false; {5996#(or (not (< main_~c~0 main_~k~0)) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} is VALID [2022-04-08 07:45:02,160 INFO L290 TraceCheckUtils]: 74: Hoare triple {6018#(or (<= main_~k~0 (+ main_~c~0 1)) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5996#(or (not (< main_~c~0 main_~k~0)) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} is VALID [2022-04-08 07:45:02,161 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5665#true} {6018#(or (<= main_~k~0 (+ main_~c~0 1)) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} #54#return; {6018#(or (<= main_~k~0 (+ main_~c~0 1)) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} is VALID [2022-04-08 07:45:02,161 INFO L290 TraceCheckUtils]: 72: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:02,161 INFO L290 TraceCheckUtils]: 71: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:02,161 INFO L290 TraceCheckUtils]: 70: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:02,161 INFO L272 TraceCheckUtils]: 69: Hoare triple {6018#(or (<= main_~k~0 (+ main_~c~0 1)) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~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)); {5665#true} is VALID [2022-04-08 07:45:02,161 INFO L290 TraceCheckUtils]: 68: Hoare triple {6018#(or (<= main_~k~0 (+ main_~c~0 1)) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} assume !false; {6018#(or (<= main_~k~0 (+ main_~c~0 1)) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} is VALID [2022-04-08 07:45:02,163 INFO L290 TraceCheckUtils]: 67: Hoare triple {6040#(or (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (<= main_~k~0 (+ main_~c~0 2)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6018#(or (<= main_~k~0 (+ main_~c~0 1)) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} is VALID [2022-04-08 07:45:02,164 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5665#true} {6040#(or (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (<= main_~k~0 (+ main_~c~0 2)))} #54#return; {6040#(or (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (<= main_~k~0 (+ main_~c~0 2)))} is VALID [2022-04-08 07:45:02,164 INFO L290 TraceCheckUtils]: 65: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:02,164 INFO L290 TraceCheckUtils]: 64: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:02,164 INFO L290 TraceCheckUtils]: 63: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:02,164 INFO L272 TraceCheckUtils]: 62: Hoare triple {6040#(or (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (<= main_~k~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)); {5665#true} is VALID [2022-04-08 07:45:02,164 INFO L290 TraceCheckUtils]: 61: Hoare triple {6040#(or (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (<= main_~k~0 (+ main_~c~0 2)))} assume !false; {6040#(or (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (<= main_~k~0 (+ main_~c~0 2)))} is VALID [2022-04-08 07:45:02,166 INFO L290 TraceCheckUtils]: 60: Hoare triple {6062#(or (<= main_~k~0 (+ main_~c~0 3)) (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ 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; {6040#(or (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (<= main_~k~0 (+ main_~c~0 2)))} is VALID [2022-04-08 07:45:02,167 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5665#true} {6062#(or (<= main_~k~0 (+ main_~c~0 3)) (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))))} #54#return; {6062#(or (<= main_~k~0 (+ main_~c~0 3)) (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))))} is VALID [2022-04-08 07:45:02,167 INFO L290 TraceCheckUtils]: 58: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:02,167 INFO L290 TraceCheckUtils]: 57: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:02,167 INFO L290 TraceCheckUtils]: 56: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:02,167 INFO L272 TraceCheckUtils]: 55: Hoare triple {6062#(or (<= main_~k~0 (+ main_~c~0 3)) (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ 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)); {5665#true} is VALID [2022-04-08 07:45:02,167 INFO L290 TraceCheckUtils]: 54: Hoare triple {6062#(or (<= main_~k~0 (+ main_~c~0 3)) (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))))} assume !false; {6062#(or (<= main_~k~0 (+ main_~c~0 3)) (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))))} is VALID [2022-04-08 07:45:02,169 INFO L290 TraceCheckUtils]: 53: Hoare triple {6084#(or (= (* (+ 5 main_~y~0) main_~k~0) (* (+ 5 main_~y~0) (+ 5 main_~y~0))) (<= main_~k~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; {6062#(or (<= main_~k~0 (+ main_~c~0 3)) (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))))} is VALID [2022-04-08 07:45:02,169 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5665#true} {6084#(or (= (* (+ 5 main_~y~0) main_~k~0) (* (+ 5 main_~y~0) (+ 5 main_~y~0))) (<= main_~k~0 (+ main_~c~0 4)))} #54#return; {6084#(or (= (* (+ 5 main_~y~0) main_~k~0) (* (+ 5 main_~y~0) (+ 5 main_~y~0))) (<= main_~k~0 (+ main_~c~0 4)))} is VALID [2022-04-08 07:45:02,170 INFO L290 TraceCheckUtils]: 51: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:02,170 INFO L290 TraceCheckUtils]: 50: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:02,170 INFO L290 TraceCheckUtils]: 49: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:02,170 INFO L272 TraceCheckUtils]: 48: Hoare triple {6084#(or (= (* (+ 5 main_~y~0) main_~k~0) (* (+ 5 main_~y~0) (+ 5 main_~y~0))) (<= 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)); {5665#true} is VALID [2022-04-08 07:45:02,170 INFO L290 TraceCheckUtils]: 47: Hoare triple {6084#(or (= (* (+ 5 main_~y~0) main_~k~0) (* (+ 5 main_~y~0) (+ 5 main_~y~0))) (<= main_~k~0 (+ main_~c~0 4)))} assume !false; {6084#(or (= (* (+ 5 main_~y~0) main_~k~0) (* (+ 5 main_~y~0) (+ 5 main_~y~0))) (<= main_~k~0 (+ main_~c~0 4)))} is VALID [2022-04-08 07:45:02,172 INFO L290 TraceCheckUtils]: 46: Hoare triple {6106#(or (<= main_~k~0 (+ 5 main_~c~0)) (= (* (+ main_~y~0 6) (+ main_~y~0 6)) (* (+ main_~y~0 6) 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; {6084#(or (= (* (+ 5 main_~y~0) main_~k~0) (* (+ 5 main_~y~0) (+ 5 main_~y~0))) (<= main_~k~0 (+ main_~c~0 4)))} is VALID [2022-04-08 07:45:02,172 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5665#true} {6106#(or (<= main_~k~0 (+ 5 main_~c~0)) (= (* (+ main_~y~0 6) (+ main_~y~0 6)) (* (+ main_~y~0 6) main_~k~0)))} #54#return; {6106#(or (<= main_~k~0 (+ 5 main_~c~0)) (= (* (+ main_~y~0 6) (+ main_~y~0 6)) (* (+ main_~y~0 6) main_~k~0)))} is VALID [2022-04-08 07:45:02,172 INFO L290 TraceCheckUtils]: 44: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:02,172 INFO L290 TraceCheckUtils]: 43: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:02,172 INFO L290 TraceCheckUtils]: 42: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:02,173 INFO L272 TraceCheckUtils]: 41: Hoare triple {6106#(or (<= main_~k~0 (+ 5 main_~c~0)) (= (* (+ main_~y~0 6) (+ main_~y~0 6)) (* (+ 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)); {5665#true} is VALID [2022-04-08 07:45:02,173 INFO L290 TraceCheckUtils]: 40: Hoare triple {6106#(or (<= main_~k~0 (+ 5 main_~c~0)) (= (* (+ main_~y~0 6) (+ main_~y~0 6)) (* (+ main_~y~0 6) main_~k~0)))} assume !false; {6106#(or (<= main_~k~0 (+ 5 main_~c~0)) (= (* (+ main_~y~0 6) (+ main_~y~0 6)) (* (+ main_~y~0 6) main_~k~0)))} is VALID [2022-04-08 07:45:02,175 INFO L290 TraceCheckUtils]: 39: Hoare triple {6128#(or (= (* (+ 7 main_~y~0) main_~k~0) (* (+ 7 main_~y~0) (+ 7 main_~y~0))) (<= main_~k~0 (+ 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; {6106#(or (<= main_~k~0 (+ 5 main_~c~0)) (= (* (+ main_~y~0 6) (+ main_~y~0 6)) (* (+ main_~y~0 6) main_~k~0)))} is VALID [2022-04-08 07:45:02,175 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5665#true} {6128#(or (= (* (+ 7 main_~y~0) main_~k~0) (* (+ 7 main_~y~0) (+ 7 main_~y~0))) (<= main_~k~0 (+ main_~c~0 6)))} #54#return; {6128#(or (= (* (+ 7 main_~y~0) main_~k~0) (* (+ 7 main_~y~0) (+ 7 main_~y~0))) (<= main_~k~0 (+ main_~c~0 6)))} is VALID [2022-04-08 07:45:02,175 INFO L290 TraceCheckUtils]: 37: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:02,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:02,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:02,175 INFO L272 TraceCheckUtils]: 34: Hoare triple {6128#(or (= (* (+ 7 main_~y~0) main_~k~0) (* (+ 7 main_~y~0) (+ 7 main_~y~0))) (<= main_~k~0 (+ 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)); {5665#true} is VALID [2022-04-08 07:45:02,176 INFO L290 TraceCheckUtils]: 33: Hoare triple {6128#(or (= (* (+ 7 main_~y~0) main_~k~0) (* (+ 7 main_~y~0) (+ 7 main_~y~0))) (<= main_~k~0 (+ main_~c~0 6)))} assume !false; {6128#(or (= (* (+ 7 main_~y~0) main_~k~0) (* (+ 7 main_~y~0) (+ 7 main_~y~0))) (<= main_~k~0 (+ main_~c~0 6)))} is VALID [2022-04-08 07:45:02,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {6150#(or (= (* (+ main_~y~0 8) (+ main_~y~0 8)) (* (+ main_~y~0 8) main_~k~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; {6128#(or (= (* (+ 7 main_~y~0) main_~k~0) (* (+ 7 main_~y~0) (+ 7 main_~y~0))) (<= main_~k~0 (+ main_~c~0 6)))} is VALID [2022-04-08 07:45:02,180 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5665#true} {6150#(or (= (* (+ main_~y~0 8) (+ main_~y~0 8)) (* (+ main_~y~0 8) main_~k~0)) (<= main_~k~0 (+ 7 main_~c~0)))} #54#return; {6150#(or (= (* (+ main_~y~0 8) (+ main_~y~0 8)) (* (+ main_~y~0 8) main_~k~0)) (<= main_~k~0 (+ 7 main_~c~0)))} is VALID [2022-04-08 07:45:02,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:02,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:02,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:02,180 INFO L272 TraceCheckUtils]: 27: Hoare triple {6150#(or (= (* (+ main_~y~0 8) (+ main_~y~0 8)) (* (+ main_~y~0 8) main_~k~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)); {5665#true} is VALID [2022-04-08 07:45:02,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {6150#(or (= (* (+ main_~y~0 8) (+ main_~y~0 8)) (* (+ main_~y~0 8) main_~k~0)) (<= main_~k~0 (+ 7 main_~c~0)))} assume !false; {6150#(or (= (* (+ main_~y~0 8) (+ main_~y~0 8)) (* (+ main_~y~0 8) main_~k~0)) (<= main_~k~0 (+ 7 main_~c~0)))} is VALID [2022-04-08 07:45:02,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {6172#(or (= (* main_~k~0 (+ main_~y~0 9)) (* (+ main_~y~0 9) (+ main_~y~0 9))) (<= main_~k~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; {6150#(or (= (* (+ main_~y~0 8) (+ main_~y~0 8)) (* (+ main_~y~0 8) main_~k~0)) (<= main_~k~0 (+ 7 main_~c~0)))} is VALID [2022-04-08 07:45:02,183 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5665#true} {6172#(or (= (* main_~k~0 (+ main_~y~0 9)) (* (+ main_~y~0 9) (+ main_~y~0 9))) (<= main_~k~0 (+ main_~c~0 8)))} #54#return; {6172#(or (= (* main_~k~0 (+ main_~y~0 9)) (* (+ main_~y~0 9) (+ main_~y~0 9))) (<= main_~k~0 (+ main_~c~0 8)))} is VALID [2022-04-08 07:45:02,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:02,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:02,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:02,183 INFO L272 TraceCheckUtils]: 20: Hoare triple {6172#(or (= (* main_~k~0 (+ main_~y~0 9)) (* (+ main_~y~0 9) (+ main_~y~0 9))) (<= main_~k~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)); {5665#true} is VALID [2022-04-08 07:45:02,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {6172#(or (= (* main_~k~0 (+ main_~y~0 9)) (* (+ main_~y~0 9) (+ main_~y~0 9))) (<= main_~k~0 (+ main_~c~0 8)))} assume !false; {6172#(or (= (* main_~k~0 (+ main_~y~0 9)) (* (+ main_~y~0 9) (+ main_~y~0 9))) (<= main_~k~0 (+ main_~c~0 8)))} is VALID [2022-04-08 07:45:02,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {6194#(or (= (* (+ main_~y~0 10) (+ main_~y~0 10)) (* main_~k~0 (+ main_~y~0 10))) (<= 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; {6172#(or (= (* main_~k~0 (+ main_~y~0 9)) (* (+ main_~y~0 9) (+ main_~y~0 9))) (<= main_~k~0 (+ main_~c~0 8)))} is VALID [2022-04-08 07:45:02,186 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5665#true} {6194#(or (= (* (+ main_~y~0 10) (+ main_~y~0 10)) (* main_~k~0 (+ main_~y~0 10))) (<= main_~k~0 (+ main_~c~0 9)))} #54#return; {6194#(or (= (* (+ main_~y~0 10) (+ main_~y~0 10)) (* main_~k~0 (+ main_~y~0 10))) (<= main_~k~0 (+ main_~c~0 9)))} is VALID [2022-04-08 07:45:02,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:02,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-08 07:45:02,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-08 07:45:02,186 INFO L272 TraceCheckUtils]: 13: Hoare triple {6194#(or (= (* (+ main_~y~0 10) (+ main_~y~0 10)) (* main_~k~0 (+ main_~y~0 10))) (<= 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)); {5665#true} is VALID [2022-04-08 07:45:02,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {6194#(or (= (* (+ main_~y~0 10) (+ main_~y~0 10)) (* main_~k~0 (+ main_~y~0 10))) (<= main_~k~0 (+ main_~c~0 9)))} assume !false; {6194#(or (= (* (+ main_~y~0 10) (+ main_~y~0 10)) (* main_~k~0 (+ main_~y~0 10))) (<= main_~k~0 (+ main_~c~0 9)))} is VALID [2022-04-08 07:45:02,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {6216#(or (<= main_~k~0 9) (= (* main_~k~0 10) 100))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6194#(or (= (* (+ main_~y~0 10) (+ main_~y~0 10)) (* main_~k~0 (+ main_~y~0 10))) (<= main_~k~0 (+ main_~c~0 9)))} is VALID [2022-04-08 07:45:02,188 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5695#(not (= |assume_abort_if_not_#in~cond| 0))} {5665#true} #52#return; {6216#(or (<= main_~k~0 9) (= (* main_~k~0 10) 100))} is VALID [2022-04-08 07:45:02,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {5695#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5695#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:45:02,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {6229#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {5695#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:45:02,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {5665#true} ~cond := #in~cond; {6229#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 07:45:02,189 INFO L272 TraceCheckUtils]: 6: Hoare triple {5665#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {5665#true} is VALID [2022-04-08 07:45:02,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {5665#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; {5665#true} is VALID [2022-04-08 07:45:02,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {5665#true} call #t~ret5 := main(); {5665#true} is VALID [2022-04-08 07:45:02,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5665#true} {5665#true} #60#return; {5665#true} is VALID [2022-04-08 07:45:02,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-08 07:45:02,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {5665#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); {5665#true} is VALID [2022-04-08 07:45:02,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {5665#true} call ULTIMATE.init(); {5665#true} is VALID [2022-04-08 07:45:02,190 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:02,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:02,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071707799] [2022-04-08 07:45:02,190 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:02,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795419074] [2022-04-08 07:45:02,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795419074] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:45:02,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:45:02,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 31 [2022-04-08 07:45:02,191 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:02,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2121855644] [2022-04-08 07:45:02,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2121855644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:02,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:02,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 07:45:02,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126149859] [2022-04-08 07:45:02,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:02,192 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 states have internal predecessors, (35), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) Word has length 93 [2022-04-08 07:45:02,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:02,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 states have internal predecessors, (35), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 07:45:02,239 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:02,239 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 07:45:02,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:02,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 07:45:02,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2022-04-08 07:45:02,240 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 states have internal predecessors, (35), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 07:45:03,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:03,454 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2022-04-08 07:45:03,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 07:45:03,455 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 states have internal predecessors, (35), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) Word has length 93 [2022-04-08 07:45:03,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:03,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 states have internal predecessors, (35), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 07:45:03,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 72 transitions. [2022-04-08 07:45:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 states have internal predecessors, (35), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 07:45:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 72 transitions. [2022-04-08 07:45:03,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 72 transitions. [2022-04-08 07:45:03,516 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:03,519 INFO L225 Difference]: With dead ends: 70 [2022-04-08 07:45:03,519 INFO L226 Difference]: Without dead ends: 65 [2022-04-08 07:45:03,519 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 07:45:03,520 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 19 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:03,520 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 338 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 07:45:03,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-08 07:45:03,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-08 07:45:03,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:03,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 07:45:03,601 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 07:45:03,601 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 07:45:03,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:03,602 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-04-08 07:45:03,602 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2022-04-08 07:45:03,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:03,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:03,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 65 states. [2022-04-08 07:45:03,603 INFO L87 Difference]: Start difference. First operand has 65 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 65 states. [2022-04-08 07:45:03,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:03,604 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-04-08 07:45:03,605 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2022-04-08 07:45:03,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:03,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:03,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:03,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:03,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 07:45:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2022-04-08 07:45:03,607 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 93 [2022-04-08 07:45:03,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:03,607 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2022-04-08 07:45:03,607 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 states have internal predecessors, (35), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 07:45:03,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 74 transitions. [2022-04-08 07:45:03,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:03,709 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2022-04-08 07:45:03,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-08 07:45:03,711 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:03,711 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:03,718 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:03,915 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:03,915 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:03,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:03,916 INFO L85 PathProgramCache]: Analyzing trace with hash -22647256, now seen corresponding path program 21 times [2022-04-08 07:45:03,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:03,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [912916688] [2022-04-08 07:45:04,039 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,039 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:04,039 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:04,039 INFO L85 PathProgramCache]: Analyzing trace with hash -22647256, now seen corresponding path program 22 times [2022-04-08 07:45:04,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:04,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723346150] [2022-04-08 07:45:04,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:04,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:04,066 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:04,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1380223843] [2022-04-08 07:45:04,066 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:45:04,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:04,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:04,071 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:04,072 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:04,139 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:45:04,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:04,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 07:45:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:04,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:04,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {6657#true} call ULTIMATE.init(); {6657#true} is VALID [2022-04-08 07:45:04,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {6657#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); {6657#true} is VALID [2022-04-08 07:45:04,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-08 07:45:04,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6657#true} {6657#true} #60#return; {6657#true} is VALID [2022-04-08 07:45:04,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {6657#true} call #t~ret5 := main(); {6657#true} is VALID [2022-04-08 07:45:04,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {6657#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; {6657#true} is VALID [2022-04-08 07:45:04,936 INFO L272 TraceCheckUtils]: 6: Hoare triple {6657#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {6657#true} is VALID [2022-04-08 07:45:04,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {6657#true} ~cond := #in~cond; {6683#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 07:45:04,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {6683#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6687#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:45:04,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {6687#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6687#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:45:04,937 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6687#(not (= |assume_abort_if_not_#in~cond| 0))} {6657#true} #52#return; {6694#(and (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-08 07:45:04,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {6694#(and (<= main_~k~0 10) (<= 0 main_~k~0))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6698#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-08 07:45:04,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {6698#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} assume !false; {6698#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-08 07:45:04,938 INFO L272 TraceCheckUtils]: 13: Hoare triple {6698#(and (<= main_~k~0 10) (<= 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)); {6657#true} is VALID [2022-04-08 07:45:04,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-08 07:45:04,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-08 07:45:04,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-08 07:45:04,938 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6657#true} {6698#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} #54#return; {6698#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-08 07:45:04,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {6698#(and (<= main_~k~0 10) (<= 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; {6720#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-08 07:45:04,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {6720#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} assume !false; {6720#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-08 07:45:04,940 INFO L272 TraceCheckUtils]: 20: Hoare triple {6720#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 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)); {6657#true} is VALID [2022-04-08 07:45:04,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-08 07:45:04,940 INFO L290 TraceCheckUtils]: 22: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-08 07:45:04,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-08 07:45:04,940 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6657#true} {6720#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} #54#return; {6720#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-08 07:45:04,941 INFO L290 TraceCheckUtils]: 25: Hoare triple {6720#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 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; {6742#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-08 07:45:04,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {6742#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !false; {6742#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-08 07:45:04,942 INFO L272 TraceCheckUtils]: 27: Hoare triple {6742#(and (<= main_~k~0 10) (<= 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)); {6657#true} is VALID [2022-04-08 07:45:04,942 INFO L290 TraceCheckUtils]: 28: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-08 07:45:04,942 INFO L290 TraceCheckUtils]: 29: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-08 07:45:04,942 INFO L290 TraceCheckUtils]: 30: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-08 07:45:04,942 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6657#true} {6742#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} #54#return; {6742#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-08 07:45:04,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {6742#(and (<= main_~k~0 10) (<= 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; {6764#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-08 07:45:04,943 INFO L290 TraceCheckUtils]: 33: Hoare triple {6764#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} assume !false; {6764#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-08 07:45:04,943 INFO L272 TraceCheckUtils]: 34: Hoare triple {6764#(and (<= main_~k~0 10) (<= 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)); {6657#true} is VALID [2022-04-08 07:45:04,943 INFO L290 TraceCheckUtils]: 35: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-08 07:45:04,943 INFO L290 TraceCheckUtils]: 36: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-08 07:45:04,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-08 07:45:04,944 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6657#true} {6764#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} #54#return; {6764#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-08 07:45:04,944 INFO L290 TraceCheckUtils]: 39: Hoare triple {6764#(and (<= main_~k~0 10) (<= 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; {6786#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-08 07:45:04,945 INFO L290 TraceCheckUtils]: 40: Hoare triple {6786#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} assume !false; {6786#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-08 07:45:04,945 INFO L272 TraceCheckUtils]: 41: Hoare triple {6786#(and (<= main_~k~0 10) (<= 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)); {6657#true} is VALID [2022-04-08 07:45:04,945 INFO L290 TraceCheckUtils]: 42: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-08 07:45:04,945 INFO L290 TraceCheckUtils]: 43: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-08 07:45:04,945 INFO L290 TraceCheckUtils]: 44: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-08 07:45:04,945 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6657#true} {6786#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} #54#return; {6786#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-08 07:45:04,946 INFO L290 TraceCheckUtils]: 46: Hoare triple {6786#(and (<= main_~k~0 10) (<= 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; {6808#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-08 07:45:04,946 INFO L290 TraceCheckUtils]: 47: Hoare triple {6808#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !false; {6808#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-08 07:45:04,947 INFO L272 TraceCheckUtils]: 48: Hoare triple {6808#(and (<= main_~k~0 10) (<= 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)); {6657#true} is VALID [2022-04-08 07:45:04,947 INFO L290 TraceCheckUtils]: 49: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-08 07:45:04,947 INFO L290 TraceCheckUtils]: 50: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-08 07:45:04,947 INFO L290 TraceCheckUtils]: 51: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-08 07:45:04,947 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6657#true} {6808#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} #54#return; {6808#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-08 07:45:04,948 INFO L290 TraceCheckUtils]: 53: Hoare triple {6808#(and (<= main_~k~0 10) (<= 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; {6830#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-08 07:45:04,948 INFO L290 TraceCheckUtils]: 54: Hoare triple {6830#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} assume !false; {6830#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-08 07:45:04,948 INFO L272 TraceCheckUtils]: 55: Hoare triple {6830#(and (<= main_~k~0 10) (<= 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)); {6657#true} is VALID [2022-04-08 07:45:04,948 INFO L290 TraceCheckUtils]: 56: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-08 07:45:04,948 INFO L290 TraceCheckUtils]: 57: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-08 07:45:04,948 INFO L290 TraceCheckUtils]: 58: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-08 07:45:04,949 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6657#true} {6830#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} #54#return; {6830#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-08 07:45:04,949 INFO L290 TraceCheckUtils]: 60: Hoare triple {6830#(and (<= main_~k~0 10) (<= 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; {6852#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-08 07:45:04,950 INFO L290 TraceCheckUtils]: 61: Hoare triple {6852#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} assume !false; {6852#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-08 07:45:04,950 INFO L272 TraceCheckUtils]: 62: Hoare triple {6852#(and (<= main_~k~0 10) (<= 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)); {6657#true} is VALID [2022-04-08 07:45:04,950 INFO L290 TraceCheckUtils]: 63: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-08 07:45:04,950 INFO L290 TraceCheckUtils]: 64: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-08 07:45:04,950 INFO L290 TraceCheckUtils]: 65: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-08 07:45:04,950 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6657#true} {6852#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} #54#return; {6852#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-08 07:45:04,951 INFO L290 TraceCheckUtils]: 67: Hoare triple {6852#(and (<= main_~k~0 10) (<= 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; {6874#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-08 07:45:04,952 INFO L290 TraceCheckUtils]: 68: Hoare triple {6874#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} assume !false; {6874#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-08 07:45:04,952 INFO L272 TraceCheckUtils]: 69: Hoare triple {6874#(and (<= main_~k~0 10) (<= 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)); {6657#true} is VALID [2022-04-08 07:45:04,952 INFO L290 TraceCheckUtils]: 70: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-08 07:45:04,952 INFO L290 TraceCheckUtils]: 71: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-08 07:45:04,952 INFO L290 TraceCheckUtils]: 72: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-08 07:45:04,952 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6657#true} {6874#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} #54#return; {6874#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-08 07:45:04,953 INFO L290 TraceCheckUtils]: 74: Hoare triple {6874#(and (<= main_~k~0 10) (<= 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; {6896#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-08 07:45:04,953 INFO L290 TraceCheckUtils]: 75: Hoare triple {6896#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} assume !false; {6896#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-08 07:45:04,953 INFO L272 TraceCheckUtils]: 76: Hoare triple {6896#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 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)); {6657#true} is VALID [2022-04-08 07:45:04,953 INFO L290 TraceCheckUtils]: 77: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-08 07:45:04,954 INFO L290 TraceCheckUtils]: 78: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-08 07:45:04,954 INFO L290 TraceCheckUtils]: 79: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-08 07:45:04,954 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6657#true} {6896#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} #54#return; {6896#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-08 07:45:04,955 INFO L290 TraceCheckUtils]: 81: Hoare triple {6896#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 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; {6918#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-08 07:45:04,955 INFO L290 TraceCheckUtils]: 82: Hoare triple {6918#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} assume !false; {6918#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-08 07:45:04,955 INFO L272 TraceCheckUtils]: 83: Hoare triple {6918#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 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)); {6657#true} is VALID [2022-04-08 07:45:04,955 INFO L290 TraceCheckUtils]: 84: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-08 07:45:04,955 INFO L290 TraceCheckUtils]: 85: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-08 07:45:04,955 INFO L290 TraceCheckUtils]: 86: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-08 07:45:04,956 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {6657#true} {6918#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} #54#return; {6918#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-08 07:45:04,956 INFO L290 TraceCheckUtils]: 88: Hoare triple {6918#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 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; {6658#false} is VALID [2022-04-08 07:45:04,957 INFO L290 TraceCheckUtils]: 89: Hoare triple {6658#false} assume !false; {6658#false} is VALID [2022-04-08 07:45:04,957 INFO L272 TraceCheckUtils]: 90: Hoare triple {6658#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)); {6658#false} is VALID [2022-04-08 07:45:04,957 INFO L290 TraceCheckUtils]: 91: Hoare triple {6658#false} ~cond := #in~cond; {6658#false} is VALID [2022-04-08 07:45:04,957 INFO L290 TraceCheckUtils]: 92: Hoare triple {6658#false} assume !(0 == ~cond); {6658#false} is VALID [2022-04-08 07:45:04,957 INFO L290 TraceCheckUtils]: 93: Hoare triple {6658#false} assume true; {6658#false} is VALID [2022-04-08 07:45:04,957 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {6658#false} {6658#false} #54#return; {6658#false} is VALID [2022-04-08 07:45:04,957 INFO L290 TraceCheckUtils]: 95: Hoare triple {6658#false} assume !(~c~0 < ~k~0); {6658#false} is VALID [2022-04-08 07:45:04,957 INFO L272 TraceCheckUtils]: 96: Hoare triple {6658#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6658#false} is VALID [2022-04-08 07:45:04,957 INFO L290 TraceCheckUtils]: 97: Hoare triple {6658#false} ~cond := #in~cond; {6658#false} is VALID [2022-04-08 07:45:04,957 INFO L290 TraceCheckUtils]: 98: Hoare triple {6658#false} assume 0 == ~cond; {6658#false} is VALID [2022-04-08 07:45:04,957 INFO L290 TraceCheckUtils]: 99: Hoare triple {6658#false} assume !false; {6658#false} is VALID [2022-04-08 07:45:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-04-08 07:45:04,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:45:04,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:04,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723346150] [2022-04-08 07:45:04,958 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:04,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380223843] [2022-04-08 07:45:04,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380223843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:04,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:04,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 07:45:04,958 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:04,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [912916688] [2022-04-08 07:45:04,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [912916688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:04,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:04,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 07:45:04,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385994941] [2022-04-08 07:45:04,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:04,959 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) Word has length 100 [2022-04-08 07:45:04,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:04,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 07:45:05,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:05,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 07:45:05,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:05,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 07:45:05,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2022-04-08 07:45:05,009 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 07:45:05,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:05,409 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-04-08 07:45:05,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 07:45:05,410 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) Word has length 100 [2022-04-08 07:45:05,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 07:45:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 70 transitions. [2022-04-08 07:45:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 07:45:05,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 70 transitions. [2022-04-08 07:45:05,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 70 transitions. [2022-04-08 07:45:05,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:05,466 INFO L225 Difference]: With dead ends: 69 [2022-04-08 07:45:05,466 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 07:45:05,467 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2022-04-08 07:45:05,467 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:05,467 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 216 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:45:05,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 07:45:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 07:45:05,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:05,468 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:45:05,468 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:45:05,468 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:45:05,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:05,468 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 07:45:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 07:45:05,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:05,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:05,468 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:45:05,468 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:45:05,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:05,468 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 07:45:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 07:45:05,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:05,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:05,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:05,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:05,469 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:45:05,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 07:45:05,469 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2022-04-08 07:45:05,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:05,469 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 07:45:05,469 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 07:45:05,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 07:45:05,469 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:45:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 07:45:05,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:05,471 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 07:45:05,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 07:45:05,691 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:05,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 07:45:06,815 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 07:45:06,815 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 07:45:06,815 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 07:45:06,816 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-08 07:45:06,816 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:45:06,816 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:45:06,816 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:45:06,816 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 17 40) the Hoare annotation is: true [2022-04-08 07:45:06,816 INFO L878 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 10)) (.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 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and (= main_~y~0 6) .cse0 (= main_~c~0 6) (< 5 main_~k~0) .cse1) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and (<= 10 main_~c~0) .cse0 (= main_~y~0 10) (< 9 main_~k~0) .cse1) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1) (and (= 7 main_~y~0) .cse0 (= 7 main_~c~0) .cse1 (< 6 main_~k~0)) (and .cse0 (= 5 main_~c~0) (= 5 main_~y~0) .cse1 (< 4 main_~k~0)) (and (< 7 main_~k~0) .cse0 (= main_~y~0 8) (= main_~c~0 8) .cse1) (and .cse0 (= main_~y~0 3) (< 2 main_~k~0) .cse1 (= main_~c~0 3)) (and (<= 9 main_~c~0) .cse0 (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9) .cse1))) [2022-04-08 07:45:06,816 INFO L878 garLoopResultBuilder]: At program point L28-1(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 10)) (.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 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and (= main_~y~0 6) .cse0 (= main_~c~0 6) (< 5 main_~k~0) .cse1) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and (<= 10 main_~c~0) .cse0 (= main_~y~0 10) (< 9 main_~k~0) .cse1) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1) (and (= 7 main_~y~0) .cse0 (= 7 main_~c~0) .cse1 (< 6 main_~k~0)) (and .cse0 (= 5 main_~c~0) (= 5 main_~y~0) .cse1 (< 4 main_~k~0)) (and (< 7 main_~k~0) .cse0 (= main_~y~0 8) (= main_~c~0 8) .cse1) (and .cse0 (= main_~y~0 3) (< 2 main_~k~0) .cse1 (= main_~c~0 3)) (and (<= 9 main_~c~0) .cse0 (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9) .cse1))) [2022-04-08 07:45:06,816 INFO L878 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 10)) (.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 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and (= main_~y~0 6) .cse0 (= main_~c~0 6) (< 5 main_~k~0) .cse1) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and (<= 10 main_~c~0) .cse0 (= main_~y~0 10) (< 9 main_~k~0) .cse1) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1) (and (= 7 main_~y~0) .cse0 (= 7 main_~c~0) .cse1 (< 6 main_~k~0)) (and .cse0 (= 5 main_~c~0) (= 5 main_~y~0) .cse1 (< 4 main_~k~0)) (and (< 7 main_~k~0) .cse0 (= main_~y~0 8) (= main_~c~0 8) .cse1) (and .cse0 (= main_~y~0 3) (< 2 main_~k~0) .cse1 (= main_~c~0 3)) (and (<= 9 main_~c~0) .cse0 (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9) .cse1))) [2022-04-08 07:45:06,816 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 17 40) the Hoare annotation is: true [2022-04-08 07:45:06,817 INFO L878 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (let ((.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_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0) (<= main_~c~0 9) .cse0) (and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0) .cse0) (and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2) (<= main_~c~0 2) .cse0) (and (<= main_~c~0 3) (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0) .cse0) (and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0) .cse0 (<= main_~c~0 1)) (and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0) .cse0 (<= main_~c~0 6)) (and (<= main_~c~0 5) (<= main_~k~0 5) (= 5 main_~y~0) .cse0 (< 4 main_~k~0)) (and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4) .cse0 (<= main_~c~0 4)) (and (<= main_~k~0 7) (<= main_~c~0 7) (= 7 main_~y~0) .cse0 (< 6 main_~k~0)) (and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= main_~k~0 8) .cse0))) [2022-04-08 07:45:06,817 INFO L885 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-08 07:45:06,817 INFO L878 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (<= main_~k~0 10) (<= 0 main_~k~0)) [2022-04-08 07:45:06,817 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 17 40) the Hoare annotation is: true [2022-04-08 07:45:06,817 INFO L885 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: true [2022-04-08 07:45:06,817 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:45:06,817 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 07:45:06,817 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:45:06,817 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 07:45:06,817 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 07:45:06,817 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 07:45:06,817 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 07:45:06,817 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 07:45:06,817 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-08 07:45:06,818 INFO L878 garLoopResultBuilder]: At program point L11(lines 11 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 07:45:06,818 INFO L878 garLoopResultBuilder]: At program point L10(lines 10 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 07:45:06,818 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 9 15) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 07:45:06,818 INFO L878 garLoopResultBuilder]: At program point L10-2(lines 9 15) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 07:45:06,818 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:45:06,824 INFO L719 BasicCegarLoop]: Path program histogram: [22, 2, 2, 2] [2022-04-08 07:45:06,825 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 07:45:06,829 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 07:45:06,831 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 07:45:06,868 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:45:06,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 07:45:06 BoogieIcfgContainer [2022-04-08 07:45:06,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 07:45:06,886 INFO L158 Benchmark]: Toolchain (without parser) took 44023.47ms. Allocated memory was 197.1MB in the beginning and 313.5MB in the end (delta: 116.4MB). Free memory was 145.3MB in the beginning and 211.9MB in the end (delta: -66.5MB). Peak memory consumption was 155.3MB. Max. memory is 8.0GB. [2022-04-08 07:45:06,886 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 197.1MB. Free memory is still 161.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 07:45:06,887 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.72ms. Allocated memory was 197.1MB in the beginning and 261.1MB in the end (delta: 64.0MB). Free memory was 145.1MB in the beginning and 237.5MB in the end (delta: -92.4MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2022-04-08 07:45:06,891 INFO L158 Benchmark]: Boogie Preprocessor took 23.49ms. Allocated memory is still 261.1MB. Free memory was 237.5MB in the beginning and 236.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 07:45:06,891 INFO L158 Benchmark]: RCFGBuilder took 232.64ms. Allocated memory is still 261.1MB. Free memory was 236.0MB in the beginning and 224.9MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 07:45:06,892 INFO L158 Benchmark]: TraceAbstraction took 43551.20ms. Allocated memory was 261.1MB in the beginning and 313.5MB in the end (delta: 52.4MB). Free memory was 224.5MB in the beginning and 211.9MB in the end (delta: 12.7MB). Peak memory consumption was 171.3MB. Max. memory is 8.0GB. [2022-04-08 07:45:06,893 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.13ms. Allocated memory is still 197.1MB. Free memory is still 161.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.72ms. Allocated memory was 197.1MB in the beginning and 261.1MB in the end (delta: 64.0MB). Free memory was 145.1MB in the beginning and 237.5MB in the end (delta: -92.4MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.49ms. Allocated memory is still 261.1MB. Free memory was 237.5MB in the beginning and 236.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 232.64ms. Allocated memory is still 261.1MB. Free memory was 236.0MB in the beginning and 224.9MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 43551.20ms. Allocated memory was 261.1MB in the beginning and 313.5MB in the end (delta: 52.4MB). Free memory was 224.5MB in the beginning and 211.9MB in the end (delta: 12.7MB). Peak memory consumption was 171.3MB. 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: 43.4s, OverallIterations: 14, TraceHistogramMax: 13, PathProgramHistogramMax: 22, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 88 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 2952 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2461 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2551 IncrementalHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 491 mSDtfsCounter, 2551 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1008 GetRequests, 807 SyntacticMatches, 12 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=13, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 196 PreInvPairs, 304 NumberOfFragments, 1490 HoareAnnotationTreeSize, 196 FomulaSimplifications, 724 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 28 FomulaSimplificationsInter, 191 FormulaSimplificationTreeSizeReductionInter, 0.8s 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 <= 10 && 0 <= k) && c == 0) && y == 0) && y * y * y * y + y * y + y * y * y * 2 == x * 4) || ((((y == 6 && k <= 10) && c == 6) && 5 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 10 && y == 4) && c == 4) && 3 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 10 && y == 1) && 0 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c == 1)) || ((((10 <= c && k <= 10) && y == 10) && 9 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((y == 2 && k <= 10) && 1 < k) && c == 2) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((7 == y && k <= 10) && 7 == c) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 6 < k)) || ((((k <= 10 && 5 == c) && 5 == y) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 4 < k)) || ((((7 < k && k <= 10) && y == 8) && c == 8) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 10 && y == 3) && 2 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c == 3)) || (((((9 <= c && k <= 10) && y == 9) && 8 < k) && c <= 9) && 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: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-08 07:45:06,917 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...