/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/ps6-ll_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 07:58:56,022 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 07:58:56,024 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 07:58:56,060 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 07:58:56,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 07:58:56,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 07:58:56,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 07:58:56,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 07:58:56,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 07:58:56,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 07:58:56,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 07:58:56,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 07:58:56,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 07:58:56,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 07:58:56,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 07:58:56,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 07:58:56,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 07:58:56,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 07:58:56,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 07:58:56,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 07:58:56,097 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 07:58:56,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 07:58:56,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 07:58:56,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 07:58:56,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 07:58:56,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 07:58:56,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 07:58:56,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 07:58:56,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 07:58:56,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 07:58:56,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 07:58:56,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 07:58:56,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 07:58:56,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 07:58:56,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 07:58:56,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 07:58:56,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 07:58:56,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 07:58:56,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 07:58:56,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 07:58:56,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 07:58:56,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 07:58:56,116 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 07:58:56,131 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 07:58:56,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 07:58:56,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 07:58:56,133 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 07:58:56,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 07:58:56,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 07:58:56,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 07:58:56,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 07:58:56,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 07:58:56,134 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 07:58:56,134 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 07:58:56,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 07:58:56,135 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 07:58:56,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 07:58:56,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 07:58:56,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 07:58:56,135 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 07:58:56,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 07:58:56,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:58:56,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 07:58:56,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 07:58:56,136 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 07:58:56,136 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 07:58:56,136 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 07:58:56,136 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 07:58:56,136 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 07:58:56,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 07:58:56,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 07:58:56,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 07:58:56,430 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 07:58:56,431 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 07:58:56,433 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound50.c [2022-04-28 07:58:56,484 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ef626df/88c36b26301549499030836d359f4b67/FLAGe17f8fa1d [2022-04-28 07:58:56,878 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 07:58:56,878 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound50.c [2022-04-28 07:58:56,888 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ef626df/88c36b26301549499030836d359f4b67/FLAGe17f8fa1d [2022-04-28 07:58:57,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ef626df/88c36b26301549499030836d359f4b67 [2022-04-28 07:58:57,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 07:58:57,289 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 07:58:57,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 07:58:57,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 07:58:57,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 07:58:57,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:58:57" (1/1) ... [2022-04-28 07:58:57,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d4a2d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:57, skipping insertion in model container [2022-04-28 07:58:57,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:58:57" (1/1) ... [2022-04-28 07:58:57,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 07:58:57,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 07:58:57,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound50.c[458,471] [2022-04-28 07:58:57,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:58:57,539 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 07:58:57,557 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound50.c[458,471] [2022-04-28 07:58:57,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:58:57,584 INFO L208 MainTranslator]: Completed translation [2022-04-28 07:58:57,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:57 WrapperNode [2022-04-28 07:58:57,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 07:58:57,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 07:58:57,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 07:58:57,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 07:58:57,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:57" (1/1) ... [2022-04-28 07:58:57,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:57" (1/1) ... [2022-04-28 07:58:57,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:57" (1/1) ... [2022-04-28 07:58:57,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:57" (1/1) ... [2022-04-28 07:58:57,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:57" (1/1) ... [2022-04-28 07:58:57,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:57" (1/1) ... [2022-04-28 07:58:57,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:57" (1/1) ... [2022-04-28 07:58:57,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 07:58:57,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 07:58:57,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 07:58:57,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 07:58:57,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:57" (1/1) ... [2022-04-28 07:58:57,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:58:57,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:57,665 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 07:58:57,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 07:58:57,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 07:58:57,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 07:58:57,715 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 07:58:57,715 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 07:58:57,715 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 07:58:57,716 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 07:58:57,716 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 07:58:57,716 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 07:58:57,716 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 07:58:57,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 07:58:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 07:58:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 07:58:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 07:58:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 07:58:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 07:58:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 07:58:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 07:58:57,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 07:58:57,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 07:58:57,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 07:58:57,779 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 07:58:57,781 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 07:58:57,983 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 07:58:57,989 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 07:58:57,990 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 07:58:57,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:58:57 BoogieIcfgContainer [2022-04-28 07:58:57,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 07:58:57,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 07:58:57,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 07:58:58,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 07:58:58,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 07:58:57" (1/3) ... [2022-04-28 07:58:58,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bcc4c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:58:58, skipping insertion in model container [2022-04-28 07:58:58,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:57" (2/3) ... [2022-04-28 07:58:58,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bcc4c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:58:58, skipping insertion in model container [2022-04-28 07:58:58,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:58:57" (3/3) ... [2022-04-28 07:58:58,021 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound50.c [2022-04-28 07:58:58,036 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 07:58:58,036 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 07:58:58,091 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 07:58:58,098 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@26d87e31, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60a1a20b [2022-04-28 07:58:58,099 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 07:58:58,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:58,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 07:58:58,116 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:58,116 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:58,117 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:58,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:58,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-28 07:58:58,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:58,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [860933145] [2022-04-28 07:58:58,143 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:58,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 2 times [2022-04-28 07:58:58,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:58,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420717480] [2022-04-28 07:58:58,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:58,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:58,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:58:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:58,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(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); {32#true} is VALID [2022-04-28 07:58:58,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 07:58:58,370 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-28 07:58:58,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 07:58:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:58,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:58:58,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:58:58,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:58:58,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 07:58:58,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 07:58:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:58,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:58:58,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:58:58,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:58:58,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-28 07:58:58,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 07:58:58,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(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); {32#true} is VALID [2022-04-28 07:58:58,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 07:58:58,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-28 07:58:58,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-28 07:58:58,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-28 07:58:58,391 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {32#true} is VALID [2022-04-28 07:58:58,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:58:58,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:58:58,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:58:58,392 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 07:58:58,392 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-28 07:58:58,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:58:58,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:58:58,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:58:58,394 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-28 07:58:58,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-28 07:58:58,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-28 07:58:58,394 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {33#false} is VALID [2022-04-28 07:58:58,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-28 07:58:58,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-28 07:58:58,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 07:58:58,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:58:58,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:58,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420717480] [2022-04-28 07:58:58,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420717480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:58,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:58,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:58:58,400 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:58,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [860933145] [2022-04-28 07:58:58,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [860933145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:58,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:58,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:58:58,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365697889] [2022-04-28 07:58:58,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:58,409 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 07:58:58,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:58,414 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:58:58,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:58,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 07:58:58,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:58,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 07:58:58,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:58:58,484 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:58:58,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:58,869 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-28 07:58:58,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 07:58:58,870 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 07:58:58,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:58,872 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:58:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-28 07:58:58,881 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:58:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-28 07:58:58,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-28 07:58:58,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:58,978 INFO L225 Difference]: With dead ends: 51 [2022-04-28 07:58:58,978 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 07:58:58,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:58:58,984 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:58,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:58:59,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 07:58:59,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 07:58:59,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:59,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:58:59,020 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:58:59,021 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:58:59,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:59,025 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 07:58:59,026 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 07:58:59,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:59,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:59,027 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-28 07:58:59,027 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-28 07:58:59,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:59,040 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 07:58:59,040 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 07:58:59,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:59,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:59,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:59,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:59,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:58:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-28 07:58:59,051 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-28 07:58:59,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:59,052 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-28 07:58:59,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:58:59,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-28 07:58:59,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 07:58:59,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 07:58:59,094 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:59,094 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:59,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 07:58:59,095 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:59,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:59,096 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-28 07:58:59,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:59,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [760281631] [2022-04-28 07:58:59,098 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:59,098 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 2 times [2022-04-28 07:58:59,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:59,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525836066] [2022-04-28 07:58:59,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:59,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:59,137 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:59,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [635727912] [2022-04-28 07:58:59,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:59,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:59,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:59,145 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:58:59,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 07:58:59,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:58:59,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:59,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:58:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:59,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:59,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2022-04-28 07:58:59,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#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); {246#true} is VALID [2022-04-28 07:58:59,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 07:58:59,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #63#return; {246#true} is VALID [2022-04-28 07:58:59,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret5 := main(); {246#true} is VALID [2022-04-28 07:58:59,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#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; {246#true} is VALID [2022-04-28 07:58:59,365 INFO L272 TraceCheckUtils]: 6: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {246#true} is VALID [2022-04-28 07:58:59,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-28 07:58:59,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-28 07:58:59,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 07:58:59,368 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#true} {246#true} #53#return; {246#true} is VALID [2022-04-28 07:58:59,369 INFO L272 TraceCheckUtils]: 11: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {246#true} is VALID [2022-04-28 07:58:59,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-28 07:58:59,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-28 07:58:59,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 07:58:59,372 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {246#true} {246#true} #55#return; {246#true} is VALID [2022-04-28 07:58:59,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:59,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:59,376 INFO L272 TraceCheckUtils]: 18: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:59,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:59,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {247#false} is VALID [2022-04-28 07:58:59,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-04-28 07:58:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:58:59,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:58:59,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:59,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525836066] [2022-04-28 07:58:59,378 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:59,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635727912] [2022-04-28 07:58:59,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635727912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:59,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:59,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:58:59,380 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:59,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [760281631] [2022-04-28 07:58:59,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [760281631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:59,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:59,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:58:59,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160119084] [2022-04-28 07:58:59,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:59,382 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 07:58:59,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:59,383 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:58:59,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:59,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:58:59,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:59,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:58:59,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:58:59,404 INFO L87 Difference]: Start difference. First operand 24 states and 27 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:58:59,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:59,669 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-28 07:58:59,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:58:59,670 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 07:58:59,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:59,670 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:58:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 07:58:59,673 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:58:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 07:58:59,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-28 07:58:59,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:59,731 INFO L225 Difference]: With dead ends: 35 [2022-04-28 07:58:59,731 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 07:58:59,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 07:58:59,734 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 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-28 07:58:59,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:58:59,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 07:58:59,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 07:58:59,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:59,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:59,756 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:59,756 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:59,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:59,759 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-28 07:58:59,760 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 07:58:59,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:59,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:59,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-28 07:58:59,761 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-28 07:58:59,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:59,764 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-28 07:58:59,764 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 07:58:59,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:59,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:59,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:59,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:59,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-28 07:58:59,768 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-28 07:58:59,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:59,768 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-28 07:58:59,769 INFO L496 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:58:59,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-28 07:58:59,815 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-28 07:58:59,816 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 07:58:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 07:58:59,817 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:59,817 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:59,854 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-28 07:59:00,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:00,040 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:00,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:00,040 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-28 07:59:00,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:00,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [583180739] [2022-04-28 07:59:00,041 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:59:00,041 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 2 times [2022-04-28 07:59:00,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:00,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827876365] [2022-04-28 07:59:00,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:00,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:00,062 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:00,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1950998550] [2022-04-28 07:59:00,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:59:00,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:00,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:00,064 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:00,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 07:59:00,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:59:00,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:00,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:59:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:00,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:00,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-28 07:59:00,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#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); {512#true} is VALID [2022-04-28 07:59:00,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:59:00,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-28 07:59:00,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-28 07:59:00,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#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; {512#true} is VALID [2022-04-28 07:59:00,316 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {512#true} is VALID [2022-04-28 07:59:00,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:59:00,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:59:00,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:59:00,317 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-28 07:59:00,317 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-28 07:59:00,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:59:00,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:59:00,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:59:00,318 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-28 07:59:00,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:00,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:00,322 INFO L272 TraceCheckUtils]: 18: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {512#true} is VALID [2022-04-28 07:59:00,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:59:00,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:59:00,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:59:00,324 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {565#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:00,324 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-28 07:59:00,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} assume !false; {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-28 07:59:00,326 INFO L272 TraceCheckUtils]: 25: Hoare triple {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:00,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:00,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-28 07:59:00,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-28 07:59:00,329 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:59:00,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:00,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-28 07:59:00,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-28 07:59:00,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:00,526 INFO L272 TraceCheckUtils]: 25: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:00,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:59:00,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:59:00,582 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #57#return; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:59:00,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:59:00,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:59:00,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:59:00,583 INFO L272 TraceCheckUtils]: 18: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {512#true} is VALID [2022-04-28 07:59:00,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:59:00,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:59:00,586 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-28 07:59:00,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:59:00,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:59:00,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:59:00,587 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-28 07:59:00,587 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-28 07:59:00,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:59:00,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:59:00,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:59:00,588 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {512#true} is VALID [2022-04-28 07:59:00,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#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; {512#true} is VALID [2022-04-28 07:59:00,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-28 07:59:00,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-28 07:59:00,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:59:00,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#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); {512#true} is VALID [2022-04-28 07:59:00,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-28 07:59:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 07:59:00,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:00,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827876365] [2022-04-28 07:59:00,590 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:00,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950998550] [2022-04-28 07:59:00,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950998550] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 07:59:00,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:59:00,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 07:59:00,591 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:00,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [583180739] [2022-04-28 07:59:00,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [583180739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:00,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:00,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:59:00,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450347998] [2022-04-28 07:59:00,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:00,592 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-28 07:59:00,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:00,593 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:59:00,677 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-28 07:59:00,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:59:00,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:00,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:59:00,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 07:59:00,679 INFO L87 Difference]: Start difference. First operand 31 states and 34 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:59:00,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:00,838 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 07:59:00,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:59:00,838 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-28 07:59:00,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:00,839 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:59:00,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 07:59:00,841 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:59:00,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 07:59:00,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 07:59:00,925 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-28 07:59:00,927 INFO L225 Difference]: With dead ends: 37 [2022-04-28 07:59:00,927 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 07:59:00,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 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-28 07:59:00,928 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:00,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:59:00,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 07:59:00,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 07:59:00,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:00,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:59:00,945 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:59:00,945 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:59:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:00,948 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 07:59:00,948 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 07:59:00,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:00,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:00,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-28 07:59:00,949 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-28 07:59:00,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:00,951 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 07:59:00,952 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 07:59:00,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:00,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:00,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:00,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:00,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:59:00,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-28 07:59:00,955 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-28 07:59:00,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:00,955 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-28 07:59:00,955 INFO L496 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:59:00,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-28 07:59:01,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 07:59:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 07:59:01,119 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:01,119 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:01,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 07:59:01,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 07:59:01,320 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:01,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:01,320 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-28 07:59:01,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:01,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [878948617] [2022-04-28 07:59:01,321 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:59:01,321 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 2 times [2022-04-28 07:59:01,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:01,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10744470] [2022-04-28 07:59:01,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:01,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:01,336 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:01,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [494223130] [2022-04-28 07:59:01,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:59:01,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:01,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:01,338 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:01,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 07:59:01,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:59:01,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:01,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 07:59:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:01,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:01,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2022-04-28 07:59:01,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {900#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); {900#true} is VALID [2022-04-28 07:59:01,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:59:01,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #63#return; {900#true} is VALID [2022-04-28 07:59:01,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret5 := main(); {900#true} is VALID [2022-04-28 07:59:01,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {900#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; {900#true} is VALID [2022-04-28 07:59:01,799 INFO L272 TraceCheckUtils]: 6: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {900#true} is VALID [2022-04-28 07:59:01,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 07:59:01,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 07:59:01,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:59:01,799 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#true} {900#true} #53#return; {900#true} is VALID [2022-04-28 07:59:01,800 INFO L272 TraceCheckUtils]: 11: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {900#true} is VALID [2022-04-28 07:59:01,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 07:59:01,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 07:59:01,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:59:01,820 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {900#true} {900#true} #55#return; {900#true} is VALID [2022-04-28 07:59:01,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {900#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:01,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:01,827 INFO L272 TraceCheckUtils]: 18: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {900#true} is VALID [2022-04-28 07:59:01,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 07:59:01,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 07:59:01,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:59:01,828 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {900#true} {953#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:01,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:59:01,829 INFO L290 TraceCheckUtils]: 24: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:59:01,830 INFO L272 TraceCheckUtils]: 25: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {900#true} is VALID [2022-04-28 07:59:01,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 07:59:01,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 07:59:01,830 INFO L290 TraceCheckUtils]: 28: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:59:01,832 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {900#true} {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #57#return; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:59:01,833 INFO L290 TraceCheckUtils]: 30: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:59:01,833 INFO L272 TraceCheckUtils]: 31: Hoare triple {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {900#true} is VALID [2022-04-28 07:59:01,833 INFO L290 TraceCheckUtils]: 32: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 07:59:01,833 INFO L290 TraceCheckUtils]: 33: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 07:59:01,833 INFO L290 TraceCheckUtils]: 34: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:59:01,834 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {900#true} {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #59#return; {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:59:01,835 INFO L272 TraceCheckUtils]: 36: Hoare triple {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:01,836 INFO L290 TraceCheckUtils]: 37: Hoare triple {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:01,836 INFO L290 TraceCheckUtils]: 38: Hoare triple {1020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {901#false} is VALID [2022-04-28 07:59:01,836 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#false} assume !false; {901#false} is VALID [2022-04-28 07:59:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 07:59:01,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:02,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:02,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10744470] [2022-04-28 07:59:02,237 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:02,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494223130] [2022-04-28 07:59:02,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494223130] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:59:02,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:59:02,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 07:59:02,238 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:02,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [878948617] [2022-04-28 07:59:02,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [878948617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:02,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:02,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:59:02,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212635920] [2022-04-28 07:59:02,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:02,239 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-28 07:59:02,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:02,240 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 07:59:02,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:02,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:59:02,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:02,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:59:02,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:59:02,281 INFO L87 Difference]: Start difference. First operand 33 states and 35 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 07:59:02,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:02,565 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 07:59:02,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 07:59:02,566 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-28 07:59:02,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:02,567 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 07:59:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 07:59:02,570 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 07:59:02,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 07:59:02,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-28 07:59:02,609 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-28 07:59:02,611 INFO L225 Difference]: With dead ends: 42 [2022-04-28 07:59:02,611 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 07:59:02,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:59:02,612 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:02,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:59:02,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 07:59:02,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 07:59:02,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:02,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:59:02,637 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:59:02,639 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:59:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:02,644 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-28 07:59:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-28 07:59:02,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:02,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:02,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-28 07:59:02,651 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-28 07:59:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:02,657 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-28 07:59:02,657 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-28 07:59:02,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:02,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:02,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:02,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:02,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:59:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-28 07:59:02,660 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-28 07:59:02,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:02,661 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-28 07:59:02,661 INFO L496 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 07:59:02,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 39 transitions. [2022-04-28 07:59:02,809 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-28 07:59:02,810 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-28 07:59:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 07:59:02,810 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:02,811 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:02,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 07:59:03,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:03,016 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:03,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:03,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 3 times [2022-04-28 07:59:03,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:03,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [365160309] [2022-04-28 07:59:03,017 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:59:03,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 4 times [2022-04-28 07:59:03,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:03,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464500403] [2022-04-28 07:59:03,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:03,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:03,044 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:03,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [318387410] [2022-04-28 07:59:03,045 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:59:03,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:03,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:03,046 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:03,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 07:59:03,084 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:59:03,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:03,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 07:59:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:03,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:03,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {1315#true} call ULTIMATE.init(); {1315#true} is VALID [2022-04-28 07:59:03,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {1315#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); {1315#true} is VALID [2022-04-28 07:59:03,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:59:03,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1315#true} {1315#true} #63#return; {1315#true} is VALID [2022-04-28 07:59:03,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {1315#true} call #t~ret5 := main(); {1315#true} is VALID [2022-04-28 07:59:03,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {1315#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; {1315#true} is VALID [2022-04-28 07:59:03,533 INFO L272 TraceCheckUtils]: 6: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:59:03,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:59:03,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:59:03,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:59:03,534 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1315#true} {1315#true} #53#return; {1315#true} is VALID [2022-04-28 07:59:03,534 INFO L272 TraceCheckUtils]: 11: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:59:03,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:59:03,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:59:03,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:59:03,535 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1315#true} {1315#true} #55#return; {1315#true} is VALID [2022-04-28 07:59:03,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {1315#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:03,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:03,536 INFO L272 TraceCheckUtils]: 18: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:59:03,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:59:03,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:59:03,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:59:03,538 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1315#true} {1368#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:03,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1390#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:59:03,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {1390#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {1390#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:59:03,539 INFO L272 TraceCheckUtils]: 25: Hoare triple {1390#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:59:03,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:59:03,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:59:03,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:59:03,542 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1315#true} {1390#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {1390#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:59:03,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {1390#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-28 07:59:03,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !false; {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-28 07:59:03,543 INFO L272 TraceCheckUtils]: 32: Hoare triple {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:59:03,544 INFO L290 TraceCheckUtils]: 33: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:59:03,544 INFO L290 TraceCheckUtils]: 34: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:59:03,544 INFO L290 TraceCheckUtils]: 35: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:59:03,548 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1315#true} {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} #57#return; {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-28 07:59:03,549 INFO L290 TraceCheckUtils]: 37: Hoare triple {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-28 07:59:03,549 INFO L272 TraceCheckUtils]: 38: Hoare triple {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:59:03,549 INFO L290 TraceCheckUtils]: 39: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:59:03,549 INFO L290 TraceCheckUtils]: 40: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:59:03,549 INFO L290 TraceCheckUtils]: 41: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:59:03,550 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1315#true} {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} #59#return; {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-28 07:59:03,551 INFO L272 TraceCheckUtils]: 43: Hoare triple {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:03,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:03,556 INFO L290 TraceCheckUtils]: 45: Hoare triple {1457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1316#false} is VALID [2022-04-28 07:59:03,556 INFO L290 TraceCheckUtils]: 46: Hoare triple {1316#false} assume !false; {1316#false} is VALID [2022-04-28 07:59:03,556 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 07:59:03,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:03,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:03,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464500403] [2022-04-28 07:59:03,903 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:03,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318387410] [2022-04-28 07:59:03,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318387410] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:59:03,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:59:03,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 07:59:03,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:03,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [365160309] [2022-04-28 07:59:03,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [365160309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:03,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:03,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:59:03,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917182675] [2022-04-28 07:59:03,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:03,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-28 07:59:03,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:03,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 07:59:03,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:03,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:59:03,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:03,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:59:03,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 07:59:03,980 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 07:59:04,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:04,329 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-28 07:59:04,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:59:04,330 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-28 07:59:04,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 07:59:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-28 07:59:04,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 07:59:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-28 07:59:04,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-28 07:59:04,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:04,383 INFO L225 Difference]: With dead ends: 45 [2022-04-28 07:59:04,383 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 07:59:04,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 07:59:04,384 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:04,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:59:04,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 07:59:04,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 07:59:04,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:04,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:59:04,408 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:59:04,408 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:59:04,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:04,410 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-28 07:59:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 07:59:04,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:04,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:04,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-28 07:59:04,411 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-28 07:59:04,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:04,413 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-28 07:59:04,413 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 07:59:04,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:04,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:04,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:04,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:04,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:59:04,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-28 07:59:04,416 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-28 07:59:04,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:04,416 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-28 07:59:04,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 07:59:04,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2022-04-28 07:59:04,577 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-28 07:59:04,577 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 07:59:04,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 07:59:04,578 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:04,578 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:04,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 07:59:04,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:04,787 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:04,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:04,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 5 times [2022-04-28 07:59:04,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:04,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1527396711] [2022-04-28 07:59:04,789 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:59:04,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 6 times [2022-04-28 07:59:04,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:04,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535739562] [2022-04-28 07:59:04,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:04,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:04,809 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:04,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1612419762] [2022-04-28 07:59:04,810 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:59:04,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:04,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:04,819 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:04,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 07:59:05,018 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 07:59:05,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:05,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 07:59:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:05,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:05,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {1770#true} call ULTIMATE.init(); {1770#true} is VALID [2022-04-28 07:59:05,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {1770#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); {1770#true} is VALID [2022-04-28 07:59:05,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:59:05,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1770#true} {1770#true} #63#return; {1770#true} is VALID [2022-04-28 07:59:05,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {1770#true} call #t~ret5 := main(); {1770#true} is VALID [2022-04-28 07:59:05,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {1770#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; {1770#true} is VALID [2022-04-28 07:59:05,479 INFO L272 TraceCheckUtils]: 6: Hoare triple {1770#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:59:05,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:59:05,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:59:05,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:59:05,479 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1770#true} {1770#true} #53#return; {1770#true} is VALID [2022-04-28 07:59:05,479 INFO L272 TraceCheckUtils]: 11: Hoare triple {1770#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:59:05,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:59:05,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:59:05,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:59:05,480 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1770#true} {1770#true} #55#return; {1770#true} is VALID [2022-04-28 07:59:05,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {1770#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:05,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {1823#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:05,481 INFO L272 TraceCheckUtils]: 18: Hoare triple {1823#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:59:05,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:59:05,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:59:05,482 INFO L290 TraceCheckUtils]: 21: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:59:05,482 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1770#true} {1823#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:05,483 INFO L290 TraceCheckUtils]: 23: Hoare triple {1823#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:59:05,483 INFO L290 TraceCheckUtils]: 24: Hoare triple {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:59:05,484 INFO L272 TraceCheckUtils]: 25: Hoare triple {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:59:05,484 INFO L290 TraceCheckUtils]: 26: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:59:05,484 INFO L290 TraceCheckUtils]: 27: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:59:05,484 INFO L290 TraceCheckUtils]: 28: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:59:05,485 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1770#true} {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:59:05,485 INFO L290 TraceCheckUtils]: 30: Hoare triple {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:05,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:05,486 INFO L272 TraceCheckUtils]: 32: Hoare triple {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:59:05,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:59:05,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:59:05,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:59:05,487 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1770#true} {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #57#return; {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:05,488 INFO L290 TraceCheckUtils]: 37: Hoare triple {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:59:05,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !false; {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:59:05,489 INFO L272 TraceCheckUtils]: 39: Hoare triple {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:59:05,489 INFO L290 TraceCheckUtils]: 40: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:59:05,489 INFO L290 TraceCheckUtils]: 41: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:59:05,490 INFO L290 TraceCheckUtils]: 42: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:59:05,490 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1770#true} {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #57#return; {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:59:05,491 INFO L290 TraceCheckUtils]: 44: Hoare triple {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:59:05,492 INFO L272 TraceCheckUtils]: 45: Hoare triple {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:59:05,495 INFO L290 TraceCheckUtils]: 46: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:59:05,497 INFO L290 TraceCheckUtils]: 47: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:59:05,503 INFO L290 TraceCheckUtils]: 48: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:59:05,504 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1770#true} {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #59#return; {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:59:05,506 INFO L272 TraceCheckUtils]: 50: Hoare triple {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:05,507 INFO L290 TraceCheckUtils]: 51: Hoare triple {1930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:05,507 INFO L290 TraceCheckUtils]: 52: Hoare triple {1934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1771#false} is VALID [2022-04-28 07:59:05,507 INFO L290 TraceCheckUtils]: 53: Hoare triple {1771#false} assume !false; {1771#false} is VALID [2022-04-28 07:59:05,508 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 07:59:05,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:05,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:05,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535739562] [2022-04-28 07:59:05,838 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:05,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612419762] [2022-04-28 07:59:05,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612419762] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:59:05,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:59:05,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 07:59:05,839 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:05,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1527396711] [2022-04-28 07:59:05,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1527396711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:05,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:05,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 07:59:05,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134602746] [2022-04-28 07:59:05,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:05,840 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-28 07:59:05,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:05,840 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-28 07:59:05,875 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-28 07:59:05,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 07:59:05,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:05,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 07:59:05,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:59:05,876 INFO L87 Difference]: Start difference. First operand 39 states and 43 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-28 07:59:06,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:06,366 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-28 07:59:06,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 07:59:06,367 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-28 07:59:06,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:06,367 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-28 07:59:06,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-28 07:59:06,369 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-28 07:59:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-28 07:59:06,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-28 07:59:06,411 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-28 07:59:06,412 INFO L225 Difference]: With dead ends: 48 [2022-04-28 07:59:06,412 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 07:59:06,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:59:06,413 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:06,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:59:06,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 07:59:06,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-28 07:59:06,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:06,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:59:06,439 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:59:06,440 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:59:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:06,442 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-28 07:59:06,443 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-28 07:59:06,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:06,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:06,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-28 07:59:06,444 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-28 07:59:06,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:06,449 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-28 07:59:06,449 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-28 07:59:06,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:06,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:06,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:06,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:59:06,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-28 07:59:06,454 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-28 07:59:06,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:06,454 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-28 07:59:06,454 INFO L496 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-28 07:59:06,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 47 transitions. [2022-04-28 07:59:06,636 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-28 07:59:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-28 07:59:06,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 07:59:06,637 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:06,637 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:06,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 07:59:06,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:06,838 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:06,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:06,839 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 7 times [2022-04-28 07:59:06,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:06,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [840993295] [2022-04-28 07:59:06,839 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:59:06,840 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 8 times [2022-04-28 07:59:06,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:06,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9675450] [2022-04-28 07:59:06,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:06,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:06,853 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:06,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [265298331] [2022-04-28 07:59:06,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:59:06,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:06,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:06,855 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:06,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 07:59:07,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:59:07,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:07,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 07:59:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:07,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:07,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {2265#true} call ULTIMATE.init(); {2265#true} is VALID [2022-04-28 07:59:07,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {2265#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); {2265#true} is VALID [2022-04-28 07:59:07,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-28 07:59:07,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2265#true} {2265#true} #63#return; {2265#true} is VALID [2022-04-28 07:59:07,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {2265#true} call #t~ret5 := main(); {2265#true} is VALID [2022-04-28 07:59:07,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {2265#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; {2265#true} is VALID [2022-04-28 07:59:07,538 INFO L272 TraceCheckUtils]: 6: Hoare triple {2265#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {2265#true} is VALID [2022-04-28 07:59:07,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-28 07:59:07,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-28 07:59:07,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-28 07:59:07,538 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2265#true} {2265#true} #53#return; {2265#true} is VALID [2022-04-28 07:59:07,538 INFO L272 TraceCheckUtils]: 11: Hoare triple {2265#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2265#true} is VALID [2022-04-28 07:59:07,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-28 07:59:07,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-28 07:59:07,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-28 07:59:07,539 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2265#true} {2265#true} #55#return; {2265#true} is VALID [2022-04-28 07:59:07,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {2265#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2318#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:07,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {2318#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2318#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:07,540 INFO L272 TraceCheckUtils]: 18: Hoare triple {2318#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2265#true} is VALID [2022-04-28 07:59:07,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-28 07:59:07,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-28 07:59:07,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-28 07:59:07,541 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2265#true} {2318#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2318#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:07,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {2318#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:59:07,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:59:07,542 INFO L272 TraceCheckUtils]: 25: Hoare triple {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2265#true} is VALID [2022-04-28 07:59:07,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-28 07:59:07,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-28 07:59:07,544 INFO L290 TraceCheckUtils]: 28: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-28 07:59:07,544 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2265#true} {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:59:07,545 INFO L290 TraceCheckUtils]: 30: Hoare triple {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:07,546 INFO L290 TraceCheckUtils]: 31: Hoare triple {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:07,546 INFO L272 TraceCheckUtils]: 32: Hoare triple {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2265#true} is VALID [2022-04-28 07:59:07,546 INFO L290 TraceCheckUtils]: 33: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-28 07:59:07,546 INFO L290 TraceCheckUtils]: 34: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-28 07:59:07,546 INFO L290 TraceCheckUtils]: 35: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-28 07:59:07,547 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2265#true} {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #57#return; {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:07,547 INFO L290 TraceCheckUtils]: 37: Hoare triple {2362#(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 * ~y~0 * ~y~0 + ~x~0; {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:59:07,548 INFO L290 TraceCheckUtils]: 38: Hoare triple {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:59:07,548 INFO L272 TraceCheckUtils]: 39: Hoare triple {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2265#true} is VALID [2022-04-28 07:59:07,548 INFO L290 TraceCheckUtils]: 40: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-28 07:59:07,548 INFO L290 TraceCheckUtils]: 41: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-28 07:59:07,548 INFO L290 TraceCheckUtils]: 42: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-28 07:59:07,549 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2265#true} {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #57#return; {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:59:07,549 INFO L290 TraceCheckUtils]: 44: Hoare triple {2384#(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 * ~y~0 * ~y~0 + ~x~0; {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:59:07,550 INFO L290 TraceCheckUtils]: 45: Hoare triple {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:59:07,550 INFO L272 TraceCheckUtils]: 46: Hoare triple {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2265#true} is VALID [2022-04-28 07:59:07,550 INFO L290 TraceCheckUtils]: 47: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-28 07:59:07,550 INFO L290 TraceCheckUtils]: 48: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-28 07:59:07,552 INFO L290 TraceCheckUtils]: 49: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-28 07:59:07,553 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2265#true} {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #57#return; {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:59:07,553 INFO L290 TraceCheckUtils]: 51: Hoare triple {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 07:59:07,553 INFO L272 TraceCheckUtils]: 52: Hoare triple {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2265#true} is VALID [2022-04-28 07:59:07,554 INFO L290 TraceCheckUtils]: 53: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-28 07:59:07,554 INFO L290 TraceCheckUtils]: 54: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-28 07:59:07,554 INFO L290 TraceCheckUtils]: 55: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-28 07:59:07,554 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2265#true} {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #59#return; {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 07:59:07,555 INFO L272 TraceCheckUtils]: 57: Hoare triple {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:07,556 INFO L290 TraceCheckUtils]: 58: Hoare triple {2447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:07,556 INFO L290 TraceCheckUtils]: 59: Hoare triple {2451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2266#false} is VALID [2022-04-28 07:59:07,556 INFO L290 TraceCheckUtils]: 60: Hoare triple {2266#false} assume !false; {2266#false} is VALID [2022-04-28 07:59:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 07:59:07,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:07,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:07,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9675450] [2022-04-28 07:59:07,872 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:07,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265298331] [2022-04-28 07:59:07,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265298331] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:59:07,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:59:07,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 07:59:07,873 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:07,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [840993295] [2022-04-28 07:59:07,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [840993295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:07,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:07,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 07:59:07,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516190269] [2022-04-28 07:59:07,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:07,874 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-28 07:59:07,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:07,875 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-28 07:59:07,908 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-28 07:59:07,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 07:59:07,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:07,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 07:59:07,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 07:59:07,909 INFO L87 Difference]: Start difference. First operand 42 states and 47 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-28 07:59:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:08,452 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-28 07:59:08,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 07:59:08,453 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-28 07:59:08,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:08,453 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-28 07:59:08,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-28 07:59:08,455 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-28 07:59:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-28 07:59:08,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-28 07:59:08,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:08,505 INFO L225 Difference]: With dead ends: 51 [2022-04-28 07:59:08,505 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 07:59:08,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-28 07:59:08,506 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:08,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:59:08,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 07:59:08,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 07:59:08,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:08,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:59:08,536 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:59:08,536 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:59:08,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:08,538 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-28 07:59:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-28 07:59:08,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:08,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:08,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-28 07:59:08,540 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-28 07:59:08,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:08,542 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-28 07:59:08,542 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-28 07:59:08,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:08,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:08,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:08,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:08,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:59:08,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-28 07:59:08,544 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-28 07:59:08,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:08,545 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-28 07:59:08,545 INFO L496 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-28 07:59:08,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 51 transitions. [2022-04-28 07:59:08,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-28 07:59:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 07:59:08,704 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:08,704 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:08,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 07:59:08,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:08,908 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:08,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:08,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 9 times [2022-04-28 07:59:08,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:08,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1465190591] [2022-04-28 07:59:08,909 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:59:08,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 10 times [2022-04-28 07:59:08,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:08,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384572473] [2022-04-28 07:59:08,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:08,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:08,922 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:08,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [725217886] [2022-04-28 07:59:08,923 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:59:08,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:08,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:08,924 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:08,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 07:59:08,979 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:59:08,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:08,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 07:59:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:08,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:09,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {2800#true} call ULTIMATE.init(); {2800#true} is VALID [2022-04-28 07:59:09,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {2800#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); {2800#true} is VALID [2022-04-28 07:59:09,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-28 07:59:09,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2800#true} {2800#true} #63#return; {2800#true} is VALID [2022-04-28 07:59:09,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {2800#true} call #t~ret5 := main(); {2800#true} is VALID [2022-04-28 07:59:09,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {2800#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; {2800#true} is VALID [2022-04-28 07:59:09,428 INFO L272 TraceCheckUtils]: 6: Hoare triple {2800#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {2800#true} is VALID [2022-04-28 07:59:09,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-28 07:59:09,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-28 07:59:09,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-28 07:59:09,428 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2800#true} {2800#true} #53#return; {2800#true} is VALID [2022-04-28 07:59:09,429 INFO L272 TraceCheckUtils]: 11: Hoare triple {2800#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2800#true} is VALID [2022-04-28 07:59:09,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-28 07:59:09,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-28 07:59:09,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-28 07:59:09,429 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2800#true} {2800#true} #55#return; {2800#true} is VALID [2022-04-28 07:59:09,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {2800#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:09,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {2853#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:09,430 INFO L272 TraceCheckUtils]: 18: Hoare triple {2853#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2800#true} is VALID [2022-04-28 07:59:09,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-28 07:59:09,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-28 07:59:09,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-28 07:59:09,436 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2800#true} {2853#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:09,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {2853#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:59:09,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:59:09,437 INFO L272 TraceCheckUtils]: 25: Hoare triple {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2800#true} is VALID [2022-04-28 07:59:09,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-28 07:59:09,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-28 07:59:09,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-28 07:59:09,438 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2800#true} {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:59:09,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:59:09,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:59:09,439 INFO L272 TraceCheckUtils]: 32: Hoare triple {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2800#true} is VALID [2022-04-28 07:59:09,439 INFO L290 TraceCheckUtils]: 33: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-28 07:59:09,440 INFO L290 TraceCheckUtils]: 34: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-28 07:59:09,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-28 07:59:09,441 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2800#true} {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:59:09,441 INFO L290 TraceCheckUtils]: 37: Hoare triple {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:59:09,442 INFO L290 TraceCheckUtils]: 38: Hoare triple {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:59:09,442 INFO L272 TraceCheckUtils]: 39: Hoare triple {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2800#true} is VALID [2022-04-28 07:59:09,442 INFO L290 TraceCheckUtils]: 40: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-28 07:59:09,442 INFO L290 TraceCheckUtils]: 41: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-28 07:59:09,442 INFO L290 TraceCheckUtils]: 42: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-28 07:59:09,443 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2800#true} {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #57#return; {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:59:09,444 INFO L290 TraceCheckUtils]: 44: Hoare triple {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:09,444 INFO L290 TraceCheckUtils]: 45: Hoare triple {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:09,444 INFO L272 TraceCheckUtils]: 46: Hoare triple {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2800#true} is VALID [2022-04-28 07:59:09,444 INFO L290 TraceCheckUtils]: 47: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-28 07:59:09,444 INFO L290 TraceCheckUtils]: 48: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-28 07:59:09,445 INFO L290 TraceCheckUtils]: 49: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-28 07:59:09,445 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2800#true} {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #57#return; {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:09,446 INFO L290 TraceCheckUtils]: 51: Hoare triple {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:59:09,446 INFO L290 TraceCheckUtils]: 52: Hoare triple {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !false; {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:59:09,446 INFO L272 TraceCheckUtils]: 53: Hoare triple {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2800#true} is VALID [2022-04-28 07:59:09,446 INFO L290 TraceCheckUtils]: 54: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-28 07:59:09,447 INFO L290 TraceCheckUtils]: 55: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-28 07:59:09,447 INFO L290 TraceCheckUtils]: 56: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-28 07:59:09,448 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2800#true} {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #57#return; {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:59:09,448 INFO L290 TraceCheckUtils]: 58: Hoare triple {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:59:09,448 INFO L272 TraceCheckUtils]: 59: Hoare triple {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2800#true} is VALID [2022-04-28 07:59:09,449 INFO L290 TraceCheckUtils]: 60: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-28 07:59:09,449 INFO L290 TraceCheckUtils]: 61: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-28 07:59:09,449 INFO L290 TraceCheckUtils]: 62: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-28 07:59:09,456 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2800#true} {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #59#return; {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:59:09,457 INFO L272 TraceCheckUtils]: 64: Hoare triple {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3004#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:09,458 INFO L290 TraceCheckUtils]: 65: Hoare triple {3004#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3008#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:09,458 INFO L290 TraceCheckUtils]: 66: Hoare triple {3008#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2801#false} is VALID [2022-04-28 07:59:09,458 INFO L290 TraceCheckUtils]: 67: Hoare triple {2801#false} assume !false; {2801#false} is VALID [2022-04-28 07:59:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-28 07:59:09,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:09,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:09,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384572473] [2022-04-28 07:59:09,767 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:09,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725217886] [2022-04-28 07:59:09,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725217886] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:59:09,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:59:09,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 07:59:09,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:09,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1465190591] [2022-04-28 07:59:09,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1465190591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:09,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:09,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 07:59:09,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150859638] [2022-04-28 07:59:09,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:09,769 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-28 07:59:09,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:09,769 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-28 07:59:09,831 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-28 07:59:09,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 07:59:09,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:09,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 07:59:09,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:59:09,832 INFO L87 Difference]: Start difference. First operand 45 states and 51 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-28 07:59:10,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:10,438 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-28 07:59:10,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 07:59:10,439 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-28 07:59:10,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:10,439 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-28 07:59:10,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-28 07:59:10,441 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-28 07:59:10,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-28 07:59:10,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-28 07:59:10,488 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-28 07:59:10,489 INFO L225 Difference]: With dead ends: 54 [2022-04-28 07:59:10,489 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 07:59:10,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 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-28 07:59:10,490 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:10,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:59:10,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 07:59:10,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-28 07:59:10,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:10,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:59:10,524 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:59:10,524 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:59:10,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:10,526 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-28 07:59:10,526 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-28 07:59:10,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:10,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:10,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-28 07:59:10,527 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-28 07:59:10,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:10,529 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-28 07:59:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-28 07:59:10,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:10,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:10,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:10,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:10,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:59:10,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-28 07:59:10,532 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-28 07:59:10,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:10,532 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-28 07:59:10,533 INFO L496 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-28 07:59:10,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 55 transitions. [2022-04-28 07:59:10,655 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-28 07:59:10,656 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-28 07:59:10,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 07:59:10,656 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:10,656 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:10,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 07:59:10,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:10,872 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:10,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:10,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 11 times [2022-04-28 07:59:10,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:10,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [729802037] [2022-04-28 07:59:10,873 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:59:10,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 12 times [2022-04-28 07:59:10,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:10,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006510041] [2022-04-28 07:59:10,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:10,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:10,893 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:10,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [317580101] [2022-04-28 07:59:10,894 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:59:10,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:10,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:10,895 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:10,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 07:59:11,231 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 07:59:11,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:11,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 07:59:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:11,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:11,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {3375#true} call ULTIMATE.init(); {3375#true} is VALID [2022-04-28 07:59:11,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {3375#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); {3375#true} is VALID [2022-04-28 07:59:11,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-28 07:59:11,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3375#true} {3375#true} #63#return; {3375#true} is VALID [2022-04-28 07:59:11,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {3375#true} call #t~ret5 := main(); {3375#true} is VALID [2022-04-28 07:59:11,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {3375#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; {3375#true} is VALID [2022-04-28 07:59:11,960 INFO L272 TraceCheckUtils]: 6: Hoare triple {3375#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {3375#true} is VALID [2022-04-28 07:59:11,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-28 07:59:11,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-28 07:59:11,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-28 07:59:11,961 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3375#true} {3375#true} #53#return; {3375#true} is VALID [2022-04-28 07:59:11,961 INFO L272 TraceCheckUtils]: 11: Hoare triple {3375#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3375#true} is VALID [2022-04-28 07:59:11,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-28 07:59:11,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-28 07:59:11,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-28 07:59:11,962 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3375#true} {3375#true} #55#return; {3375#true} is VALID [2022-04-28 07:59:11,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {3375#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3428#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:11,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {3428#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3428#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:11,963 INFO L272 TraceCheckUtils]: 18: Hoare triple {3428#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3375#true} is VALID [2022-04-28 07:59:11,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-28 07:59:11,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-28 07:59:11,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-28 07:59:11,964 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3375#true} {3428#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3428#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:11,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {3428#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:59:11,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:59:11,968 INFO L272 TraceCheckUtils]: 25: Hoare triple {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3375#true} is VALID [2022-04-28 07:59:11,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-28 07:59:11,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-28 07:59:11,968 INFO L290 TraceCheckUtils]: 28: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-28 07:59:11,969 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3375#true} {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:59:11,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:59:11,970 INFO L290 TraceCheckUtils]: 31: Hoare triple {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:59:11,970 INFO L272 TraceCheckUtils]: 32: Hoare triple {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3375#true} is VALID [2022-04-28 07:59:11,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-28 07:59:11,970 INFO L290 TraceCheckUtils]: 34: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-28 07:59:11,970 INFO L290 TraceCheckUtils]: 35: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-28 07:59:11,971 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3375#true} {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #57#return; {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:59:11,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:59:11,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:59:11,972 INFO L272 TraceCheckUtils]: 39: Hoare triple {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3375#true} is VALID [2022-04-28 07:59:11,972 INFO L290 TraceCheckUtils]: 40: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-28 07:59:11,973 INFO L290 TraceCheckUtils]: 41: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-28 07:59:11,973 INFO L290 TraceCheckUtils]: 42: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-28 07:59:11,973 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3375#true} {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #57#return; {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:59:11,974 INFO L290 TraceCheckUtils]: 44: Hoare triple {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3516#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:11,974 INFO L290 TraceCheckUtils]: 45: Hoare triple {3516#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {3516#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:11,974 INFO L272 TraceCheckUtils]: 46: Hoare triple {3516#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3375#true} is VALID [2022-04-28 07:59:11,975 INFO L290 TraceCheckUtils]: 47: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-28 07:59:11,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-28 07:59:11,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-28 07:59:11,975 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3375#true} {3516#(and (= main_~y~0 4) (= main_~c~0 4))} #57#return; {3516#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:11,976 INFO L290 TraceCheckUtils]: 51: Hoare triple {3516#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3538#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:11,976 INFO L290 TraceCheckUtils]: 52: Hoare triple {3538#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3538#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:11,977 INFO L272 TraceCheckUtils]: 53: Hoare triple {3538#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3375#true} is VALID [2022-04-28 07:59:11,977 INFO L290 TraceCheckUtils]: 54: Hoare triple {3375#true} ~cond := #in~cond; {3548#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:11,977 INFO L290 TraceCheckUtils]: 55: Hoare triple {3548#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3552#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:59:11,978 INFO L290 TraceCheckUtils]: 56: Hoare triple {3552#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3552#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:59:11,979 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3552#(not (= |__VERIFIER_assert_#in~cond| 0))} {3538#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {3559#(and (= 5 main_~c~0) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:11,979 INFO L290 TraceCheckUtils]: 58: Hoare triple {3559#(and (= 5 main_~c~0) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3563#(and (= main_~y~0 6) (<= (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:59:11,980 INFO L290 TraceCheckUtils]: 59: Hoare triple {3563#(and (= main_~y~0 6) (<= (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {3563#(and (= main_~y~0 6) (<= (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:59:11,980 INFO L272 TraceCheckUtils]: 60: Hoare triple {3563#(and (= main_~y~0 6) (<= (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3375#true} is VALID [2022-04-28 07:59:11,980 INFO L290 TraceCheckUtils]: 61: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-28 07:59:11,980 INFO L290 TraceCheckUtils]: 62: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-28 07:59:11,981 INFO L290 TraceCheckUtils]: 63: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-28 07:59:11,981 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3375#true} {3563#(and (= main_~y~0 6) (<= (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (< 5 main_~k~0) (<= main_~c~0 6))} #57#return; {3563#(and (= main_~y~0 6) (<= (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:59:11,982 INFO L290 TraceCheckUtils]: 65: Hoare triple {3563#(and (= main_~y~0 6) (<= (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {3585#(and (= main_~y~0 6) (<= main_~k~0 6) (<= (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (< 5 main_~k~0))} is VALID [2022-04-28 07:59:11,982 INFO L272 TraceCheckUtils]: 66: Hoare triple {3585#(and (= main_~y~0 6) (<= main_~k~0 6) (<= (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3375#true} is VALID [2022-04-28 07:59:11,983 INFO L290 TraceCheckUtils]: 67: Hoare triple {3375#true} ~cond := #in~cond; {3548#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:11,983 INFO L290 TraceCheckUtils]: 68: Hoare triple {3548#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3552#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:59:11,983 INFO L290 TraceCheckUtils]: 69: Hoare triple {3552#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3552#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:59:11,984 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3552#(not (= |__VERIFIER_assert_#in~cond| 0))} {3585#(and (= main_~y~0 6) (<= main_~k~0 6) (<= (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (< 5 main_~k~0))} #59#return; {3601#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-28 07:59:11,985 INFO L272 TraceCheckUtils]: 71: Hoare triple {3601#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3605#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:11,985 INFO L290 TraceCheckUtils]: 72: Hoare triple {3605#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3609#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:11,986 INFO L290 TraceCheckUtils]: 73: Hoare triple {3609#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3376#false} is VALID [2022-04-28 07:59:11,986 INFO L290 TraceCheckUtils]: 74: Hoare triple {3376#false} assume !false; {3376#false} is VALID [2022-04-28 07:59:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 47 proven. 68 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-04-28 07:59:11,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:26,692 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 18) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (.cse1 (* (- 2) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (.cse2 (* (- 119) c_main_~y~0 c_main_~y~0)) (.cse3 (* (- 65) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (or (not (= (mod (+ .cse0 .cse1 .cse2 (* (- 120) c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse3) 12) 0)) (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse4 (+ c_main_~y~0 1))) (= (* .cse4 .cse4) (* main_~k~0 .cse4))))) (not (<= (+ (* 10 (* c_main_~y~0 c_main_~y~0)) (* 5 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) c_main_~x~0 1) (div (+ .cse0 .cse1 .cse2 (- 12) .cse3) (- 12)))))) is different from false [2022-04-28 07:59:30,960 WARN L833 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* (- 2) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* (- 5) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* (- 6) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* c_main_~y~0 c_main_~y~0)) 12) 0)) (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0)))))) is different from false [2022-04-28 07:59:30,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:30,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006510041] [2022-04-28 07:59:30,963 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:30,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317580101] [2022-04-28 07:59:30,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317580101] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:59:30,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:59:30,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-28 07:59:30,964 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:30,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [729802037] [2022-04-28 07:59:30,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [729802037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:30,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:30,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 07:59:30,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328949767] [2022-04-28 07:59:30,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:30,965 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-28 07:59:30,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:30,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-28 07:59:31,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:31,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 07:59:31,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:31,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 07:59:31,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=326, Unknown=2, NotChecked=74, Total=462 [2022-04-28 07:59:31,019 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-28 07:59:32,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:32,115 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-28 07:59:32,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 07:59:32,115 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-28 07:59:32,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-28 07:59:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-28 07:59:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-28 07:59:32,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-28 07:59:32,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 62 transitions. [2022-04-28 07:59:32,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:32,173 INFO L225 Difference]: With dead ends: 57 [2022-04-28 07:59:32,173 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 07:59:32,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=81, Invalid=431, Unknown=2, NotChecked=86, Total=600 [2022-04-28 07:59:32,175 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:32,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 286 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 07:59:32,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 07:59:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-28 07:59:32,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:32,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:59:32,218 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:59:32,218 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:59:32,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:32,228 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-28 07:59:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-28 07:59:32,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:32,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:32,228 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-28 07:59:32,229 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-28 07:59:32,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:32,231 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-28 07:59:32,231 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-28 07:59:32,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:32,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:32,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:32,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:32,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:59:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-04-28 07:59:32,234 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 75 [2022-04-28 07:59:32,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:32,234 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-04-28 07:59:32,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-28 07:59:32,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 59 transitions. [2022-04-28 07:59:32,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:32,429 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-28 07:59:32,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 07:59:32,430 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:32,430 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:32,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 07:59:32,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 07:59:32,632 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:32,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:32,632 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 13 times [2022-04-28 07:59:32,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:32,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [77872518] [2022-04-28 07:59:32,633 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:59:32,633 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 14 times [2022-04-28 07:59:32,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:32,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420994745] [2022-04-28 07:59:32,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:32,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:32,652 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:32,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1509664658] [2022-04-28 07:59:32,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:59:32,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:32,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:32,654 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:32,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 07:59:33,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:59:33,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:33,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 07:59:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:33,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:33,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {3999#true} call ULTIMATE.init(); {3999#true} is VALID [2022-04-28 07:59:33,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {3999#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); {3999#true} is VALID [2022-04-28 07:59:33,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {3999#true} assume true; {3999#true} is VALID [2022-04-28 07:59:33,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3999#true} {3999#true} #63#return; {3999#true} is VALID [2022-04-28 07:59:33,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {3999#true} call #t~ret5 := main(); {3999#true} is VALID [2022-04-28 07:59:33,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {3999#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; {3999#true} is VALID [2022-04-28 07:59:33,970 INFO L272 TraceCheckUtils]: 6: Hoare triple {3999#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {3999#true} is VALID [2022-04-28 07:59:33,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {3999#true} ~cond := #in~cond; {3999#true} is VALID [2022-04-28 07:59:33,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {3999#true} assume !(0 == ~cond); {3999#true} is VALID [2022-04-28 07:59:33,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {3999#true} assume true; {3999#true} is VALID [2022-04-28 07:59:33,970 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3999#true} {3999#true} #53#return; {3999#true} is VALID [2022-04-28 07:59:33,970 INFO L272 TraceCheckUtils]: 11: Hoare triple {3999#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3999#true} is VALID [2022-04-28 07:59:33,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {3999#true} ~cond := #in~cond; {3999#true} is VALID [2022-04-28 07:59:33,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {3999#true} assume !(0 == ~cond); {3999#true} is VALID [2022-04-28 07:59:33,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {3999#true} assume true; {3999#true} is VALID [2022-04-28 07:59:33,971 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3999#true} {3999#true} #55#return; {3999#true} is VALID [2022-04-28 07:59:33,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {3999#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4052#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:33,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {4052#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4052#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:33,972 INFO L272 TraceCheckUtils]: 18: Hoare triple {4052#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3999#true} is VALID [2022-04-28 07:59:33,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {3999#true} ~cond := #in~cond; {3999#true} is VALID [2022-04-28 07:59:33,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {3999#true} assume !(0 == ~cond); {3999#true} is VALID [2022-04-28 07:59:33,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {3999#true} assume true; {3999#true} is VALID [2022-04-28 07:59:33,973 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3999#true} {4052#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4052#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:33,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {4052#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4074#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:59:33,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {4074#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {4074#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:59:33,974 INFO L272 TraceCheckUtils]: 25: Hoare triple {4074#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3999#true} is VALID [2022-04-28 07:59:33,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {3999#true} ~cond := #in~cond; {3999#true} is VALID [2022-04-28 07:59:33,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {3999#true} assume !(0 == ~cond); {3999#true} is VALID [2022-04-28 07:59:33,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {3999#true} assume true; {3999#true} is VALID [2022-04-28 07:59:33,975 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3999#true} {4074#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {4074#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:59:33,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {4074#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4096#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:33,976 INFO L290 TraceCheckUtils]: 31: Hoare triple {4096#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {4096#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:33,976 INFO L272 TraceCheckUtils]: 32: Hoare triple {4096#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3999#true} is VALID [2022-04-28 07:59:33,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {3999#true} ~cond := #in~cond; {3999#true} is VALID [2022-04-28 07:59:33,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {3999#true} assume !(0 == ~cond); {3999#true} is VALID [2022-04-28 07:59:33,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {3999#true} assume true; {3999#true} is VALID [2022-04-28 07:59:33,977 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3999#true} {4096#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #57#return; {4096#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:33,978 INFO L290 TraceCheckUtils]: 37: Hoare triple {4096#(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 * ~y~0 * ~y~0 + ~x~0; {4118#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:59:33,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {4118#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {4118#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:59:33,979 INFO L272 TraceCheckUtils]: 39: Hoare triple {4118#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3999#true} is VALID [2022-04-28 07:59:33,979 INFO L290 TraceCheckUtils]: 40: Hoare triple {3999#true} ~cond := #in~cond; {3999#true} is VALID [2022-04-28 07:59:33,979 INFO L290 TraceCheckUtils]: 41: Hoare triple {3999#true} assume !(0 == ~cond); {3999#true} is VALID [2022-04-28 07:59:34,000 INFO L290 TraceCheckUtils]: 42: Hoare triple {3999#true} assume true; {3999#true} is VALID [2022-04-28 07:59:34,002 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3999#true} {4118#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #57#return; {4118#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:59:34,002 INFO L290 TraceCheckUtils]: 44: Hoare triple {4118#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4140#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:34,003 INFO L290 TraceCheckUtils]: 45: Hoare triple {4140#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {4140#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:34,003 INFO L272 TraceCheckUtils]: 46: Hoare triple {4140#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3999#true} is VALID [2022-04-28 07:59:34,003 INFO L290 TraceCheckUtils]: 47: Hoare triple {3999#true} ~cond := #in~cond; {3999#true} is VALID [2022-04-28 07:59:34,003 INFO L290 TraceCheckUtils]: 48: Hoare triple {3999#true} assume !(0 == ~cond); {3999#true} is VALID [2022-04-28 07:59:34,003 INFO L290 TraceCheckUtils]: 49: Hoare triple {3999#true} assume true; {3999#true} is VALID [2022-04-28 07:59:34,004 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3999#true} {4140#(and (= main_~y~0 4) (= main_~c~0 4))} #57#return; {4140#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:34,005 INFO L290 TraceCheckUtils]: 51: Hoare triple {4140#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4162#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:59:34,005 INFO L290 TraceCheckUtils]: 52: Hoare triple {4162#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !false; {4162#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:59:34,005 INFO L272 TraceCheckUtils]: 53: Hoare triple {4162#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3999#true} is VALID [2022-04-28 07:59:34,005 INFO L290 TraceCheckUtils]: 54: Hoare triple {3999#true} ~cond := #in~cond; {3999#true} is VALID [2022-04-28 07:59:34,005 INFO L290 TraceCheckUtils]: 55: Hoare triple {3999#true} assume !(0 == ~cond); {3999#true} is VALID [2022-04-28 07:59:34,006 INFO L290 TraceCheckUtils]: 56: Hoare triple {3999#true} assume true; {3999#true} is VALID [2022-04-28 07:59:34,006 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3999#true} {4162#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #57#return; {4162#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:59:34,007 INFO L290 TraceCheckUtils]: 58: Hoare triple {4162#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4184#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:59:34,007 INFO L290 TraceCheckUtils]: 59: Hoare triple {4184#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} assume !false; {4184#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:59:34,007 INFO L272 TraceCheckUtils]: 60: Hoare triple {4184#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3999#true} is VALID [2022-04-28 07:59:34,007 INFO L290 TraceCheckUtils]: 61: Hoare triple {3999#true} ~cond := #in~cond; {3999#true} is VALID [2022-04-28 07:59:34,007 INFO L290 TraceCheckUtils]: 62: Hoare triple {3999#true} assume !(0 == ~cond); {3999#true} is VALID [2022-04-28 07:59:34,008 INFO L290 TraceCheckUtils]: 63: Hoare triple {3999#true} assume true; {3999#true} is VALID [2022-04-28 07:59:34,008 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3999#true} {4184#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} #57#return; {4184#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:59:34,009 INFO L290 TraceCheckUtils]: 65: Hoare triple {4184#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4206#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:59:34,009 INFO L290 TraceCheckUtils]: 66: Hoare triple {4206#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !false; {4206#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:59:34,009 INFO L272 TraceCheckUtils]: 67: Hoare triple {4206#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3999#true} is VALID [2022-04-28 07:59:34,009 INFO L290 TraceCheckUtils]: 68: Hoare triple {3999#true} ~cond := #in~cond; {3999#true} is VALID [2022-04-28 07:59:34,009 INFO L290 TraceCheckUtils]: 69: Hoare triple {3999#true} assume !(0 == ~cond); {3999#true} is VALID [2022-04-28 07:59:34,010 INFO L290 TraceCheckUtils]: 70: Hoare triple {3999#true} assume true; {3999#true} is VALID [2022-04-28 07:59:34,010 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3999#true} {4206#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #57#return; {4206#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:59:34,011 INFO L290 TraceCheckUtils]: 72: Hoare triple {4206#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {4228#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:59:34,011 INFO L272 TraceCheckUtils]: 73: Hoare triple {4228#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3999#true} is VALID [2022-04-28 07:59:34,011 INFO L290 TraceCheckUtils]: 74: Hoare triple {3999#true} ~cond := #in~cond; {3999#true} is VALID [2022-04-28 07:59:34,011 INFO L290 TraceCheckUtils]: 75: Hoare triple {3999#true} assume !(0 == ~cond); {3999#true} is VALID [2022-04-28 07:59:34,011 INFO L290 TraceCheckUtils]: 76: Hoare triple {3999#true} assume true; {3999#true} is VALID [2022-04-28 07:59:34,012 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {3999#true} {4228#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #59#return; {4228#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:59:34,013 INFO L272 TraceCheckUtils]: 78: Hoare triple {4228#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4247#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:34,013 INFO L290 TraceCheckUtils]: 79: Hoare triple {4247#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4251#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:34,013 INFO L290 TraceCheckUtils]: 80: Hoare triple {4251#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4000#false} is VALID [2022-04-28 07:59:34,014 INFO L290 TraceCheckUtils]: 81: Hoare triple {4000#false} assume !false; {4000#false} is VALID [2022-04-28 07:59:34,014 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 84 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-28 07:59:34,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:34,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:34,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420994745] [2022-04-28 07:59:34,325 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:34,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509664658] [2022-04-28 07:59:34,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509664658] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:59:34,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:59:34,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 07:59:34,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:34,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [77872518] [2022-04-28 07:59:34,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [77872518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:34,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:34,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 07:59:34,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301829839] [2022-04-28 07:59:34,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:34,327 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-28 07:59:34,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:34,327 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-28 07:59:34,376 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-28 07:59:34,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 07:59:34,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:34,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 07:59:34,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:59:34,378 INFO L87 Difference]: Start difference. First operand 51 states and 59 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-28 07:59:35,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:35,292 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-28 07:59:35,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 07:59:35,293 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-28 07:59:35,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:35,293 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-28 07:59:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-28 07:59:35,295 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-28 07:59:35,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-28 07:59:35,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-04-28 07:59:35,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:35,347 INFO L225 Difference]: With dead ends: 60 [2022-04-28 07:59:35,347 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 07:59:35,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 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-28 07:59:35,347 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:35,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 351 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 07:59:35,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 07:59:35,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 07:59:35,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:35,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:59:35,391 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:59:35,391 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:59:35,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:35,393 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-28 07:59:35,393 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-28 07:59:35,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:35,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:35,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-28 07:59:35,394 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-28 07:59:35,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:35,395 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-28 07:59:35,396 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-28 07:59:35,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:35,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:35,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:35,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:35,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:59:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-28 07:59:35,398 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 82 [2022-04-28 07:59:35,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:35,399 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-28 07:59:35,399 INFO L496 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-28 07:59:35,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 63 transitions. [2022-04-28 07:59:35,537 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-28 07:59:35,537 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-28 07:59:35,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 07:59:35,538 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:35,538 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:35,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 07:59:35,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 07:59:35,742 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:35,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:35,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 15 times [2022-04-28 07:59:35,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:35,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1089782093] [2022-04-28 07:59:35,743 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:59:35,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 16 times [2022-04-28 07:59:35,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:35,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207849856] [2022-04-28 07:59:35,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:35,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:35,756 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:35,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1724220837] [2022-04-28 07:59:35,757 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:59:35,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:35,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:35,758 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:35,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 07:59:35,824 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:59:35,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:35,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 07:59:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:35,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:36,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {4654#true} call ULTIMATE.init(); {4654#true} is VALID [2022-04-28 07:59:36,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {4654#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); {4654#true} is VALID [2022-04-28 07:59:36,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {4654#true} assume true; {4654#true} is VALID [2022-04-28 07:59:36,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4654#true} {4654#true} #63#return; {4654#true} is VALID [2022-04-28 07:59:36,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {4654#true} call #t~ret5 := main(); {4654#true} is VALID [2022-04-28 07:59:36,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {4654#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; {4654#true} is VALID [2022-04-28 07:59:36,444 INFO L272 TraceCheckUtils]: 6: Hoare triple {4654#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {4654#true} is VALID [2022-04-28 07:59:36,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {4654#true} ~cond := #in~cond; {4654#true} is VALID [2022-04-28 07:59:36,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {4654#true} assume !(0 == ~cond); {4654#true} is VALID [2022-04-28 07:59:36,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {4654#true} assume true; {4654#true} is VALID [2022-04-28 07:59:36,444 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4654#true} {4654#true} #53#return; {4654#true} is VALID [2022-04-28 07:59:36,444 INFO L272 TraceCheckUtils]: 11: Hoare triple {4654#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4654#true} is VALID [2022-04-28 07:59:36,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {4654#true} ~cond := #in~cond; {4654#true} is VALID [2022-04-28 07:59:36,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {4654#true} assume !(0 == ~cond); {4654#true} is VALID [2022-04-28 07:59:36,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {4654#true} assume true; {4654#true} is VALID [2022-04-28 07:59:36,445 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4654#true} {4654#true} #55#return; {4654#true} is VALID [2022-04-28 07:59:36,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {4654#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4707#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:36,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {4707#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4707#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:36,447 INFO L272 TraceCheckUtils]: 18: Hoare triple {4707#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4654#true} is VALID [2022-04-28 07:59:36,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {4654#true} ~cond := #in~cond; {4654#true} is VALID [2022-04-28 07:59:36,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {4654#true} assume !(0 == ~cond); {4654#true} is VALID [2022-04-28 07:59:36,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {4654#true} assume true; {4654#true} is VALID [2022-04-28 07:59:36,448 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4654#true} {4707#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4707#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:36,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {4707#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4729#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:59:36,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {4729#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {4729#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:59:36,449 INFO L272 TraceCheckUtils]: 25: Hoare triple {4729#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4654#true} is VALID [2022-04-28 07:59:36,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {4654#true} ~cond := #in~cond; {4654#true} is VALID [2022-04-28 07:59:36,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {4654#true} assume !(0 == ~cond); {4654#true} is VALID [2022-04-28 07:59:36,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {4654#true} assume true; {4654#true} is VALID [2022-04-28 07:59:36,450 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4654#true} {4729#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {4729#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:59:36,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {4729#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4751#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 07:59:36,450 INFO L290 TraceCheckUtils]: 31: Hoare triple {4751#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {4751#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 07:59:36,451 INFO L272 TraceCheckUtils]: 32: Hoare triple {4751#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4654#true} is VALID [2022-04-28 07:59:36,451 INFO L290 TraceCheckUtils]: 33: Hoare triple {4654#true} ~cond := #in~cond; {4654#true} is VALID [2022-04-28 07:59:36,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {4654#true} assume !(0 == ~cond); {4654#true} is VALID [2022-04-28 07:59:36,451 INFO L290 TraceCheckUtils]: 35: Hoare triple {4654#true} assume true; {4654#true} is VALID [2022-04-28 07:59:36,451 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4654#true} {4751#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #57#return; {4751#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 07:59:36,452 INFO L290 TraceCheckUtils]: 37: Hoare triple {4751#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4773#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:59:36,452 INFO L290 TraceCheckUtils]: 38: Hoare triple {4773#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {4773#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:59:36,452 INFO L272 TraceCheckUtils]: 39: Hoare triple {4773#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4654#true} is VALID [2022-04-28 07:59:36,452 INFO L290 TraceCheckUtils]: 40: Hoare triple {4654#true} ~cond := #in~cond; {4654#true} is VALID [2022-04-28 07:59:36,452 INFO L290 TraceCheckUtils]: 41: Hoare triple {4654#true} assume !(0 == ~cond); {4654#true} is VALID [2022-04-28 07:59:36,453 INFO L290 TraceCheckUtils]: 42: Hoare triple {4654#true} assume true; {4654#true} is VALID [2022-04-28 07:59:36,453 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4654#true} {4773#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #57#return; {4773#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:59:36,453 INFO L290 TraceCheckUtils]: 44: Hoare triple {4773#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4795#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:59:36,454 INFO L290 TraceCheckUtils]: 45: Hoare triple {4795#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {4795#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:59:36,454 INFO L272 TraceCheckUtils]: 46: Hoare triple {4795#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4654#true} is VALID [2022-04-28 07:59:36,454 INFO L290 TraceCheckUtils]: 47: Hoare triple {4654#true} ~cond := #in~cond; {4654#true} is VALID [2022-04-28 07:59:36,454 INFO L290 TraceCheckUtils]: 48: Hoare triple {4654#true} assume !(0 == ~cond); {4654#true} is VALID [2022-04-28 07:59:36,454 INFO L290 TraceCheckUtils]: 49: Hoare triple {4654#true} assume true; {4654#true} is VALID [2022-04-28 07:59:36,455 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4654#true} {4795#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #57#return; {4795#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:59:36,455 INFO L290 TraceCheckUtils]: 51: Hoare triple {4795#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4817#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:36,456 INFO L290 TraceCheckUtils]: 52: Hoare triple {4817#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {4817#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:36,456 INFO L272 TraceCheckUtils]: 53: Hoare triple {4817#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4654#true} is VALID [2022-04-28 07:59:36,456 INFO L290 TraceCheckUtils]: 54: Hoare triple {4654#true} ~cond := #in~cond; {4654#true} is VALID [2022-04-28 07:59:36,456 INFO L290 TraceCheckUtils]: 55: Hoare triple {4654#true} assume !(0 == ~cond); {4654#true} is VALID [2022-04-28 07:59:36,456 INFO L290 TraceCheckUtils]: 56: Hoare triple {4654#true} assume true; {4654#true} is VALID [2022-04-28 07:59:36,456 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4654#true} {4817#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {4817#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:36,457 INFO L290 TraceCheckUtils]: 58: Hoare triple {4817#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4839#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:36,457 INFO L290 TraceCheckUtils]: 59: Hoare triple {4839#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {4839#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:36,457 INFO L272 TraceCheckUtils]: 60: Hoare triple {4839#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4654#true} is VALID [2022-04-28 07:59:36,457 INFO L290 TraceCheckUtils]: 61: Hoare triple {4654#true} ~cond := #in~cond; {4654#true} is VALID [2022-04-28 07:59:36,458 INFO L290 TraceCheckUtils]: 62: Hoare triple {4654#true} assume !(0 == ~cond); {4654#true} is VALID [2022-04-28 07:59:36,458 INFO L290 TraceCheckUtils]: 63: Hoare triple {4654#true} assume true; {4654#true} is VALID [2022-04-28 07:59:36,458 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4654#true} {4839#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #57#return; {4839#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:36,459 INFO L290 TraceCheckUtils]: 65: Hoare triple {4839#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4861#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:36,459 INFO L290 TraceCheckUtils]: 66: Hoare triple {4861#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {4861#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:36,459 INFO L272 TraceCheckUtils]: 67: Hoare triple {4861#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4654#true} is VALID [2022-04-28 07:59:36,459 INFO L290 TraceCheckUtils]: 68: Hoare triple {4654#true} ~cond := #in~cond; {4654#true} is VALID [2022-04-28 07:59:36,459 INFO L290 TraceCheckUtils]: 69: Hoare triple {4654#true} assume !(0 == ~cond); {4654#true} is VALID [2022-04-28 07:59:36,459 INFO L290 TraceCheckUtils]: 70: Hoare triple {4654#true} assume true; {4654#true} is VALID [2022-04-28 07:59:36,460 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4654#true} {4861#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #57#return; {4861#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:36,460 INFO L290 TraceCheckUtils]: 72: Hoare triple {4861#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4883#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-28 07:59:36,461 INFO L290 TraceCheckUtils]: 73: Hoare triple {4883#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !false; {4883#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-28 07:59:36,461 INFO L272 TraceCheckUtils]: 74: Hoare triple {4883#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4654#true} is VALID [2022-04-28 07:59:36,461 INFO L290 TraceCheckUtils]: 75: Hoare triple {4654#true} ~cond := #in~cond; {4654#true} is VALID [2022-04-28 07:59:36,461 INFO L290 TraceCheckUtils]: 76: Hoare triple {4654#true} assume !(0 == ~cond); {4654#true} is VALID [2022-04-28 07:59:36,461 INFO L290 TraceCheckUtils]: 77: Hoare triple {4654#true} assume true; {4654#true} is VALID [2022-04-28 07:59:36,462 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4654#true} {4883#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #57#return; {4883#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-28 07:59:36,462 INFO L290 TraceCheckUtils]: 79: Hoare triple {4883#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {4905#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} is VALID [2022-04-28 07:59:36,462 INFO L272 TraceCheckUtils]: 80: Hoare triple {4905#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4654#true} is VALID [2022-04-28 07:59:36,463 INFO L290 TraceCheckUtils]: 81: Hoare triple {4654#true} ~cond := #in~cond; {4654#true} is VALID [2022-04-28 07:59:36,463 INFO L290 TraceCheckUtils]: 82: Hoare triple {4654#true} assume !(0 == ~cond); {4654#true} is VALID [2022-04-28 07:59:36,463 INFO L290 TraceCheckUtils]: 83: Hoare triple {4654#true} assume true; {4654#true} is VALID [2022-04-28 07:59:36,463 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {4654#true} {4905#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} #59#return; {4905#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} is VALID [2022-04-28 07:59:36,464 INFO L272 TraceCheckUtils]: 85: Hoare triple {4905#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4924#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:36,464 INFO L290 TraceCheckUtils]: 86: Hoare triple {4924#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4928#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:36,465 INFO L290 TraceCheckUtils]: 87: Hoare triple {4928#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4655#false} is VALID [2022-04-28 07:59:36,465 INFO L290 TraceCheckUtils]: 88: Hoare triple {4655#false} assume !false; {4655#false} is VALID [2022-04-28 07:59:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-28 07:59:36,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:36,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:36,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207849856] [2022-04-28 07:59:36,740 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:36,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724220837] [2022-04-28 07:59:36,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724220837] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:59:36,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:59:36,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-28 07:59:36,741 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:36,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1089782093] [2022-04-28 07:59:36,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1089782093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:36,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:36,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 07:59:36,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596377710] [2022-04-28 07:59:36,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:36,742 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-28 07:59:36,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:36,742 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-28 07:59:36,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:36,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 07:59:36,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:36,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 07:59:36,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 07:59:36,793 INFO L87 Difference]: Start difference. First operand 54 states and 63 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-28 07:59:37,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:37,832 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-28 07:59:37,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 07:59:37,833 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-28 07:59:37,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:37,833 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-28 07:59:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-28 07:59:37,835 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-28 07:59:37,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-28 07:59:37,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-28 07:59:37,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:37,899 INFO L225 Difference]: With dead ends: 63 [2022-04-28 07:59:37,900 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 07:59:37,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:59:37,901 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:37,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 394 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 07:59:37,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 07:59:37,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-28 07:59:37,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:37,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:59:37,941 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:59:37,941 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:59:37,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:37,942 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-28 07:59:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-28 07:59:37,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:37,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:37,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-28 07:59:37,944 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-28 07:59:37,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:37,945 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-28 07:59:37,945 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-28 07:59:37,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:37,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:37,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:37,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:59:37,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-04-28 07:59:37,948 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 89 [2022-04-28 07:59:37,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:37,948 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-04-28 07:59:37,948 INFO L496 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-28 07:59:37,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 67 transitions. [2022-04-28 07:59:38,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-28 07:59:38,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-28 07:59:38,122 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:38,122 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:38,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 07:59:38,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 07:59:38,324 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:38,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:38,324 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 17 times [2022-04-28 07:59:38,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:38,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1211360073] [2022-04-28 07:59:38,324 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:59:38,325 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 18 times [2022-04-28 07:59:38,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:38,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588499325] [2022-04-28 07:59:38,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:38,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:38,340 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:38,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1879580738] [2022-04-28 07:59:38,340 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:59:38,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:38,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:38,341 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:38,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 07:59:38,989 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 07:59:38,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:38,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 07:59:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:39,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:39,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {5349#true} call ULTIMATE.init(); {5349#true} is VALID [2022-04-28 07:59:39,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {5349#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); {5349#true} is VALID [2022-04-28 07:59:39,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {5349#true} assume true; {5349#true} is VALID [2022-04-28 07:59:39,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5349#true} {5349#true} #63#return; {5349#true} is VALID [2022-04-28 07:59:39,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {5349#true} call #t~ret5 := main(); {5349#true} is VALID [2022-04-28 07:59:39,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {5349#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; {5349#true} is VALID [2022-04-28 07:59:39,559 INFO L272 TraceCheckUtils]: 6: Hoare triple {5349#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {5349#true} is VALID [2022-04-28 07:59:39,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {5349#true} ~cond := #in~cond; {5349#true} is VALID [2022-04-28 07:59:39,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {5349#true} assume !(0 == ~cond); {5349#true} is VALID [2022-04-28 07:59:39,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {5349#true} assume true; {5349#true} is VALID [2022-04-28 07:59:39,559 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5349#true} {5349#true} #53#return; {5349#true} is VALID [2022-04-28 07:59:39,559 INFO L272 TraceCheckUtils]: 11: Hoare triple {5349#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5349#true} is VALID [2022-04-28 07:59:39,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {5349#true} ~cond := #in~cond; {5349#true} is VALID [2022-04-28 07:59:39,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {5349#true} assume !(0 == ~cond); {5349#true} is VALID [2022-04-28 07:59:39,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {5349#true} assume true; {5349#true} is VALID [2022-04-28 07:59:39,560 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5349#true} {5349#true} #55#return; {5349#true} is VALID [2022-04-28 07:59:39,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {5349#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5402#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:39,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {5402#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5402#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:39,564 INFO L272 TraceCheckUtils]: 18: Hoare triple {5402#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5349#true} is VALID [2022-04-28 07:59:39,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {5349#true} ~cond := #in~cond; {5349#true} is VALID [2022-04-28 07:59:39,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {5349#true} assume !(0 == ~cond); {5349#true} is VALID [2022-04-28 07:59:39,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {5349#true} assume true; {5349#true} is VALID [2022-04-28 07:59:39,565 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5349#true} {5402#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {5402#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:39,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {5402#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5424#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:59:39,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {5424#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {5424#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:59:39,566 INFO L272 TraceCheckUtils]: 25: Hoare triple {5424#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5349#true} is VALID [2022-04-28 07:59:39,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {5349#true} ~cond := #in~cond; {5349#true} is VALID [2022-04-28 07:59:39,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {5349#true} assume !(0 == ~cond); {5349#true} is VALID [2022-04-28 07:59:39,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {5349#true} assume true; {5349#true} is VALID [2022-04-28 07:59:39,567 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5349#true} {5424#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {5424#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:59:39,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {5424#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5446#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:59:39,568 INFO L290 TraceCheckUtils]: 31: Hoare triple {5446#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {5446#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:59:39,568 INFO L272 TraceCheckUtils]: 32: Hoare triple {5446#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5349#true} is VALID [2022-04-28 07:59:39,568 INFO L290 TraceCheckUtils]: 33: Hoare triple {5349#true} ~cond := #in~cond; {5349#true} is VALID [2022-04-28 07:59:39,568 INFO L290 TraceCheckUtils]: 34: Hoare triple {5349#true} assume !(0 == ~cond); {5349#true} is VALID [2022-04-28 07:59:39,568 INFO L290 TraceCheckUtils]: 35: Hoare triple {5349#true} assume true; {5349#true} is VALID [2022-04-28 07:59:39,569 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5349#true} {5446#(and (= main_~y~0 2) (= main_~c~0 2))} #57#return; {5446#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:59:39,569 INFO L290 TraceCheckUtils]: 37: Hoare triple {5446#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5468#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:59:39,569 INFO L290 TraceCheckUtils]: 38: Hoare triple {5468#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {5468#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:59:39,570 INFO L272 TraceCheckUtils]: 39: Hoare triple {5468#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5349#true} is VALID [2022-04-28 07:59:39,570 INFO L290 TraceCheckUtils]: 40: Hoare triple {5349#true} ~cond := #in~cond; {5349#true} is VALID [2022-04-28 07:59:39,570 INFO L290 TraceCheckUtils]: 41: Hoare triple {5349#true} assume !(0 == ~cond); {5349#true} is VALID [2022-04-28 07:59:39,570 INFO L290 TraceCheckUtils]: 42: Hoare triple {5349#true} assume true; {5349#true} is VALID [2022-04-28 07:59:39,570 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5349#true} {5468#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #57#return; {5468#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:59:39,571 INFO L290 TraceCheckUtils]: 44: Hoare triple {5468#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5490#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:59:39,571 INFO L290 TraceCheckUtils]: 45: Hoare triple {5490#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {5490#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:59:39,571 INFO L272 TraceCheckUtils]: 46: Hoare triple {5490#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5349#true} is VALID [2022-04-28 07:59:39,571 INFO L290 TraceCheckUtils]: 47: Hoare triple {5349#true} ~cond := #in~cond; {5349#true} is VALID [2022-04-28 07:59:39,572 INFO L290 TraceCheckUtils]: 48: Hoare triple {5349#true} assume !(0 == ~cond); {5349#true} is VALID [2022-04-28 07:59:39,572 INFO L290 TraceCheckUtils]: 49: Hoare triple {5349#true} assume true; {5349#true} is VALID [2022-04-28 07:59:39,572 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5349#true} {5490#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #57#return; {5490#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:59:39,573 INFO L290 TraceCheckUtils]: 51: Hoare triple {5490#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5512#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:39,573 INFO L290 TraceCheckUtils]: 52: Hoare triple {5512#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {5512#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:39,573 INFO L272 TraceCheckUtils]: 53: Hoare triple {5512#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5349#true} is VALID [2022-04-28 07:59:39,573 INFO L290 TraceCheckUtils]: 54: Hoare triple {5349#true} ~cond := #in~cond; {5349#true} is VALID [2022-04-28 07:59:39,573 INFO L290 TraceCheckUtils]: 55: Hoare triple {5349#true} assume !(0 == ~cond); {5349#true} is VALID [2022-04-28 07:59:39,573 INFO L290 TraceCheckUtils]: 56: Hoare triple {5349#true} assume true; {5349#true} is VALID [2022-04-28 07:59:39,574 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {5349#true} {5512#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {5512#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:39,574 INFO L290 TraceCheckUtils]: 58: Hoare triple {5512#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5534#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:39,575 INFO L290 TraceCheckUtils]: 59: Hoare triple {5534#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {5534#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:39,575 INFO L272 TraceCheckUtils]: 60: Hoare triple {5534#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5349#true} is VALID [2022-04-28 07:59:39,575 INFO L290 TraceCheckUtils]: 61: Hoare triple {5349#true} ~cond := #in~cond; {5349#true} is VALID [2022-04-28 07:59:39,575 INFO L290 TraceCheckUtils]: 62: Hoare triple {5349#true} assume !(0 == ~cond); {5349#true} is VALID [2022-04-28 07:59:39,575 INFO L290 TraceCheckUtils]: 63: Hoare triple {5349#true} assume true; {5349#true} is VALID [2022-04-28 07:59:39,576 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5349#true} {5534#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #57#return; {5534#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:39,576 INFO L290 TraceCheckUtils]: 65: Hoare triple {5534#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5556#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:59:39,576 INFO L290 TraceCheckUtils]: 66: Hoare triple {5556#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !false; {5556#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:59:39,577 INFO L272 TraceCheckUtils]: 67: Hoare triple {5556#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5349#true} is VALID [2022-04-28 07:59:39,577 INFO L290 TraceCheckUtils]: 68: Hoare triple {5349#true} ~cond := #in~cond; {5349#true} is VALID [2022-04-28 07:59:39,577 INFO L290 TraceCheckUtils]: 69: Hoare triple {5349#true} assume !(0 == ~cond); {5349#true} is VALID [2022-04-28 07:59:39,577 INFO L290 TraceCheckUtils]: 70: Hoare triple {5349#true} assume true; {5349#true} is VALID [2022-04-28 07:59:39,577 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5349#true} {5556#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #57#return; {5556#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:59:39,578 INFO L290 TraceCheckUtils]: 72: Hoare triple {5556#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5578#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-28 07:59:39,578 INFO L290 TraceCheckUtils]: 73: Hoare triple {5578#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !false; {5578#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-28 07:59:39,578 INFO L272 TraceCheckUtils]: 74: Hoare triple {5578#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5349#true} is VALID [2022-04-28 07:59:39,578 INFO L290 TraceCheckUtils]: 75: Hoare triple {5349#true} ~cond := #in~cond; {5349#true} is VALID [2022-04-28 07:59:39,579 INFO L290 TraceCheckUtils]: 76: Hoare triple {5349#true} assume !(0 == ~cond); {5349#true} is VALID [2022-04-28 07:59:39,579 INFO L290 TraceCheckUtils]: 77: Hoare triple {5349#true} assume true; {5349#true} is VALID [2022-04-28 07:59:39,579 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {5349#true} {5578#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} #57#return; {5578#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-28 07:59:39,590 INFO L290 TraceCheckUtils]: 79: Hoare triple {5578#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5600#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 07:59:39,591 INFO L290 TraceCheckUtils]: 80: Hoare triple {5600#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {5600#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 07:59:39,591 INFO L272 TraceCheckUtils]: 81: Hoare triple {5600#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5349#true} is VALID [2022-04-28 07:59:39,591 INFO L290 TraceCheckUtils]: 82: Hoare triple {5349#true} ~cond := #in~cond; {5349#true} is VALID [2022-04-28 07:59:39,591 INFO L290 TraceCheckUtils]: 83: Hoare triple {5349#true} assume !(0 == ~cond); {5349#true} is VALID [2022-04-28 07:59:39,591 INFO L290 TraceCheckUtils]: 84: Hoare triple {5349#true} assume true; {5349#true} is VALID [2022-04-28 07:59:39,592 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {5349#true} {5600#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #57#return; {5600#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 07:59:39,593 INFO L290 TraceCheckUtils]: 86: Hoare triple {5600#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {5622#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-28 07:59:39,593 INFO L272 TraceCheckUtils]: 87: Hoare triple {5622#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5349#true} is VALID [2022-04-28 07:59:39,593 INFO L290 TraceCheckUtils]: 88: Hoare triple {5349#true} ~cond := #in~cond; {5349#true} is VALID [2022-04-28 07:59:39,593 INFO L290 TraceCheckUtils]: 89: Hoare triple {5349#true} assume !(0 == ~cond); {5349#true} is VALID [2022-04-28 07:59:39,593 INFO L290 TraceCheckUtils]: 90: Hoare triple {5349#true} assume true; {5349#true} is VALID [2022-04-28 07:59:39,594 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {5349#true} {5622#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} #59#return; {5622#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-28 07:59:39,594 INFO L272 TraceCheckUtils]: 92: Hoare triple {5622#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5641#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:39,595 INFO L290 TraceCheckUtils]: 93: Hoare triple {5641#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5645#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:39,595 INFO L290 TraceCheckUtils]: 94: Hoare triple {5645#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5350#false} is VALID [2022-04-28 07:59:39,595 INFO L290 TraceCheckUtils]: 95: Hoare triple {5350#false} assume !false; {5350#false} is VALID [2022-04-28 07:59:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 22 proven. 135 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-28 07:59:39,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:39,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:39,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588499325] [2022-04-28 07:59:39,952 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:39,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879580738] [2022-04-28 07:59:39,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879580738] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:59:39,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:59:39,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-28 07:59:39,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:39,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1211360073] [2022-04-28 07:59:39,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1211360073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:39,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:39,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 07:59:39,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906997380] [2022-04-28 07:59:39,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:39,953 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Word has length 96 [2022-04-28 07:59:39,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:39,954 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-28 07:59:40,006 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-28 07:59:40,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 07:59:40,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:40,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 07:59:40,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-28 07:59:40,007 INFO L87 Difference]: Start difference. First operand 57 states and 67 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-28 07:59:41,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:41,394 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-04-28 07:59:41,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 07:59:41,394 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Word has length 96 [2022-04-28 07:59:41,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:41,395 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-28 07:59:41,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-28 07:59:41,396 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-28 07:59:41,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-28 07:59:41,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 74 transitions. [2022-04-28 07:59:41,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:41,472 INFO L225 Difference]: With dead ends: 66 [2022-04-28 07:59:41,472 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 07:59:41,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 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-28 07:59:41,473 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:41,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 439 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 07:59:41,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 07:59:41,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-28 07:59:41,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:41,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:59:41,515 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:59:41,515 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:59:41,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:41,517 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-28 07:59:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-28 07:59:41,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:41,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:41,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 60 states. [2022-04-28 07:59:41,518 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 60 states. [2022-04-28 07:59:41,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:41,520 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-28 07:59:41,520 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-28 07:59:41,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:41,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:41,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:41,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:59:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2022-04-28 07:59:41,523 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 96 [2022-04-28 07:59:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:41,523 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2022-04-28 07:59:41,523 INFO L496 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-28 07:59:41,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 71 transitions. [2022-04-28 07:59:41,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:41,687 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-28 07:59:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 07:59:41,689 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:41,689 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:41,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 07:59:41,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 07:59:41,896 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:41,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:41,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1610181715, now seen corresponding path program 19 times [2022-04-28 07:59:41,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:41,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [481907377] [2022-04-28 07:59:41,897 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:59:41,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1610181715, now seen corresponding path program 20 times [2022-04-28 07:59:41,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:41,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404892974] [2022-04-28 07:59:41,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:41,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:41,916 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:41,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1293989691] [2022-04-28 07:59:41,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:59:41,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:41,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:41,918 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:41,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 07:59:42,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:59:42,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:42,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 07:59:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:42,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:43,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {6084#true} call ULTIMATE.init(); {6084#true} is VALID [2022-04-28 07:59:43,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {6084#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); {6084#true} is VALID [2022-04-28 07:59:43,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {6084#true} assume true; {6084#true} is VALID [2022-04-28 07:59:43,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6084#true} {6084#true} #63#return; {6084#true} is VALID [2022-04-28 07:59:43,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {6084#true} call #t~ret5 := main(); {6084#true} is VALID [2022-04-28 07:59:43,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {6084#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; {6084#true} is VALID [2022-04-28 07:59:43,168 INFO L272 TraceCheckUtils]: 6: Hoare triple {6084#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {6084#true} is VALID [2022-04-28 07:59:43,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {6084#true} ~cond := #in~cond; {6084#true} is VALID [2022-04-28 07:59:43,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {6084#true} assume !(0 == ~cond); {6084#true} is VALID [2022-04-28 07:59:43,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {6084#true} assume true; {6084#true} is VALID [2022-04-28 07:59:43,168 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6084#true} {6084#true} #53#return; {6084#true} is VALID [2022-04-28 07:59:43,169 INFO L272 TraceCheckUtils]: 11: Hoare triple {6084#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6084#true} is VALID [2022-04-28 07:59:43,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {6084#true} ~cond := #in~cond; {6084#true} is VALID [2022-04-28 07:59:43,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {6084#true} assume !(0 == ~cond); {6084#true} is VALID [2022-04-28 07:59:43,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {6084#true} assume true; {6084#true} is VALID [2022-04-28 07:59:43,169 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6084#true} {6084#true} #55#return; {6084#true} is VALID [2022-04-28 07:59:43,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {6084#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6137#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:43,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {6137#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6137#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:43,170 INFO L272 TraceCheckUtils]: 18: Hoare triple {6137#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6084#true} is VALID [2022-04-28 07:59:43,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {6084#true} ~cond := #in~cond; {6084#true} is VALID [2022-04-28 07:59:43,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {6084#true} assume !(0 == ~cond); {6084#true} is VALID [2022-04-28 07:59:43,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {6084#true} assume true; {6084#true} is VALID [2022-04-28 07:59:43,171 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6084#true} {6137#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {6137#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:43,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {6137#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6159#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:59:43,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {6159#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {6159#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:59:43,172 INFO L272 TraceCheckUtils]: 25: Hoare triple {6159#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6084#true} is VALID [2022-04-28 07:59:43,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {6084#true} ~cond := #in~cond; {6084#true} is VALID [2022-04-28 07:59:43,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {6084#true} assume !(0 == ~cond); {6084#true} is VALID [2022-04-28 07:59:43,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {6084#true} assume true; {6084#true} is VALID [2022-04-28 07:59:43,172 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6084#true} {6159#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {6159#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:59:43,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {6159#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6181#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:59:43,173 INFO L290 TraceCheckUtils]: 31: Hoare triple {6181#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {6181#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:59:43,173 INFO L272 TraceCheckUtils]: 32: Hoare triple {6181#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6084#true} is VALID [2022-04-28 07:59:43,173 INFO L290 TraceCheckUtils]: 33: Hoare triple {6084#true} ~cond := #in~cond; {6084#true} is VALID [2022-04-28 07:59:43,173 INFO L290 TraceCheckUtils]: 34: Hoare triple {6084#true} assume !(0 == ~cond); {6084#true} is VALID [2022-04-28 07:59:43,174 INFO L290 TraceCheckUtils]: 35: Hoare triple {6084#true} assume true; {6084#true} is VALID [2022-04-28 07:59:43,174 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6084#true} {6181#(and (= main_~y~0 2) (= main_~c~0 2))} #57#return; {6181#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:59:43,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {6181#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6203#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:59:43,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {6203#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {6203#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:59:43,175 INFO L272 TraceCheckUtils]: 39: Hoare triple {6203#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6084#true} is VALID [2022-04-28 07:59:43,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {6084#true} ~cond := #in~cond; {6084#true} is VALID [2022-04-28 07:59:43,175 INFO L290 TraceCheckUtils]: 41: Hoare triple {6084#true} assume !(0 == ~cond); {6084#true} is VALID [2022-04-28 07:59:43,175 INFO L290 TraceCheckUtils]: 42: Hoare triple {6084#true} assume true; {6084#true} is VALID [2022-04-28 07:59:43,180 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6084#true} {6203#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #57#return; {6203#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:59:43,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {6203#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6225#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:43,181 INFO L290 TraceCheckUtils]: 45: Hoare triple {6225#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {6225#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:43,181 INFO L272 TraceCheckUtils]: 46: Hoare triple {6225#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6084#true} is VALID [2022-04-28 07:59:43,181 INFO L290 TraceCheckUtils]: 47: Hoare triple {6084#true} ~cond := #in~cond; {6084#true} is VALID [2022-04-28 07:59:43,181 INFO L290 TraceCheckUtils]: 48: Hoare triple {6084#true} assume !(0 == ~cond); {6084#true} is VALID [2022-04-28 07:59:43,182 INFO L290 TraceCheckUtils]: 49: Hoare triple {6084#true} assume true; {6084#true} is VALID [2022-04-28 07:59:43,182 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6084#true} {6225#(and (= main_~y~0 4) (= main_~c~0 4))} #57#return; {6225#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:43,183 INFO L290 TraceCheckUtils]: 51: Hoare triple {6225#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6247#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:59:43,183 INFO L290 TraceCheckUtils]: 52: Hoare triple {6247#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !false; {6247#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:59:43,184 INFO L272 TraceCheckUtils]: 53: Hoare triple {6247#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6084#true} is VALID [2022-04-28 07:59:43,184 INFO L290 TraceCheckUtils]: 54: Hoare triple {6084#true} ~cond := #in~cond; {6084#true} is VALID [2022-04-28 07:59:43,184 INFO L290 TraceCheckUtils]: 55: Hoare triple {6084#true} assume !(0 == ~cond); {6084#true} is VALID [2022-04-28 07:59:43,184 INFO L290 TraceCheckUtils]: 56: Hoare triple {6084#true} assume true; {6084#true} is VALID [2022-04-28 07:59:43,185 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {6084#true} {6247#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #57#return; {6247#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:59:43,185 INFO L290 TraceCheckUtils]: 58: Hoare triple {6247#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6269#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:59:43,186 INFO L290 TraceCheckUtils]: 59: Hoare triple {6269#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} assume !false; {6269#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:59:43,186 INFO L272 TraceCheckUtils]: 60: Hoare triple {6269#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6084#true} is VALID [2022-04-28 07:59:43,186 INFO L290 TraceCheckUtils]: 61: Hoare triple {6084#true} ~cond := #in~cond; {6084#true} is VALID [2022-04-28 07:59:43,186 INFO L290 TraceCheckUtils]: 62: Hoare triple {6084#true} assume !(0 == ~cond); {6084#true} is VALID [2022-04-28 07:59:43,186 INFO L290 TraceCheckUtils]: 63: Hoare triple {6084#true} assume true; {6084#true} is VALID [2022-04-28 07:59:43,187 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6084#true} {6269#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} #57#return; {6269#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:59:43,188 INFO L290 TraceCheckUtils]: 65: Hoare triple {6269#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6291#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-28 07:59:43,188 INFO L290 TraceCheckUtils]: 66: Hoare triple {6291#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 3)) 4))} assume !false; {6291#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-28 07:59:43,188 INFO L272 TraceCheckUtils]: 67: Hoare triple {6291#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 3)) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6084#true} is VALID [2022-04-28 07:59:43,188 INFO L290 TraceCheckUtils]: 68: Hoare triple {6084#true} ~cond := #in~cond; {6084#true} is VALID [2022-04-28 07:59:43,189 INFO L290 TraceCheckUtils]: 69: Hoare triple {6084#true} assume !(0 == ~cond); {6084#true} is VALID [2022-04-28 07:59:43,189 INFO L290 TraceCheckUtils]: 70: Hoare triple {6084#true} assume true; {6084#true} is VALID [2022-04-28 07:59:43,189 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6084#true} {6291#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 3)) 4))} #57#return; {6291#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-28 07:59:43,190 INFO L290 TraceCheckUtils]: 72: Hoare triple {6291#(and (= 7 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 * ~y~0 * ~y~0 + ~x~0; {6313#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:59:43,190 INFO L290 TraceCheckUtils]: 73: Hoare triple {6313#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {6313#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:59:43,191 INFO L272 TraceCheckUtils]: 74: Hoare triple {6313#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6084#true} is VALID [2022-04-28 07:59:43,191 INFO L290 TraceCheckUtils]: 75: Hoare triple {6084#true} ~cond := #in~cond; {6084#true} is VALID [2022-04-28 07:59:43,191 INFO L290 TraceCheckUtils]: 76: Hoare triple {6084#true} assume !(0 == ~cond); {6084#true} is VALID [2022-04-28 07:59:43,191 INFO L290 TraceCheckUtils]: 77: Hoare triple {6084#true} assume true; {6084#true} is VALID [2022-04-28 07:59:43,192 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {6084#true} {6313#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #57#return; {6313#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:59:43,192 INFO L290 TraceCheckUtils]: 79: Hoare triple {6313#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6335#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:59:43,193 INFO L290 TraceCheckUtils]: 80: Hoare triple {6335#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {6335#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:59:43,193 INFO L272 TraceCheckUtils]: 81: Hoare triple {6335#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6084#true} is VALID [2022-04-28 07:59:43,193 INFO L290 TraceCheckUtils]: 82: Hoare triple {6084#true} ~cond := #in~cond; {6084#true} is VALID [2022-04-28 07:59:43,193 INFO L290 TraceCheckUtils]: 83: Hoare triple {6084#true} assume !(0 == ~cond); {6084#true} is VALID [2022-04-28 07:59:43,193 INFO L290 TraceCheckUtils]: 84: Hoare triple {6084#true} assume true; {6084#true} is VALID [2022-04-28 07:59:43,194 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {6084#true} {6335#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #57#return; {6335#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:59:43,195 INFO L290 TraceCheckUtils]: 86: Hoare triple {6335#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6357#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-28 07:59:43,195 INFO L290 TraceCheckUtils]: 87: Hoare triple {6357#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} assume !false; {6357#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-28 07:59:43,195 INFO L272 TraceCheckUtils]: 88: Hoare triple {6357#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6084#true} is VALID [2022-04-28 07:59:43,195 INFO L290 TraceCheckUtils]: 89: Hoare triple {6084#true} ~cond := #in~cond; {6084#true} is VALID [2022-04-28 07:59:43,195 INFO L290 TraceCheckUtils]: 90: Hoare triple {6084#true} assume !(0 == ~cond); {6084#true} is VALID [2022-04-28 07:59:43,196 INFO L290 TraceCheckUtils]: 91: Hoare triple {6084#true} assume true; {6084#true} is VALID [2022-04-28 07:59:43,196 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {6084#true} {6357#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} #57#return; {6357#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-28 07:59:43,197 INFO L290 TraceCheckUtils]: 93: Hoare triple {6357#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {6379#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-28 07:59:43,197 INFO L272 TraceCheckUtils]: 94: Hoare triple {6379#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6084#true} is VALID [2022-04-28 07:59:43,197 INFO L290 TraceCheckUtils]: 95: Hoare triple {6084#true} ~cond := #in~cond; {6084#true} is VALID [2022-04-28 07:59:43,197 INFO L290 TraceCheckUtils]: 96: Hoare triple {6084#true} assume !(0 == ~cond); {6084#true} is VALID [2022-04-28 07:59:43,197 INFO L290 TraceCheckUtils]: 97: Hoare triple {6084#true} assume true; {6084#true} is VALID [2022-04-28 07:59:43,198 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {6084#true} {6379#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} #59#return; {6379#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-28 07:59:43,199 INFO L272 TraceCheckUtils]: 99: Hoare triple {6379#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {6398#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:43,199 INFO L290 TraceCheckUtils]: 100: Hoare triple {6398#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6402#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:43,200 INFO L290 TraceCheckUtils]: 101: Hoare triple {6402#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6085#false} is VALID [2022-04-28 07:59:43,200 INFO L290 TraceCheckUtils]: 102: Hoare triple {6085#false} assume !false; {6085#false} is VALID [2022-04-28 07:59:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 24 proven. 165 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-28 07:59:43,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:43,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:43,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404892974] [2022-04-28 07:59:43,522 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:43,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293989691] [2022-04-28 07:59:43,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293989691] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:59:43,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:59:43,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-28 07:59:43,523 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:43,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [481907377] [2022-04-28 07:59:43,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [481907377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:43,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:43,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 07:59:43,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164507427] [2022-04-28 07:59:43,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:43,524 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Word has length 103 [2022-04-28 07:59:43,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:43,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-28 07:59:43,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:43,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 07:59:43,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:43,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 07:59:43,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:59:43,588 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-28 07:59:45,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:45,018 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-28 07:59:45,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 07:59:45,018 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Word has length 103 [2022-04-28 07:59:45,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:45,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-28 07:59:45,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2022-04-28 07:59:45,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-28 07:59:45,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2022-04-28 07:59:45,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 78 transitions. [2022-04-28 07:59:45,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:45,089 INFO L225 Difference]: With dead ends: 69 [2022-04-28 07:59:45,089 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 07:59:45,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-28 07:59:45,090 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:45,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 486 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 07:59:45,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 07:59:45,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-28 07:59:45,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:45,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 07:59:45,139 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 07:59:45,140 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 07:59:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:45,142 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-28 07:59:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-28 07:59:45,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:45,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:45,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-28 07:59:45,143 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-28 07:59:45,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:45,144 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-28 07:59:45,145 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-28 07:59:45,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:45,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:45,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:45,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 07:59:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2022-04-28 07:59:45,147 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 103 [2022-04-28 07:59:45,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:45,147 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-04-28 07:59:45,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-28 07:59:45,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 75 transitions. [2022-04-28 07:59:45,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-28 07:59:45,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-28 07:59:45,303 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:45,304 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 12, 12, 12, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:45,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 07:59:45,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 07:59:45,510 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:45,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:45,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1881400669, now seen corresponding path program 21 times [2022-04-28 07:59:45,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:45,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [928955385] [2022-04-28 07:59:45,511 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:59:45,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1881400669, now seen corresponding path program 22 times [2022-04-28 07:59:45,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:45,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105884859] [2022-04-28 07:59:45,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:45,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:45,528 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:45,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [494123785] [2022-04-28 07:59:45,528 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:59:45,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:45,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:45,529 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:45,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 07:59:45,581 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:59:45,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:45,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 07:59:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:45,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:46,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {6859#true} call ULTIMATE.init(); {6859#true} is VALID [2022-04-28 07:59:46,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {6859#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); {6859#true} is VALID [2022-04-28 07:59:46,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-04-28 07:59:46,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6859#true} {6859#true} #63#return; {6859#true} is VALID [2022-04-28 07:59:46,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {6859#true} call #t~ret5 := main(); {6859#true} is VALID [2022-04-28 07:59:46,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {6859#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; {6859#true} is VALID [2022-04-28 07:59:46,173 INFO L272 TraceCheckUtils]: 6: Hoare triple {6859#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {6859#true} is VALID [2022-04-28 07:59:46,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {6859#true} ~cond := #in~cond; {6859#true} is VALID [2022-04-28 07:59:46,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {6859#true} assume !(0 == ~cond); {6859#true} is VALID [2022-04-28 07:59:46,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-04-28 07:59:46,174 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6859#true} {6859#true} #53#return; {6859#true} is VALID [2022-04-28 07:59:46,174 INFO L272 TraceCheckUtils]: 11: Hoare triple {6859#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6859#true} is VALID [2022-04-28 07:59:46,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {6859#true} ~cond := #in~cond; {6859#true} is VALID [2022-04-28 07:59:46,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {6859#true} assume !(0 == ~cond); {6859#true} is VALID [2022-04-28 07:59:46,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-04-28 07:59:46,174 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6859#true} {6859#true} #55#return; {6859#true} is VALID [2022-04-28 07:59:46,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {6859#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6912#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:46,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {6912#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6912#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:46,175 INFO L272 TraceCheckUtils]: 18: Hoare triple {6912#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6859#true} is VALID [2022-04-28 07:59:46,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {6859#true} ~cond := #in~cond; {6859#true} is VALID [2022-04-28 07:59:46,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {6859#true} assume !(0 == ~cond); {6859#true} is VALID [2022-04-28 07:59:46,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-04-28 07:59:46,176 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6859#true} {6912#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {6912#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:46,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {6912#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6934#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:59:46,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {6934#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {6934#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:59:46,177 INFO L272 TraceCheckUtils]: 25: Hoare triple {6934#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6859#true} is VALID [2022-04-28 07:59:46,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {6859#true} ~cond := #in~cond; {6859#true} is VALID [2022-04-28 07:59:46,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {6859#true} assume !(0 == ~cond); {6859#true} is VALID [2022-04-28 07:59:46,177 INFO L290 TraceCheckUtils]: 28: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-04-28 07:59:46,178 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6859#true} {6934#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {6934#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:59:46,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {6934#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6956#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:59:46,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {6956#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {6956#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:59:46,179 INFO L272 TraceCheckUtils]: 32: Hoare triple {6956#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6859#true} is VALID [2022-04-28 07:59:46,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {6859#true} ~cond := #in~cond; {6859#true} is VALID [2022-04-28 07:59:46,179 INFO L290 TraceCheckUtils]: 34: Hoare triple {6859#true} assume !(0 == ~cond); {6859#true} is VALID [2022-04-28 07:59:46,179 INFO L290 TraceCheckUtils]: 35: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-04-28 07:59:46,180 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6859#true} {6956#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #57#return; {6956#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:59:46,180 INFO L290 TraceCheckUtils]: 37: Hoare triple {6956#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6978#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:59:46,180 INFO L290 TraceCheckUtils]: 38: Hoare triple {6978#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {6978#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:59:46,181 INFO L272 TraceCheckUtils]: 39: Hoare triple {6978#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6859#true} is VALID [2022-04-28 07:59:46,181 INFO L290 TraceCheckUtils]: 40: Hoare triple {6859#true} ~cond := #in~cond; {6859#true} is VALID [2022-04-28 07:59:46,181 INFO L290 TraceCheckUtils]: 41: Hoare triple {6859#true} assume !(0 == ~cond); {6859#true} is VALID [2022-04-28 07:59:46,181 INFO L290 TraceCheckUtils]: 42: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-04-28 07:59:46,181 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6859#true} {6978#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #57#return; {6978#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:59:46,182 INFO L290 TraceCheckUtils]: 44: Hoare triple {6978#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7000#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:46,182 INFO L290 TraceCheckUtils]: 45: Hoare triple {7000#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {7000#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:46,182 INFO L272 TraceCheckUtils]: 46: Hoare triple {7000#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6859#true} is VALID [2022-04-28 07:59:46,182 INFO L290 TraceCheckUtils]: 47: Hoare triple {6859#true} ~cond := #in~cond; {6859#true} is VALID [2022-04-28 07:59:46,183 INFO L290 TraceCheckUtils]: 48: Hoare triple {6859#true} assume !(0 == ~cond); {6859#true} is VALID [2022-04-28 07:59:46,183 INFO L290 TraceCheckUtils]: 49: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-04-28 07:59:46,187 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6859#true} {7000#(and (= main_~y~0 4) (= main_~c~0 4))} #57#return; {7000#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:46,205 INFO L290 TraceCheckUtils]: 51: Hoare triple {7000#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7022#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:46,206 INFO L290 TraceCheckUtils]: 52: Hoare triple {7022#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {7022#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:46,206 INFO L272 TraceCheckUtils]: 53: Hoare triple {7022#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6859#true} is VALID [2022-04-28 07:59:46,206 INFO L290 TraceCheckUtils]: 54: Hoare triple {6859#true} ~cond := #in~cond; {6859#true} is VALID [2022-04-28 07:59:46,206 INFO L290 TraceCheckUtils]: 55: Hoare triple {6859#true} assume !(0 == ~cond); {6859#true} is VALID [2022-04-28 07:59:46,206 INFO L290 TraceCheckUtils]: 56: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-04-28 07:59:46,206 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {6859#true} {7022#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #57#return; {7022#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:46,207 INFO L290 TraceCheckUtils]: 58: Hoare triple {7022#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7044#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:46,207 INFO L290 TraceCheckUtils]: 59: Hoare triple {7044#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {7044#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:46,207 INFO L272 TraceCheckUtils]: 60: Hoare triple {7044#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6859#true} is VALID [2022-04-28 07:59:46,208 INFO L290 TraceCheckUtils]: 61: Hoare triple {6859#true} ~cond := #in~cond; {6859#true} is VALID [2022-04-28 07:59:46,208 INFO L290 TraceCheckUtils]: 62: Hoare triple {6859#true} assume !(0 == ~cond); {6859#true} is VALID [2022-04-28 07:59:46,208 INFO L290 TraceCheckUtils]: 63: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-04-28 07:59:46,208 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6859#true} {7044#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #57#return; {7044#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:46,209 INFO L290 TraceCheckUtils]: 65: Hoare triple {7044#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7066#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-28 07:59:46,209 INFO L290 TraceCheckUtils]: 66: Hoare triple {7066#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !false; {7066#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-28 07:59:46,209 INFO L272 TraceCheckUtils]: 67: Hoare triple {7066#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6859#true} is VALID [2022-04-28 07:59:46,209 INFO L290 TraceCheckUtils]: 68: Hoare triple {6859#true} ~cond := #in~cond; {6859#true} is VALID [2022-04-28 07:59:46,209 INFO L290 TraceCheckUtils]: 69: Hoare triple {6859#true} assume !(0 == ~cond); {6859#true} is VALID [2022-04-28 07:59:46,209 INFO L290 TraceCheckUtils]: 70: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-04-28 07:59:46,210 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6859#true} {7066#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #57#return; {7066#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-28 07:59:46,210 INFO L290 TraceCheckUtils]: 72: Hoare triple {7066#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7088#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:59:46,211 INFO L290 TraceCheckUtils]: 73: Hoare triple {7088#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} assume !false; {7088#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:59:46,211 INFO L272 TraceCheckUtils]: 74: Hoare triple {7088#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6859#true} is VALID [2022-04-28 07:59:46,211 INFO L290 TraceCheckUtils]: 75: Hoare triple {6859#true} ~cond := #in~cond; {6859#true} is VALID [2022-04-28 07:59:46,211 INFO L290 TraceCheckUtils]: 76: Hoare triple {6859#true} assume !(0 == ~cond); {6859#true} is VALID [2022-04-28 07:59:46,211 INFO L290 TraceCheckUtils]: 77: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-04-28 07:59:46,212 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {6859#true} {7088#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} #57#return; {7088#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:59:46,212 INFO L290 TraceCheckUtils]: 79: Hoare triple {7088#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7110#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:59:46,212 INFO L290 TraceCheckUtils]: 80: Hoare triple {7110#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {7110#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:59:46,212 INFO L272 TraceCheckUtils]: 81: Hoare triple {7110#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6859#true} is VALID [2022-04-28 07:59:46,213 INFO L290 TraceCheckUtils]: 82: Hoare triple {6859#true} ~cond := #in~cond; {6859#true} is VALID [2022-04-28 07:59:46,213 INFO L290 TraceCheckUtils]: 83: Hoare triple {6859#true} assume !(0 == ~cond); {6859#true} is VALID [2022-04-28 07:59:46,213 INFO L290 TraceCheckUtils]: 84: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-04-28 07:59:46,213 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {6859#true} {7110#(and (= main_~y~0 9) (= main_~c~0 9))} #57#return; {7110#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:59:46,214 INFO L290 TraceCheckUtils]: 86: Hoare triple {7110#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7132#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:59:46,214 INFO L290 TraceCheckUtils]: 87: Hoare triple {7132#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !false; {7132#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:59:46,214 INFO L272 TraceCheckUtils]: 88: Hoare triple {7132#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6859#true} is VALID [2022-04-28 07:59:46,214 INFO L290 TraceCheckUtils]: 89: Hoare triple {6859#true} ~cond := #in~cond; {6859#true} is VALID [2022-04-28 07:59:46,214 INFO L290 TraceCheckUtils]: 90: Hoare triple {6859#true} assume !(0 == ~cond); {6859#true} is VALID [2022-04-28 07:59:46,214 INFO L290 TraceCheckUtils]: 91: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-04-28 07:59:46,215 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {6859#true} {7132#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} #57#return; {7132#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:59:46,215 INFO L290 TraceCheckUtils]: 93: Hoare triple {7132#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7154#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:59:46,216 INFO L290 TraceCheckUtils]: 94: Hoare triple {7154#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} assume !false; {7154#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:59:46,216 INFO L272 TraceCheckUtils]: 95: Hoare triple {7154#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6859#true} is VALID [2022-04-28 07:59:46,216 INFO L290 TraceCheckUtils]: 96: Hoare triple {6859#true} ~cond := #in~cond; {6859#true} is VALID [2022-04-28 07:59:46,216 INFO L290 TraceCheckUtils]: 97: Hoare triple {6859#true} assume !(0 == ~cond); {6859#true} is VALID [2022-04-28 07:59:46,216 INFO L290 TraceCheckUtils]: 98: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-04-28 07:59:46,217 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {6859#true} {7154#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} #57#return; {7154#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:59:46,217 INFO L290 TraceCheckUtils]: 100: Hoare triple {7154#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} assume !(~c~0 < ~k~0); {7176#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} is VALID [2022-04-28 07:59:46,217 INFO L272 TraceCheckUtils]: 101: Hoare triple {7176#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6859#true} is VALID [2022-04-28 07:59:46,217 INFO L290 TraceCheckUtils]: 102: Hoare triple {6859#true} ~cond := #in~cond; {6859#true} is VALID [2022-04-28 07:59:46,218 INFO L290 TraceCheckUtils]: 103: Hoare triple {6859#true} assume !(0 == ~cond); {6859#true} is VALID [2022-04-28 07:59:46,218 INFO L290 TraceCheckUtils]: 104: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-04-28 07:59:46,218 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {6859#true} {7176#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} #59#return; {7176#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} is VALID [2022-04-28 07:59:46,219 INFO L272 TraceCheckUtils]: 106: Hoare triple {7176#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7195#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:46,219 INFO L290 TraceCheckUtils]: 107: Hoare triple {7195#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7199#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:46,219 INFO L290 TraceCheckUtils]: 108: Hoare triple {7199#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6860#false} is VALID [2022-04-28 07:59:46,220 INFO L290 TraceCheckUtils]: 109: Hoare triple {6860#false} assume !false; {6860#false} is VALID [2022-04-28 07:59:46,220 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 26 proven. 198 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-28 07:59:46,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:46,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:46,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105884859] [2022-04-28 07:59:46,540 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:46,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494123785] [2022-04-28 07:59:46,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494123785] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:59:46,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:59:46,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-28 07:59:46,541 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:46,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [928955385] [2022-04-28 07:59:46,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [928955385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:46,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:46,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 07:59:46,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076464942] [2022-04-28 07:59:46,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:46,541 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Word has length 110 [2022-04-28 07:59:46,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:46,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-28 07:59:46,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:46,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 07:59:46,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:46,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 07:59:46,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-28 07:59:46,600 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-28 07:59:48,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:48,387 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2022-04-28 07:59:48,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 07:59:48,388 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Word has length 110 [2022-04-28 07:59:48,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:48,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-28 07:59:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2022-04-28 07:59:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-28 07:59:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2022-04-28 07:59:48,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2022-04-28 07:59:48,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:48,468 INFO L225 Difference]: With dead ends: 72 [2022-04-28 07:59:48,468 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 07:59:48,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-28 07:59:48,469 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:48,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 535 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 07:59:48,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 07:59:48,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-28 07:59:48,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:48,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 07:59:48,515 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 07:59:48,516 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 07:59:48,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:48,517 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-28 07:59:48,518 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-28 07:59:48,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:48,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:48,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-28 07:59:48,519 INFO L87 Difference]: Start difference. First operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-28 07:59:48,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:48,520 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-28 07:59:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-28 07:59:48,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:48,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:48,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:48,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 07:59:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-04-28 07:59:48,523 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 110 [2022-04-28 07:59:48,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:48,523 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-04-28 07:59:48,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-28 07:59:48,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 79 transitions. [2022-04-28 07:59:48,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:48,734 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-28 07:59:48,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-28 07:59:48,735 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:48,735 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 13, 13, 13, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:48,760 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-28 07:59:48,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 07:59:48,936 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:48,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:48,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1600671149, now seen corresponding path program 23 times [2022-04-28 07:59:48,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:48,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1685301294] [2022-04-28 07:59:48,937 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:59:48,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1600671149, now seen corresponding path program 24 times [2022-04-28 07:59:48,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:48,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33816471] [2022-04-28 07:59:48,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:48,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:48,962 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:48,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [780444020] [2022-04-28 07:59:48,963 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:59:48,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:48,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:48,964 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:48,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process