/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_valuebound20.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-34549b5
[2022-04-08 08:01:05,276 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-08 08:01:05,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-08 08:01:05,304 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-08 08:01:05,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-08 08:01:05,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-08 08:01:05,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-08 08:01:05,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-08 08:01:05,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-08 08:01:05,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-08 08:01:05,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-08 08:01:05,311 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-08 08:01:05,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-08 08:01:05,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-08 08:01:05,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-08 08:01:05,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-08 08:01:05,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-08 08:01:05,315 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-08 08:01:05,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-08 08:01:05,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-08 08:01:05,318 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-08 08:01:05,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-08 08:01:05,325 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-08 08:01:05,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-08 08:01:05,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-08 08:01:05,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-08 08:01:05,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-08 08:01:05,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-08 08:01:05,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-08 08:01:05,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-08 08:01:05,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-08 08:01:05,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-08 08:01:05,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-08 08:01:05,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-08 08:01:05,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-08 08:01:05,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-08 08:01:05,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-08 08:01:05,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-08 08:01:05,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-08 08:01:05,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-08 08:01:05,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-08 08:01:05,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-08 08:01:05,335 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf
[2022-04-08 08:01:05,341 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-08 08:01:05,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-08 08:01:05,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-08 08:01:05,342 INFO L138 SettingsManager]: * sizeof long=4
[2022-04-08 08:01:05,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-08 08:01:05,342 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-04-08 08:01:05,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-08 08:01:05,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-08 08:01:05,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-08 08:01:05,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-08 08:01:05,343 INFO L138 SettingsManager]: * sizeof long double=12
[2022-04-08 08:01:05,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-08 08:01:05,343 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-08 08:01:05,347 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-08 08:01:05,347 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-08 08:01:05,347 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-08 08:01:05,347 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-08 08:01:05,347 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-08 08:01:05,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 08:01:05,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-08 08:01:05,347 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-08 08:01:05,347 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-08 08:01:05,348 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-08 08:01:05,348 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-08 08:01:05,348 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN
[2022-04-08 08:01:05,348 INFO L138 SettingsManager]: * Use separate solver for trace checks=false
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN;
[2022-04-08 08:01:05,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-08 08:01:05,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-08 08:01:05,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-08 08:01:05,550 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-08 08:01:05,550 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-08 08:01:05,551 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound20.c
[2022-04-08 08:01:05,601 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1651822d/08031dbf9cfe4a8e86c25803a0feecb5/FLAG5ed63d7a1
[2022-04-08 08:01:05,951 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-08 08:01:05,952 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound20.c
[2022-04-08 08:01:05,956 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1651822d/08031dbf9cfe4a8e86c25803a0feecb5/FLAG5ed63d7a1
[2022-04-08 08:01:06,403 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1651822d/08031dbf9cfe4a8e86c25803a0feecb5
[2022-04-08 08:01:06,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-08 08:01:06,414 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-08 08:01:06,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-08 08:01:06,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-08 08:01:06,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-08 08:01:06,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:01:06" (1/1) ...
[2022-04-08 08:01:06,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4068d20a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:06, skipping insertion in model container
[2022-04-08 08:01:06,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:01:06" (1/1) ...
[2022-04-08 08:01:06,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-08 08:01:06,458 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-08 08:01:06,605 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_valuebound20.c[458,471]
[2022-04-08 08:01:06,654 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 08:01:06,659 INFO L203 MainTranslator]: Completed pre-run
[2022-04-08 08:01:06,683 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_valuebound20.c[458,471]
[2022-04-08 08:01:06,700 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 08:01:06,708 INFO L208 MainTranslator]: Completed translation
[2022-04-08 08:01:06,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:06 WrapperNode
[2022-04-08 08:01:06,708 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-08 08:01:06,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-08 08:01:06,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-08 08:01:06,709 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-08 08:01:06,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:06" (1/1) ...
[2022-04-08 08:01:06,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:06" (1/1) ...
[2022-04-08 08:01:06,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:06" (1/1) ...
[2022-04-08 08:01:06,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:06" (1/1) ...
[2022-04-08 08:01:06,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:06" (1/1) ...
[2022-04-08 08:01:06,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:06" (1/1) ...
[2022-04-08 08:01:06,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:06" (1/1) ...
[2022-04-08 08:01:06,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-08 08:01:06,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-08 08:01:06,757 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-08 08:01:06,757 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-08 08:01:06,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:06" (1/1) ...
[2022-04-08 08:01:06,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 08:01:06,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 08:01:06,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-04-08 08:01:06,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-04-08 08:01:06,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-08 08:01:06,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-08 08:01:06,841 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-08 08:01:06,841 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-08 08:01:06,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-08 08:01:06,841 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-08 08:01:06,841 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-08 08:01:06,841 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-08 08:01:06,841 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-08 08:01:06,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-08 08:01:06,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short
[2022-04-08 08:01:06,842 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-08 08:01:06,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-08 08:01:06,843 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-08 08:01:06,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-08 08:01:06,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-08 08:01:06,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-08 08:01:06,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-08 08:01:06,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-08 08:01:06,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-08 08:01:06,890 INFO L234 CfgBuilder]: Building ICFG
[2022-04-08 08:01:06,892 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-08 08:01:06,981 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-08 08:01:06,985 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-08 08:01:06,985 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-08 08:01:06,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:01:06 BoogieIcfgContainer
[2022-04-08 08:01:06,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-08 08:01:06,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-08 08:01:06,987 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-08 08:01:06,990 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-08 08:01:06,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:01:06" (1/3) ...
[2022-04-08 08:01:06,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f047a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:01:06, skipping insertion in model container
[2022-04-08 08:01:06,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:06" (2/3) ...
[2022-04-08 08:01:06,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f047a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:01:06, skipping insertion in model container
[2022-04-08 08:01:06,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:01:06" (3/3) ...
[2022-04-08 08:01:06,992 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound20.c
[2022-04-08 08:01:06,996 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-08 08:01:06,996 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-08 08:01:07,022 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-08 08:01:07,027 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP
[2022-04-08 08:01:07,027 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-08 08:01:07,042 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-08 08:01:07,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2022-04-08 08:01:07,046 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:01:07,047 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 08:01:07,047 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:01:07,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:01:07,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times
[2022-04-08 08:01:07,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:07,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [228776933]
[2022-04-08 08:01:07,079 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 08:01:07,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 2 times
[2022-04-08 08:01:07,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:01:07,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919434531]
[2022-04-08 08:01:07,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:01:07,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:01:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:01:07,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 08:01:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:01:07,241 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-08 08:01:07,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID
[2022-04-08 08:01:07,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID
[2022-04-08 08:01:07,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-08 08:01:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:01:07,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID
[2022-04-08 08:01:07,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID
[2022-04-08 08:01:07,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID
[2022-04-08 08:01:07,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID
[2022-04-08 08:01:07,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-04-08 08:01:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:01:07,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID
[2022-04-08 08:01:07,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID
[2022-04-08 08:01:07,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID
[2022-04-08 08:01:07,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID
[2022-04-08 08:01:07,280 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-08 08:01:07,280 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-08 08:01:07,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID
[2022-04-08 08:01:07,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID
[2022-04-08 08:01:07,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID
[2022-04-08 08:01:07,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID
[2022-04-08 08:01:07,281 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {32#true} is VALID
[2022-04-08 08:01:07,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID
[2022-04-08 08:01:07,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID
[2022-04-08 08:01:07,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID
[2022-04-08 08:01:07,282 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID
[2022-04-08 08:01:07,282 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-08 08:01:07,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID
[2022-04-08 08:01:07,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID
[2022-04-08 08:01:07,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID
[2022-04-08 08:01:07,283 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID
[2022-04-08 08:01:07,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID
[2022-04-08 08:01:07,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID
[2022-04-08 08:01:07,284 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-08 08:01:07,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID
[2022-04-08 08:01:07,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID
[2022-04-08 08:01:07,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID
[2022-04-08 08:01:07,284 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-08 08:01:07,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 08:01:07,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919434531]
[2022-04-08 08:01:07,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919434531] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:01:07,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:01:07,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 08:01:07,301 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 08:01:07,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [228776933]
[2022-04-08 08:01:07,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [228776933] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:01:07,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:01:07,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 08:01:07,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130101852]
[2022-04-08 08:01:07,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 08:01:07,306 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-08 08:01:07,307 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 08:01:07,309 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-08 08:01:07,344 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-08 08:01:07,345 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-08 08:01:07,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:07,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-08 08:01:07,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-08 08:01:07,369 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-08 08:01:07,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:07,643 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions.
[2022-04-08 08:01:07,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-08 08:01:07,643 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-08 08:01:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 08:01:07,644 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-08 08:01:07,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions.
[2022-04-08 08:01:07,650 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-08 08:01:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions.
[2022-04-08 08:01:07,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions.
[2022-04-08 08:01:07,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:07,731 INFO L225 Difference]: With dead ends: 51
[2022-04-08 08:01:07,731 INFO L226 Difference]: Without dead ends: 24
[2022-04-08 08:01:07,733 INFO L912 BasicCegarLoop]: 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-08 08:01:07,735 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time
[2022-04-08 08:01:07,736 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 08:01:07,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2022-04-08 08:01:07,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24.
[2022-04-08 08:01:07,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 08:01:07,755 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-08 08:01:07,756 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-08 08:01:07,756 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-08 08:01:07,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:07,758 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions.
[2022-04-08 08:01:07,759 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions.
[2022-04-08 08:01:07,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:07,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:07,759 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-08 08:01:07,759 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-08 08:01:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:07,761 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions.
[2022-04-08 08:01:07,761 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions.
[2022-04-08 08:01:07,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:07,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:07,783 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 08:01:07,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 08:01:07,784 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-08 08:01:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions.
[2022-04-08 08:01:07,810 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22
[2022-04-08 08:01:07,810 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 08:01:07,810 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions.
[2022-04-08 08:01:07,810 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (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-08 08:01:07,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions.
[2022-04-08 08:01:07,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions.
[2022-04-08 08:01:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2022-04-08 08:01:07,848 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:01:07,848 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 08:01:07,849 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-08 08:01:07,849 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:01:07,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:01:07,849 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times
[2022-04-08 08:01:07,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:07,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1603040856]
[2022-04-08 08:01:07,850 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 08:01:07,850 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 2 times
[2022-04-08 08:01:07,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:01:07,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802581882]
[2022-04-08 08:01:07,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:01:07,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:01:07,874 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 08:01:07,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [717764002]
[2022-04-08 08:01:07,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 08:01:07,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:01:07,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 08:01:07,876 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 08:01:07,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-04-08 08:01:07,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-08 08:01:07,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 08:01:07,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-08 08:01:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:01:07,942 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 08:01:08,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID
[2022-04-08 08:01:08,054 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-08 08:01:08,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID
[2022-04-08 08:01:08,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #63#return; {246#true} is VALID
[2022-04-08 08:01:08,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret5 := main(); {246#true} is VALID
[2022-04-08 08:01:08,055 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-08 08:01:08,055 INFO L272 TraceCheckUtils]: 6: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {246#true} is VALID
[2022-04-08 08:01:08,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID
[2022-04-08 08:01:08,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID
[2022-04-08 08:01:08,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#true} assume true; {246#true} is VALID
[2022-04-08 08:01:08,056 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#true} {246#true} #53#return; {246#true} is VALID
[2022-04-08 08:01:08,056 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-08 08:01:08,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID
[2022-04-08 08:01:08,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID
[2022-04-08 08:01:08,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} assume true; {246#true} is VALID
[2022-04-08 08:01:08,057 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {246#true} {246#true} #55#return; {246#true} is VALID
[2022-04-08 08:01:08,057 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-08 08:01:08,058 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-08 08:01:08,059 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-08 08:01:08,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 08:01:08,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {247#false} is VALID
[2022-04-08 08:01:08,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {247#false} assume !false; {247#false} is VALID
[2022-04-08 08:01:08,060 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-08 08:01:08,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-08 08:01:08,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 08:01:08,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802581882]
[2022-04-08 08:01:08,060 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 08:01:08,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717764002]
[2022-04-08 08:01:08,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717764002] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:01:08,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:01:08,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 08:01:08,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 08:01:08,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1603040856]
[2022-04-08 08:01:08,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1603040856] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:01:08,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:01:08,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 08:01:08,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167842073]
[2022-04-08 08:01:08,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 08:01:08,063 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-08 08:01:08,063 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 08:01:08,063 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-08 08:01:08,077 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-08 08:01:08,077 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-08 08:01:08,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:08,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-08 08:01:08,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-08 08:01:08,079 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-08 08:01:08,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:08,240 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions.
[2022-04-08 08:01:08,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-08 08:01:08,240 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-08 08:01:08,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 08:01:08,240 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-08 08:01:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions.
[2022-04-08 08:01:08,242 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-08 08:01:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions.
[2022-04-08 08:01:08,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions.
[2022-04-08 08:01:08,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:08,281 INFO L225 Difference]: With dead ends: 35
[2022-04-08 08:01:08,281 INFO L226 Difference]: Without dead ends: 31
[2022-04-08 08:01:08,281 INFO L912 BasicCegarLoop]: 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-08 08:01:08,282 INFO L913 BasicCegarLoop]: 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-08 08:01:08,283 INFO L914 BasicCegarLoop]: 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-08 08:01:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2022-04-08 08:01:08,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31.
[2022-04-08 08:01:08,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 08:01:08,291 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-08 08:01:08,292 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-08 08:01:08,292 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-08 08:01:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:08,293 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions.
[2022-04-08 08:01:08,294 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions.
[2022-04-08 08:01:08,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:08,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:08,294 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-08 08:01:08,295 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-08 08:01:08,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:08,296 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions.
[2022-04-08 08:01:08,296 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions.
[2022-04-08 08:01:08,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:08,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:08,297 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 08:01:08,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 08:01:08,297 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-08 08:01:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions.
[2022-04-08 08:01:08,298 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22
[2022-04-08 08:01:08,299 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 08:01:08,299 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions.
[2022-04-08 08:01:08,299 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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-08 08:01:08,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions.
[2022-04-08 08:01:08,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:08,332 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions.
[2022-04-08 08:01:08,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-08 08:01:08,333 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:01:08,333 INFO L499 BasicCegarLoop]: 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-08 08:01:08,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2022-04-08 08:01:08,569 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:01:08,570 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:01:08,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:01:08,570 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times
[2022-04-08 08:01:08,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:08,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [518468232]
[2022-04-08 08:01:08,571 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 08:01:08,571 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 2 times
[2022-04-08 08:01:08,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:01:08,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993384041]
[2022-04-08 08:01:08,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:01:08,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:01:08,586 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 08:01:08,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [423607105]
[2022-04-08 08:01:08,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 08:01:08,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:01:08,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 08:01:08,588 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 08:01:08,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-04-08 08:01:08,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 08:01:08,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 08:01:08,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core
[2022-04-08 08:01:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:01:08,640 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 08:01:08,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID
[2022-04-08 08:01:08,792 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-08 08:01:08,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID
[2022-04-08 08:01:08,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID
[2022-04-08 08:01:08,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID
[2022-04-08 08:01:08,793 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-08 08:01:08,793 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {512#true} is VALID
[2022-04-08 08:01:08,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID
[2022-04-08 08:01:08,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID
[2022-04-08 08:01:08,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID
[2022-04-08 08:01:08,793 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID
[2022-04-08 08:01:08,794 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-08 08:01:08,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID
[2022-04-08 08:01:08,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID
[2022-04-08 08:01:08,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID
[2022-04-08 08:01:08,794 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID
[2022-04-08 08:01:08,795 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-08 08:01:08,795 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-08 08:01:08,795 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-08 08:01:08,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID
[2022-04-08 08:01:08,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID
[2022-04-08 08:01:08,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID
[2022-04-08 08:01:08,796 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-08 08:01:08,797 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-08 08:01:08,798 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-08 08:01:08,799 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-08 08:01:08,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 08:01:08,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID
[2022-04-08 08:01:08,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID
[2022-04-08 08:01:08,801 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-08 08:01:08,801 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 08:01:08,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID
[2022-04-08 08:01:08,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID
[2022-04-08 08:01:08,966 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 08:01:08,967 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-08 08:01:08,968 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-08 08:01:09,048 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-08 08:01:09,049 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-08 08:01:09,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID
[2022-04-08 08:01:09,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID
[2022-04-08 08:01:09,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID
[2022-04-08 08:01:09,049 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-08 08:01:09,051 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-08 08:01:09,052 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-08 08:01:09,052 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID
[2022-04-08 08:01:09,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID
[2022-04-08 08:01:09,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID
[2022-04-08 08:01:09,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID
[2022-04-08 08:01:09,052 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-08 08:01:09,052 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID
[2022-04-08 08:01:09,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID
[2022-04-08 08:01:09,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID
[2022-04-08 08:01:09,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID
[2022-04-08 08:01:09,053 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {512#true} is VALID
[2022-04-08 08:01:09,053 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-08 08:01:09,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID
[2022-04-08 08:01:09,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID
[2022-04-08 08:01:09,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID
[2022-04-08 08:01:09,054 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-08 08:01:09,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID
[2022-04-08 08:01:09,054 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-08 08:01:09,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 08:01:09,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993384041]
[2022-04-08 08:01:09,055 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 08:01:09,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423607105]
[2022-04-08 08:01:09,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423607105] provided 1 perfect and 1 imperfect interpolant sequences
[2022-04-08 08:01:09,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-04-08 08:01:09,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7
[2022-04-08 08:01:09,055 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 08:01:09,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [518468232]
[2022-04-08 08:01:09,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [518468232] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:01:09,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:01:09,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 08:01:09,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392237276]
[2022-04-08 08:01:09,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 08:01:09,056 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-08 08:01:09,057 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 08:01:09,057 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-08 08:01:09,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:09,170 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-08 08:01:09,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:09,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-08 08:01:09,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2022-04-08 08:01:09,170 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-08 08:01:09,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:09,265 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions.
[2022-04-08 08:01:09,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-08 08:01:09,268 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-08 08:01:09,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 08:01:09,269 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-08 08:01:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions.
[2022-04-08 08:01:09,272 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-08 08:01:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions.
[2022-04-08 08:01:09,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions.
[2022-04-08 08:01:09,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:09,478 INFO L225 Difference]: With dead ends: 37
[2022-04-08 08:01:09,478 INFO L226 Difference]: Without dead ends: 33
[2022-04-08 08:01:09,478 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2022-04-08 08:01:09,479 INFO L913 BasicCegarLoop]: 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-08 08:01:09,479 INFO L914 BasicCegarLoop]: 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-08 08:01:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states.
[2022-04-08 08:01:09,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33.
[2022-04-08 08:01:09,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 08:01:09,498 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-08 08:01:09,498 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-08 08:01:09,499 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-08 08:01:09,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:09,513 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions.
[2022-04-08 08:01:09,513 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions.
[2022-04-08 08:01:09,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:09,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:09,513 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-08 08:01:09,514 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-08 08:01:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:09,515 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions.
[2022-04-08 08:01:09,515 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions.
[2022-04-08 08:01:09,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:09,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:09,515 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 08:01:09,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 08:01:09,516 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-08 08:01:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions.
[2022-04-08 08:01:09,517 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29
[2022-04-08 08:01:09,517 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 08:01:09,517 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions.
[2022-04-08 08:01:09,517 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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-08 08:01:09,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions.
[2022-04-08 08:01:09,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:09,744 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions.
[2022-04-08 08:01:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2022-04-08 08:01:09,745 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:01:09,745 INFO L499 BasicCegarLoop]: 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-08 08:01:09,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-04-08 08:01:09,945 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2022-04-08 08:01:09,945 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:01:09,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:01:09,946 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times
[2022-04-08 08:01:09,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:09,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [318128719]
[2022-04-08 08:01:09,946 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 08:01:09,947 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 2 times
[2022-04-08 08:01:09,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:01:09,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913317709]
[2022-04-08 08:01:09,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:01:09,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:01:09,965 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 08:01:09,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2062041187]
[2022-04-08 08:01:09,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 08:01:09,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:01:09,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 08:01:09,974 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 08:01:10,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2022-04-08 08:01:10,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 08:01:10,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 08:01:10,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core
[2022-04-08 08:01:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:01:10,056 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 08:01:10,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID
[2022-04-08 08:01:10,334 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-08 08:01:10,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID
[2022-04-08 08:01:10,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #63#return; {900#true} is VALID
[2022-04-08 08:01:10,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret5 := main(); {900#true} is VALID
[2022-04-08 08:01:10,334 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-08 08:01:10,334 INFO L272 TraceCheckUtils]: 6: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {900#true} is VALID
[2022-04-08 08:01:10,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID
[2022-04-08 08:01:10,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID
[2022-04-08 08:01:10,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#true} assume true; {900#true} is VALID
[2022-04-08 08:01:10,335 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#true} {900#true} #53#return; {900#true} is VALID
[2022-04-08 08:01:10,335 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-08 08:01:10,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID
[2022-04-08 08:01:10,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID
[2022-04-08 08:01:10,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {900#true} assume true; {900#true} is VALID
[2022-04-08 08:01:10,335 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {900#true} {900#true} #55#return; {900#true} is VALID
[2022-04-08 08:01:10,336 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-08 08:01:10,336 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-08 08:01:10,337 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-08 08:01:10,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID
[2022-04-08 08:01:10,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID
[2022-04-08 08:01:10,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {900#true} assume true; {900#true} is VALID
[2022-04-08 08:01:10,337 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-08 08:01:10,338 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-08 08:01:10,338 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-08 08:01:10,338 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-08 08:01:10,339 INFO L290 TraceCheckUtils]: 26: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID
[2022-04-08 08:01:10,339 INFO L290 TraceCheckUtils]: 27: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID
[2022-04-08 08:01:10,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {900#true} assume true; {900#true} is VALID
[2022-04-08 08:01:10,340 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-08 08:01:10,340 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-08 08:01:10,340 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-08 08:01:10,341 INFO L290 TraceCheckUtils]: 32: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID
[2022-04-08 08:01:10,341 INFO L290 TraceCheckUtils]: 33: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID
[2022-04-08 08:01:10,341 INFO L290 TraceCheckUtils]: 34: Hoare triple {900#true} assume true; {900#true} is VALID
[2022-04-08 08:01:10,341 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-08 08:01:10,342 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-08 08:01:10,343 INFO L290 TraceCheckUtils]: 37: Hoare triple {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1020#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 08:01:10,343 INFO L290 TraceCheckUtils]: 38: Hoare triple {1020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {901#false} is VALID
[2022-04-08 08:01:10,343 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#false} assume !false; {901#false} is VALID
[2022-04-08 08:01:10,343 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-08 08:01:10,343 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 08:01:10,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 08:01:10,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913317709]
[2022-04-08 08:01:10,656 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 08:01:10,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062041187]
[2022-04-08 08:01:10,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062041187] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 08:01:10,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-04-08 08:01:10,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2022-04-08 08:01:10,656 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 08:01:10,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [318128719]
[2022-04-08 08:01:10,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [318128719] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:01:10,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:01:10,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-04-08 08:01:10,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647700964]
[2022-04-08 08:01:10,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 08:01:10,664 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-08 08:01:10,666 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 08:01:10,666 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-08 08:01:10,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:10,699 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-04-08 08:01:10,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:10,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-04-08 08:01:10,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2022-04-08 08:01:10,701 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-08 08:01:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:10,895 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions.
[2022-04-08 08:01:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-04-08 08:01:10,895 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-08 08:01:10,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 08:01:10,895 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-08 08:01:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions.
[2022-04-08 08:01:10,897 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-08 08:01:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions.
[2022-04-08 08:01:10,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions.
[2022-04-08 08:01:10,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:10,923 INFO L225 Difference]: With dead ends: 42
[2022-04-08 08:01:10,923 INFO L226 Difference]: Without dead ends: 36
[2022-04-08 08:01:10,924 INFO L912 BasicCegarLoop]: 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-08 08:01:10,924 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time
[2022-04-08 08:01:10,925 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 08:01:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2022-04-08 08:01:10,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36.
[2022-04-08 08:01:10,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 08:01:10,944 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-08 08:01:10,944 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-08 08:01:10,946 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-08 08:01:10,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:10,949 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions.
[2022-04-08 08:01:10,949 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions.
[2022-04-08 08:01:10,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:10,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:10,952 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-08 08:01:10,953 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-08 08:01:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:10,958 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions.
[2022-04-08 08:01:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions.
[2022-04-08 08:01:10,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:10,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:10,958 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 08:01:10,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 08:01:10,958 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-08 08:01:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions.
[2022-04-08 08:01:10,960 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40
[2022-04-08 08:01:10,960 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 08:01:10,960 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions.
[2022-04-08 08:01:10,960 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (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-08 08:01:10,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 39 transitions.
[2022-04-08 08:01:11,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:11,116 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions.
[2022-04-08 08:01:11,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2022-04-08 08:01:11,117 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:01:11,117 INFO L499 BasicCegarLoop]: 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-08 08:01:11,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2022-04-08 08:01:11,317 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:01:11,318 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:01:11,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:01:11,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 3 times
[2022-04-08 08:01:11,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:11,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [914516364]
[2022-04-08 08:01:11,319 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 08:01:11,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 4 times
[2022-04-08 08:01:11,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:01:11,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248133309]
[2022-04-08 08:01:11,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:01:11,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:01:11,331 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 08:01:11,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1025373784]
[2022-04-08 08:01:11,332 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 08:01:11,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:01:11,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 08:01:11,333 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 08:01:11,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2022-04-08 08:01:11,364 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 08:01:11,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 08:01:11,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core
[2022-04-08 08:01:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:01:11,376 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 08:01:11,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {1315#true} call ULTIMATE.init(); {1315#true} is VALID
[2022-04-08 08:01:11,655 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-08 08:01:11,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {1315#true} assume true; {1315#true} is VALID
[2022-04-08 08:01:11,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1315#true} {1315#true} #63#return; {1315#true} is VALID
[2022-04-08 08:01:11,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {1315#true} call #t~ret5 := main(); {1315#true} is VALID
[2022-04-08 08:01:11,655 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-08 08:01:11,655 INFO L272 TraceCheckUtils]: 6: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {1315#true} is VALID
[2022-04-08 08:01:11,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID
[2022-04-08 08:01:11,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID
[2022-04-08 08:01:11,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {1315#true} assume true; {1315#true} is VALID
[2022-04-08 08:01:11,656 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1315#true} {1315#true} #53#return; {1315#true} is VALID
[2022-04-08 08:01:11,656 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-08 08:01:11,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID
[2022-04-08 08:01:11,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID
[2022-04-08 08:01:11,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {1315#true} assume true; {1315#true} is VALID
[2022-04-08 08:01:11,656 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1315#true} {1315#true} #55#return; {1315#true} is VALID
[2022-04-08 08:01:11,656 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-08 08:01:11,657 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-08 08:01:11,657 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-08 08:01:11,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID
[2022-04-08 08:01:11,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID
[2022-04-08 08:01:11,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {1315#true} assume true; {1315#true} is VALID
[2022-04-08 08:01:11,667 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-08 08:01:11,668 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-08 08:01:11,668 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-08 08:01:11,668 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-08 08:01:11,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID
[2022-04-08 08:01:11,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID
[2022-04-08 08:01:11,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {1315#true} assume true; {1315#true} is VALID
[2022-04-08 08:01:11,669 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-08 08:01:11,670 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-08 08:01:11,670 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-08 08:01:11,670 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-08 08:01:11,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID
[2022-04-08 08:01:11,670 INFO L290 TraceCheckUtils]: 34: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID
[2022-04-08 08:01:11,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {1315#true} assume true; {1315#true} is VALID
[2022-04-08 08:01:11,671 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-08 08:01:11,672 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-08 08:01:11,672 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-08 08:01:11,672 INFO L290 TraceCheckUtils]: 39: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID
[2022-04-08 08:01:11,672 INFO L290 TraceCheckUtils]: 40: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID
[2022-04-08 08:01:11,672 INFO L290 TraceCheckUtils]: 41: Hoare triple {1315#true} assume true; {1315#true} is VALID
[2022-04-08 08:01:11,672 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-08 08:01:11,673 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-08 08:01:11,673 INFO L290 TraceCheckUtils]: 44: Hoare triple {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1457#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 08:01:11,674 INFO L290 TraceCheckUtils]: 45: Hoare triple {1457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1316#false} is VALID
[2022-04-08 08:01:11,674 INFO L290 TraceCheckUtils]: 46: Hoare triple {1316#false} assume !false; {1316#false} is VALID
[2022-04-08 08:01:11,674 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-08 08:01:11,674 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 08:01:11,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 08:01:11,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248133309]
[2022-04-08 08:01:11,947 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 08:01:11,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025373784]
[2022-04-08 08:01:11,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025373784] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 08:01:11,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-04-08 08:01:11,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2022-04-08 08:01:11,948 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 08:01:11,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [914516364]
[2022-04-08 08:01:11,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [914516364] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:01:11,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:01:11,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-08 08:01:11,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851835421]
[2022-04-08 08:01:11,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 08:01:11,948 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-08 08:01:11,948 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 08:01:11,949 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-08 08:01:11,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:11,972 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-04-08 08:01:11,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:11,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-04-08 08:01:11,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-04-08 08:01:11,973 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-08 08:01:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:12,265 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions.
[2022-04-08 08:01:12,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-08 08:01:12,266 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-08 08:01:12,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 08:01:12,266 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-08 08:01:12,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions.
[2022-04-08 08:01:12,267 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-08 08:01:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions.
[2022-04-08 08:01:12,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions.
[2022-04-08 08:01:12,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:12,297 INFO L225 Difference]: With dead ends: 45
[2022-04-08 08:01:12,297 INFO L226 Difference]: Without dead ends: 39
[2022-04-08 08:01:12,298 INFO L912 BasicCegarLoop]: 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-08 08:01:12,299 INFO L913 BasicCegarLoop]: 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-08 08:01:12,300 INFO L914 BasicCegarLoop]: 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-08 08:01:12,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2022-04-08 08:01:12,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39.
[2022-04-08 08:01:12,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 08:01:12,328 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-08 08:01:12,328 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-08 08:01:12,328 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-08 08:01:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:12,329 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions.
[2022-04-08 08:01:12,329 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions.
[2022-04-08 08:01:12,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:12,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:12,329 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-08 08:01:12,330 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-08 08:01:12,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:12,331 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions.
[2022-04-08 08:01:12,331 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions.
[2022-04-08 08:01:12,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:12,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:12,331 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 08:01:12,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 08:01:12,331 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-08 08:01:12,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions.
[2022-04-08 08:01:12,332 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47
[2022-04-08 08:01:12,332 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 08:01:12,333 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions.
[2022-04-08 08:01:12,333 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (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-08 08:01:12,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 43 transitions.
[2022-04-08 08:01:12,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:12,419 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions.
[2022-04-08 08:01:12,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2022-04-08 08:01:12,420 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:01:12,420 INFO L499 BasicCegarLoop]: 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-08 08:01:12,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2022-04-08 08:01:12,620 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:01:12,621 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:01:12,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:01:12,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 5 times
[2022-04-08 08:01:12,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:12,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1998529304]
[2022-04-08 08:01:12,621 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 08:01:12,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 6 times
[2022-04-08 08:01:12,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:01:12,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252771465]
[2022-04-08 08:01:12,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:01:12,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:01:12,634 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 08:01:12,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [885521531]
[2022-04-08 08:01:12,634 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 08:01:12,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:01:12,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 08:01:12,639 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 08:01:12,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2022-04-08 08:01:12,745 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s)
[2022-04-08 08:01:12,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 08:01:12,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core
[2022-04-08 08:01:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:01:12,764 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 08:01:13,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {1770#true} call ULTIMATE.init(); {1770#true} is VALID
[2022-04-08 08:01:13,102 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-08 08:01:13,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2022-04-08 08:01:13,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1770#true} {1770#true} #63#return; {1770#true} is VALID
[2022-04-08 08:01:13,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {1770#true} call #t~ret5 := main(); {1770#true} is VALID
[2022-04-08 08:01:13,103 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-08 08:01:13,103 INFO L272 TraceCheckUtils]: 6: Hoare triple {1770#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {1770#true} is VALID
[2022-04-08 08:01:13,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID
[2022-04-08 08:01:13,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID
[2022-04-08 08:01:13,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2022-04-08 08:01:13,103 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1770#true} {1770#true} #53#return; {1770#true} is VALID
[2022-04-08 08:01:13,103 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-08 08:01:13,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID
[2022-04-08 08:01:13,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID
[2022-04-08 08:01:13,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2022-04-08 08:01:13,104 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1770#true} {1770#true} #55#return; {1770#true} is VALID
[2022-04-08 08:01:13,104 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-08 08:01:13,104 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-08 08:01:13,104 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-08 08:01:13,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID
[2022-04-08 08:01:13,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID
[2022-04-08 08:01:13,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2022-04-08 08:01:13,105 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-08 08:01:13,106 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-08 08:01:13,106 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-08 08:01:13,106 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-08 08:01:13,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID
[2022-04-08 08:01:13,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID
[2022-04-08 08:01:13,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2022-04-08 08:01:13,107 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-08 08:01:13,107 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-08 08:01:13,107 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-08 08:01:13,108 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-08 08:01:13,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID
[2022-04-08 08:01:13,108 INFO L290 TraceCheckUtils]: 34: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID
[2022-04-08 08:01:13,108 INFO L290 TraceCheckUtils]: 35: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2022-04-08 08:01:13,108 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-08 08:01:13,109 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-08 08:01:13,109 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-08 08:01:13,109 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-08 08:01:13,109 INFO L290 TraceCheckUtils]: 40: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID
[2022-04-08 08:01:13,110 INFO L290 TraceCheckUtils]: 41: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID
[2022-04-08 08:01:13,110 INFO L290 TraceCheckUtils]: 42: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2022-04-08 08:01:13,110 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-08 08:01:13,110 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-08 08:01:13,111 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-08 08:01:13,114 INFO L290 TraceCheckUtils]: 46: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID
[2022-04-08 08:01:13,115 INFO L290 TraceCheckUtils]: 47: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID
[2022-04-08 08:01:13,120 INFO L290 TraceCheckUtils]: 48: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2022-04-08 08:01:13,121 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-08 08:01:13,122 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-08 08:01:13,123 INFO L290 TraceCheckUtils]: 51: Hoare triple {1930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1934#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 08:01:13,123 INFO L290 TraceCheckUtils]: 52: Hoare triple {1934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1771#false} is VALID
[2022-04-08 08:01:13,123 INFO L290 TraceCheckUtils]: 53: Hoare triple {1771#false} assume !false; {1771#false} is VALID
[2022-04-08 08:01:13,124 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-08 08:01:13,124 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 08:01:13,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 08:01:13,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252771465]
[2022-04-08 08:01:13,397 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 08:01:13,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885521531]
[2022-04-08 08:01:13,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885521531] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 08:01:13,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-04-08 08:01:13,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2022-04-08 08:01:13,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 08:01:13,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1998529304]
[2022-04-08 08:01:13,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1998529304] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:01:13,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:01:13,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2022-04-08 08:01:13,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556444671]
[2022-04-08 08:01:13,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 08:01:13,398 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-08 08:01:13,398 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 08:01:13,398 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-08 08:01:13,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:13,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-04-08 08:01:13,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:13,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-04-08 08:01:13,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2022-04-08 08:01:13,429 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-08 08:01:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:13,749 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions.
[2022-04-08 08:01:13,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-04-08 08:01:13,749 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-08 08:01:13,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 08:01:13,749 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-08 08:01:13,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions.
[2022-04-08 08:01:13,751 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-08 08:01:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions.
[2022-04-08 08:01:13,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions.
[2022-04-08 08:01:13,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:13,788 INFO L225 Difference]: With dead ends: 48
[2022-04-08 08:01:13,788 INFO L226 Difference]: Without dead ends: 42
[2022-04-08 08:01:13,788 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182
[2022-04-08 08:01:13,789 INFO L913 BasicCegarLoop]: 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-08 08:01:13,789 INFO L914 BasicCegarLoop]: 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-08 08:01:13,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states.
[2022-04-08 08:01:13,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42.
[2022-04-08 08:01:13,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 08:01:13,807 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-08 08:01:13,808 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-08 08:01:13,808 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-08 08:01:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:13,809 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions.
[2022-04-08 08:01:13,809 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions.
[2022-04-08 08:01:13,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:13,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:13,809 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-08 08:01:13,810 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-08 08:01:13,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:13,811 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions.
[2022-04-08 08:01:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions.
[2022-04-08 08:01:13,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:13,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:13,811 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 08:01:13,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 08:01:13,811 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-08 08:01:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions.
[2022-04-08 08:01:13,812 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54
[2022-04-08 08:01:13,813 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 08:01:13,813 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions.
[2022-04-08 08:01:13,813 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (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-08 08:01:13,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 47 transitions.
[2022-04-08 08:01:13,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:13,907 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions.
[2022-04-08 08:01:13,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2022-04-08 08:01:13,908 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:01:13,908 INFO L499 BasicCegarLoop]: 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-08 08:01:13,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2022-04-08 08:01:14,127 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:01:14,127 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:01:14,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:01:14,128 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 7 times
[2022-04-08 08:01:14,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:14,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2066734295]
[2022-04-08 08:01:14,128 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 08:01:14,128 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 8 times
[2022-04-08 08:01:14,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:01:14,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757911688]
[2022-04-08 08:01:14,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:01:14,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:01:14,144 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 08:01:14,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [687145604]
[2022-04-08 08:01:14,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 08:01:14,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:01:14,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 08:01:14,147 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 08:01:14,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2022-04-08 08:01:14,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 08:01:14,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 08:01:14,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core
[2022-04-08 08:01:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:01:14,433 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 08:01:14,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {2265#true} call ULTIMATE.init(); {2265#true} is VALID
[2022-04-08 08:01:14,748 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-08 08:01:14,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {2265#true} assume true; {2265#true} is VALID
[2022-04-08 08:01:14,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2265#true} {2265#true} #63#return; {2265#true} is VALID
[2022-04-08 08:01:14,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {2265#true} call #t~ret5 := main(); {2265#true} is VALID
[2022-04-08 08:01:14,749 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-08 08:01:14,749 INFO L272 TraceCheckUtils]: 6: Hoare triple {2265#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {2265#true} is VALID
[2022-04-08 08:01:14,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID
[2022-04-08 08:01:14,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID
[2022-04-08 08:01:14,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {2265#true} assume true; {2265#true} is VALID
[2022-04-08 08:01:14,749 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2265#true} {2265#true} #53#return; {2265#true} is VALID
[2022-04-08 08:01:14,749 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-08 08:01:14,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID
[2022-04-08 08:01:14,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID
[2022-04-08 08:01:14,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {2265#true} assume true; {2265#true} is VALID
[2022-04-08 08:01:14,749 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2265#true} {2265#true} #55#return; {2265#true} is VALID
[2022-04-08 08:01:14,751 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-08 08:01:14,751 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-08 08:01:14,751 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-08 08:01:14,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID
[2022-04-08 08:01:14,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID
[2022-04-08 08:01:14,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {2265#true} assume true; {2265#true} is VALID
[2022-04-08 08:01:14,752 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-08 08:01:14,752 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-08 08:01:14,752 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-08 08:01:14,752 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-08 08:01:14,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID
[2022-04-08 08:01:14,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID
[2022-04-08 08:01:14,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {2265#true} assume true; {2265#true} is VALID
[2022-04-08 08:01:14,753 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-08 08:01:14,753 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-08 08:01:14,754 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-08 08:01:14,754 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-08 08:01:14,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID
[2022-04-08 08:01:14,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID
[2022-04-08 08:01:14,754 INFO L290 TraceCheckUtils]: 35: Hoare triple {2265#true} assume true; {2265#true} is VALID
[2022-04-08 08:01:14,754 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-08 08:01:14,755 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-08 08:01:14,755 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-08 08:01:14,755 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-08 08:01:14,755 INFO L290 TraceCheckUtils]: 40: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID
[2022-04-08 08:01:14,755 INFO L290 TraceCheckUtils]: 41: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID
[2022-04-08 08:01:14,755 INFO L290 TraceCheckUtils]: 42: Hoare triple {2265#true} assume true; {2265#true} is VALID
[2022-04-08 08:01:14,756 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-08 08:01:14,756 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-08 08:01:14,756 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-08 08:01:14,756 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-08 08:01:14,756 INFO L290 TraceCheckUtils]: 47: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID
[2022-04-08 08:01:14,758 INFO L290 TraceCheckUtils]: 48: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID
[2022-04-08 08:01:14,758 INFO L290 TraceCheckUtils]: 49: Hoare triple {2265#true} assume true; {2265#true} is VALID
[2022-04-08 08:01:14,759 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-08 08:01:14,759 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-08 08:01:14,760 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-08 08:01:14,760 INFO L290 TraceCheckUtils]: 53: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID
[2022-04-08 08:01:14,760 INFO L290 TraceCheckUtils]: 54: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID
[2022-04-08 08:01:14,760 INFO L290 TraceCheckUtils]: 55: Hoare triple {2265#true} assume true; {2265#true} is VALID
[2022-04-08 08:01:14,761 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-08 08:01:14,761 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-08 08:01:14,761 INFO L290 TraceCheckUtils]: 58: Hoare triple {2447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2451#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 08:01:14,762 INFO L290 TraceCheckUtils]: 59: Hoare triple {2451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2266#false} is VALID
[2022-04-08 08:01:14,762 INFO L290 TraceCheckUtils]: 60: Hoare triple {2266#false} assume !false; {2266#false} is VALID
[2022-04-08 08:01:14,763 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-08 08:01:14,763 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 08:01:14,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 08:01:14,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757911688]
[2022-04-08 08:01:14,989 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 08:01:14,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687145604]
[2022-04-08 08:01:14,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687145604] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 08:01:14,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-04-08 08:01:14,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2022-04-08 08:01:14,990 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 08:01:14,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2066734295]
[2022-04-08 08:01:14,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2066734295] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:01:14,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:01:14,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-04-08 08:01:14,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212598657]
[2022-04-08 08:01:14,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 08:01:14,992 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-08 08:01:14,992 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 08:01:14,992 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-08 08:01:15,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:15,014 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-04-08 08:01:15,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:15,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-04-08 08:01:15,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156
[2022-04-08 08:01:15,015 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-08 08:01:15,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:15,421 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions.
[2022-04-08 08:01:15,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-04-08 08:01:15,421 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-08 08:01:15,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 08:01:15,421 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-08 08:01:15,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions.
[2022-04-08 08:01:15,422 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-08 08:01:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions.
[2022-04-08 08:01:15,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions.
[2022-04-08 08:01:15,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:15,457 INFO L225 Difference]: With dead ends: 51
[2022-04-08 08:01:15,457 INFO L226 Difference]: Without dead ends: 45
[2022-04-08 08:01:15,457 INFO L912 BasicCegarLoop]: 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-08 08:01:15,457 INFO L913 BasicCegarLoop]: 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-08 08:01:15,458 INFO L914 BasicCegarLoop]: 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-08 08:01:15,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2022-04-08 08:01:15,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45.
[2022-04-08 08:01:15,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 08:01:15,478 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-08 08:01:15,478 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-08 08:01:15,478 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-08 08:01:15,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:15,480 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions.
[2022-04-08 08:01:15,480 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions.
[2022-04-08 08:01:15,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:15,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:15,480 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-08 08:01:15,481 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-08 08:01:15,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:15,494 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions.
[2022-04-08 08:01:15,494 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions.
[2022-04-08 08:01:15,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:15,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:15,494 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 08:01:15,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 08:01:15,495 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-08 08:01:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions.
[2022-04-08 08:01:15,496 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61
[2022-04-08 08:01:15,496 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 08:01:15,496 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions.
[2022-04-08 08:01:15,496 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (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-08 08:01:15,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 51 transitions.
[2022-04-08 08:01:15,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions.
[2022-04-08 08:01:15,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2022-04-08 08:01:15,589 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:01:15,589 INFO L499 BasicCegarLoop]: 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-08 08:01:15,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2022-04-08 08:01:15,790 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:01:15,790 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:01:15,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:01:15,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 9 times
[2022-04-08 08:01:15,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:15,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1221305054]
[2022-04-08 08:01:15,791 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 08:01:15,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 10 times
[2022-04-08 08:01:15,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:01:15,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130581742]
[2022-04-08 08:01:15,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:01:15,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:01:15,801 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 08:01:15,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [969254961]
[2022-04-08 08:01:15,802 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 08:01:15,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:01:15,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 08:01:15,804 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 08:01:15,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2022-04-08 08:01:15,845 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 08:01:15,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 08:01:15,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 28 conjunts are in the unsatisfiable core
[2022-04-08 08:01:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:01:15,858 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 08:01:16,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {2800#true} call ULTIMATE.init(); {2800#true} is VALID
[2022-04-08 08:01:16,314 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-08 08:01:16,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {2800#true} assume true; {2800#true} is VALID
[2022-04-08 08:01:16,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2800#true} {2800#true} #63#return; {2800#true} is VALID
[2022-04-08 08:01:16,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {2800#true} call #t~ret5 := main(); {2800#true} is VALID
[2022-04-08 08:01:16,314 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-08 08:01:16,314 INFO L272 TraceCheckUtils]: 6: Hoare triple {2800#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {2800#true} is VALID
[2022-04-08 08:01:16,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID
[2022-04-08 08:01:16,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID
[2022-04-08 08:01:16,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {2800#true} assume true; {2800#true} is VALID
[2022-04-08 08:01:16,315 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2800#true} {2800#true} #53#return; {2800#true} is VALID
[2022-04-08 08:01:16,315 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-08 08:01:16,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID
[2022-04-08 08:01:16,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID
[2022-04-08 08:01:16,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {2800#true} assume true; {2800#true} is VALID
[2022-04-08 08:01:16,315 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2800#true} {2800#true} #55#return; {2800#true} is VALID
[2022-04-08 08:01:16,315 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-08 08:01:16,316 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-08 08:01:16,316 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-08 08:01:16,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID
[2022-04-08 08:01:16,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID
[2022-04-08 08:01:16,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {2800#true} assume true; {2800#true} is VALID
[2022-04-08 08:01:16,321 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-08 08:01:16,321 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-08 08:01:16,321 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-08 08:01:16,322 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-08 08:01:16,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID
[2022-04-08 08:01:16,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID
[2022-04-08 08:01:16,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {2800#true} assume true; {2800#true} is VALID
[2022-04-08 08:01:16,322 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-08 08:01:16,323 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-08 08:01:16,323 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-08 08:01:16,323 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-08 08:01:16,323 INFO L290 TraceCheckUtils]: 33: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID
[2022-04-08 08:01:16,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID
[2022-04-08 08:01:16,323 INFO L290 TraceCheckUtils]: 35: Hoare triple {2800#true} assume true; {2800#true} is VALID
[2022-04-08 08:01:16,324 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-08 08:01:16,324 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-08 08:01:16,325 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-08 08:01:16,325 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-08 08:01:16,325 INFO L290 TraceCheckUtils]: 40: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID
[2022-04-08 08:01:16,325 INFO L290 TraceCheckUtils]: 41: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID
[2022-04-08 08:01:16,325 INFO L290 TraceCheckUtils]: 42: Hoare triple {2800#true} assume true; {2800#true} is VALID
[2022-04-08 08:01:16,325 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-08 08:01:16,326 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-08 08:01:16,326 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-08 08:01:16,326 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-08 08:01:16,326 INFO L290 TraceCheckUtils]: 47: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID
[2022-04-08 08:01:16,326 INFO L290 TraceCheckUtils]: 48: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID
[2022-04-08 08:01:16,327 INFO L290 TraceCheckUtils]: 49: Hoare triple {2800#true} assume true; {2800#true} is VALID
[2022-04-08 08:01:16,327 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-08 08:01:16,327 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-08 08:01:16,328 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-08 08:01:16,328 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-08 08:01:16,328 INFO L290 TraceCheckUtils]: 54: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID
[2022-04-08 08:01:16,328 INFO L290 TraceCheckUtils]: 55: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID
[2022-04-08 08:01:16,328 INFO L290 TraceCheckUtils]: 56: Hoare triple {2800#true} assume true; {2800#true} is VALID
[2022-04-08 08:01:16,329 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-08 08:01:16,331 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-08 08:01:16,332 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-08 08:01:16,333 INFO L290 TraceCheckUtils]: 60: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID
[2022-04-08 08:01:16,334 INFO L290 TraceCheckUtils]: 61: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID
[2022-04-08 08:01:16,334 INFO L290 TraceCheckUtils]: 62: Hoare triple {2800#true} assume true; {2800#true} is VALID
[2022-04-08 08:01:16,335 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-08 08:01:16,335 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-08 08:01:16,336 INFO L290 TraceCheckUtils]: 65: Hoare triple {3004#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3008#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 08:01:16,336 INFO L290 TraceCheckUtils]: 66: Hoare triple {3008#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2801#false} is VALID
[2022-04-08 08:01:16,336 INFO L290 TraceCheckUtils]: 67: Hoare triple {2801#false} assume !false; {2801#false} is VALID
[2022-04-08 08:01:16,336 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-08 08:01:16,336 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 08:01:16,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 08:01:16,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130581742]
[2022-04-08 08:01:16,610 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 08:01:16,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969254961]
[2022-04-08 08:01:16,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969254961] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 08:01:16,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-04-08 08:01:16,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2022-04-08 08:01:16,610 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 08:01:16,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1221305054]
[2022-04-08 08:01:16,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1221305054] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:01:16,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:01:16,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-04-08 08:01:16,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423616326]
[2022-04-08 08:01:16,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 08:01:16,611 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-08 08:01:16,612 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 08:01:16,612 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-08 08:01:16,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-08 08:01:16,636 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-04-08 08:01:16,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:16,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-04-08 08:01:16,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182
[2022-04-08 08:01:16,637 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-08 08:01:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:17,097 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions.
[2022-04-08 08:01:17,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2022-04-08 08:01:17,097 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-08 08:01:17,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 08:01:17,097 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-08 08:01:17,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions.
[2022-04-08 08:01:17,099 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-08 08:01:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions.
[2022-04-08 08:01:17,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions.
[2022-04-08 08:01:17,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:17,142 INFO L225 Difference]: With dead ends: 54
[2022-04-08 08:01:17,142 INFO L226 Difference]: Without dead ends: 48
[2022-04-08 08:01:17,143 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240
[2022-04-08 08:01:17,143 INFO L913 BasicCegarLoop]: 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-08 08:01:17,143 INFO L914 BasicCegarLoop]: 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-08 08:01:17,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2022-04-08 08:01:17,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2022-04-08 08:01:17,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 08:01:17,167 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-08 08:01:17,167 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-08 08:01:17,168 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-08 08:01:17,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:17,169 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions.
[2022-04-08 08:01:17,169 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions.
[2022-04-08 08:01:17,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:17,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:17,169 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-08 08:01:17,170 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-08 08:01:17,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:17,171 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions.
[2022-04-08 08:01:17,171 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions.
[2022-04-08 08:01:17,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:17,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:17,171 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 08:01:17,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 08:01:17,171 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-08 08:01:17,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions.
[2022-04-08 08:01:17,172 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68
[2022-04-08 08:01:17,173 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 08:01:17,173 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions.
[2022-04-08 08:01:17,173 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (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-08 08:01:17,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 55 transitions.
[2022-04-08 08:01:17,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions.
[2022-04-08 08:01:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2022-04-08 08:01:17,282 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:01:17,282 INFO L499 BasicCegarLoop]: 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-08 08:01:17,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2022-04-08 08:01:17,482 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:01:17,482 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:01:17,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:01:17,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 11 times
[2022-04-08 08:01:17,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:17,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1907202256]
[2022-04-08 08:01:17,483 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 08:01:17,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 12 times
[2022-04-08 08:01:17,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:01:17,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099120494]
[2022-04-08 08:01:17,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:01:17,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:01:17,494 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 08:01:17,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1273017332]
[2022-04-08 08:01:17,494 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 08:01:17,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:01:17,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 08:01:17,495 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 08:01:17,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2022-04-08 08:01:17,819 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s)
[2022-04-08 08:01:17,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 08:01:17,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjunts are in the unsatisfiable core
[2022-04-08 08:01:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:01:17,834 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 08:01:18,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {3375#true} call ULTIMATE.init(); {3375#true} is VALID
[2022-04-08 08:01:18,349 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-08 08:01:18,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {3375#true} assume true; {3375#true} is VALID
[2022-04-08 08:01:18,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3375#true} {3375#true} #63#return; {3375#true} is VALID
[2022-04-08 08:01:18,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {3375#true} call #t~ret5 := main(); {3375#true} is VALID
[2022-04-08 08:01:18,350 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-08 08:01:18,350 INFO L272 TraceCheckUtils]: 6: Hoare triple {3375#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {3375#true} is VALID
[2022-04-08 08:01:18,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID
[2022-04-08 08:01:18,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID
[2022-04-08 08:01:18,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {3375#true} assume true; {3375#true} is VALID
[2022-04-08 08:01:18,350 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3375#true} {3375#true} #53#return; {3375#true} is VALID
[2022-04-08 08:01:18,350 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-08 08:01:18,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID
[2022-04-08 08:01:18,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID
[2022-04-08 08:01:18,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {3375#true} assume true; {3375#true} is VALID
[2022-04-08 08:01:18,350 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3375#true} {3375#true} #55#return; {3375#true} is VALID
[2022-04-08 08:01:18,351 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-08 08:01:18,351 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-08 08:01:18,351 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-08 08:01:18,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID
[2022-04-08 08:01:18,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID
[2022-04-08 08:01:18,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {3375#true} assume true; {3375#true} is VALID
[2022-04-08 08:01:18,352 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-08 08:01:18,352 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-08 08:01:18,352 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-08 08:01:18,353 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-08 08:01:18,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID
[2022-04-08 08:01:18,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID
[2022-04-08 08:01:18,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {3375#true} assume true; {3375#true} is VALID
[2022-04-08 08:01:18,353 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-08 08:01:18,354 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-08 08:01:18,354 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-08 08:01:18,354 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-08 08:01:18,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID
[2022-04-08 08:01:18,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID
[2022-04-08 08:01:18,354 INFO L290 TraceCheckUtils]: 35: Hoare triple {3375#true} assume true; {3375#true} is VALID
[2022-04-08 08:01:18,355 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-08 08:01:18,355 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) (< main_~c~0 (+ main_~k~0 1)))} is VALID
[2022-04-08 08:01:18,356 INFO L290 TraceCheckUtils]: 38: Hoare triple {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)))} is VALID
[2022-04-08 08:01:18,356 INFO L272 TraceCheckUtils]: 39: Hoare triple {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3375#true} is VALID
[2022-04-08 08:01:18,356 INFO L290 TraceCheckUtils]: 40: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID
[2022-04-08 08:01:18,356 INFO L290 TraceCheckUtils]: 41: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID
[2022-04-08 08:01:18,356 INFO L290 TraceCheckUtils]: 42: Hoare triple {3375#true} assume true; {3375#true} is VALID
[2022-04-08 08:01:18,356 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3375#true} {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)))} #57#return; {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)))} is VALID
[2022-04-08 08:01:18,357 INFO L290 TraceCheckUtils]: 44: Hoare triple {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3516#(and (= main_~y~0 4) (= main_~c~0 4) (< 2 main_~k~0))} is VALID
[2022-04-08 08:01:18,357 INFO L290 TraceCheckUtils]: 45: Hoare triple {3516#(and (= main_~y~0 4) (= main_~c~0 4) (< 2 main_~k~0))} assume !false; {3516#(and (= main_~y~0 4) (= main_~c~0 4) (< 2 main_~k~0))} is VALID
[2022-04-08 08:01:18,357 INFO L272 TraceCheckUtils]: 46: Hoare triple {3516#(and (= main_~y~0 4) (= main_~c~0 4) (< 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)); {3375#true} is VALID
[2022-04-08 08:01:18,357 INFO L290 TraceCheckUtils]: 47: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID
[2022-04-08 08:01:18,357 INFO L290 TraceCheckUtils]: 48: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID
[2022-04-08 08:01:18,357 INFO L290 TraceCheckUtils]: 49: Hoare triple {3375#true} assume true; {3375#true} is VALID
[2022-04-08 08:01:18,358 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3375#true} {3516#(and (= main_~y~0 4) (= main_~c~0 4) (< 2 main_~k~0))} #57#return; {3516#(and (= main_~y~0 4) (= main_~c~0 4) (< 2 main_~k~0))} is VALID
[2022-04-08 08:01:18,358 INFO L290 TraceCheckUtils]: 51: Hoare triple {3516#(and (= main_~y~0 4) (= main_~c~0 4) (< 2 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3538#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID
[2022-04-08 08:01:18,359 INFO L290 TraceCheckUtils]: 52: Hoare triple {3538#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} assume !false; {3538#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID
[2022-04-08 08:01:18,359 INFO L272 TraceCheckUtils]: 53: Hoare triple {3538#(and (= 5 main_~c~0) (= 5 main_~y~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)); {3375#true} is VALID
[2022-04-08 08:01:18,359 INFO L290 TraceCheckUtils]: 54: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID
[2022-04-08 08:01:18,359 INFO L290 TraceCheckUtils]: 55: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID
[2022-04-08 08:01:18,359 INFO L290 TraceCheckUtils]: 56: Hoare triple {3375#true} assume true; {3375#true} is VALID
[2022-04-08 08:01:18,359 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3375#true} {3538#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} #57#return; {3538#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID
[2022-04-08 08:01:18,360 INFO L290 TraceCheckUtils]: 58: Hoare triple {3538#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID
[2022-04-08 08:01:18,360 INFO L290 TraceCheckUtils]: 59: Hoare triple {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID
[2022-04-08 08:01:18,360 INFO L272 TraceCheckUtils]: 60: Hoare triple {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3375#true} is VALID
[2022-04-08 08:01:18,360 INFO L290 TraceCheckUtils]: 61: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID
[2022-04-08 08:01:18,360 INFO L290 TraceCheckUtils]: 62: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID
[2022-04-08 08:01:18,360 INFO L290 TraceCheckUtils]: 63: Hoare triple {3375#true} assume true; {3375#true} is VALID
[2022-04-08 08:01:18,361 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3375#true} {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #57#return; {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID
[2022-04-08 08:01:18,361 INFO L290 TraceCheckUtils]: 65: Hoare triple {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID
[2022-04-08 08:01:18,361 INFO L272 TraceCheckUtils]: 66: Hoare triple {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3375#true} is VALID
[2022-04-08 08:01:18,361 INFO L290 TraceCheckUtils]: 67: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID
[2022-04-08 08:01:18,361 INFO L290 TraceCheckUtils]: 68: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID
[2022-04-08 08:01:18,361 INFO L290 TraceCheckUtils]: 69: Hoare triple {3375#true} assume true; {3375#true} is VALID
[2022-04-08 08:01:18,362 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3375#true} {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #59#return; {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID
[2022-04-08 08:01:18,362 INFO L272 TraceCheckUtils]: 71: Hoare triple {3582#(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)); {3601#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 08:01:18,363 INFO L290 TraceCheckUtils]: 72: Hoare triple {3601#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3605#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 08:01:18,363 INFO L290 TraceCheckUtils]: 73: Hoare triple {3605#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3376#false} is VALID
[2022-04-08 08:01:18,363 INFO L290 TraceCheckUtils]: 74: Hoare triple {3376#false} assume !false; {3376#false} is VALID
[2022-04-08 08:01:18,363 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked.
[2022-04-08 08:01:18,364 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 08:01:18,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 08:01:18,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099120494]
[2022-04-08 08:01:18,824 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 08:01:18,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273017332]
[2022-04-08 08:01:18,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273017332] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 08:01:18,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-04-08 08:01:18,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2022-04-08 08:01:18,827 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 08:01:18,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1907202256]
[2022-04-08 08:01:18,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1907202256] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:01:18,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:01:18,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2022-04-08 08:01:18,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849961533]
[2022-04-08 08:01:18,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 08:01:18,830 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75
[2022-04-08 08:01:18,830 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 08:01:18,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11)
[2022-04-08 08:01:18,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:18,866 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-04-08 08:01:18,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:18,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-04-08 08:01:18,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306
[2022-04-08 08:01:18,866 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11)
[2022-04-08 08:01:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:19,521 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions.
[2022-04-08 08:01:19,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-04-08 08:01:19,522 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75
[2022-04-08 08:01:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 08:01:19,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11)
[2022-04-08 08:01:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions.
[2022-04-08 08:01:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11)
[2022-04-08 08:01:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions.
[2022-04-08 08:01:19,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 62 transitions.
[2022-04-08 08:01:19,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:19,573 INFO L225 Difference]: With dead ends: 57
[2022-04-08 08:01:19,573 INFO L226 Difference]: Without dead ends: 51
[2022-04-08 08:01:19,573 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380
[2022-04-08 08:01:19,574 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-04-08 08:01:19,574 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 304 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-04-08 08:01:19,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2022-04-08 08:01:19,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2022-04-08 08:01:19,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 08:01:19,637 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-08 08:01:19,638 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-08 08:01:19,638 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-08 08:01:19,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:19,645 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions.
[2022-04-08 08:01:19,645 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions.
[2022-04-08 08:01:19,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:19,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:19,645 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-08 08:01:19,645 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-08 08:01:19,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:19,648 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions.
[2022-04-08 08:01:19,648 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions.
[2022-04-08 08:01:19,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:19,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:19,648 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 08:01:19,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 08:01:19,648 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-08 08:01:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions.
[2022-04-08 08:01:19,649 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 75
[2022-04-08 08:01:19,650 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 08:01:19,650 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions.
[2022-04-08 08:01:19,650 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11)
[2022-04-08 08:01:19,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 59 transitions.
[2022-04-08 08:01:19,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:19,780 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions.
[2022-04-08 08:01:19,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2022-04-08 08:01:19,781 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:01:19,781 INFO L499 BasicCegarLoop]: 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-08 08:01:19,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2022-04-08 08:01:19,981 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8
[2022-04-08 08:01:19,981 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:01:19,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:01:19,982 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 13 times
[2022-04-08 08:01:19,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:19,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2057720055]
[2022-04-08 08:01:19,982 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 08:01:19,982 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 14 times
[2022-04-08 08:01:19,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:01:19,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038086173]
[2022-04-08 08:01:19,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:01:19,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:01:20,007 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 08:01:20,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [173683328]
[2022-04-08 08:01:20,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 08:01:20,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:01:20,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 08:01:20,019 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 08:01:20,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2022-04-08 08:01:20,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 08:01:20,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 08:01:20,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjunts are in the unsatisfiable core
[2022-04-08 08:01:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:01:20,767 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 08:01:21,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {4056#true} call ULTIMATE.init(); {4056#true} is VALID
[2022-04-08 08:01:21,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {4056#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); {4056#true} is VALID
[2022-04-08 08:01:21,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {4056#true} assume true; {4056#true} is VALID
[2022-04-08 08:01:21,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4056#true} {4056#true} #63#return; {4056#true} is VALID
[2022-04-08 08:01:21,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {4056#true} call #t~ret5 := main(); {4056#true} is VALID
[2022-04-08 08:01:21,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {4056#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; {4056#true} is VALID
[2022-04-08 08:01:21,247 INFO L272 TraceCheckUtils]: 6: Hoare triple {4056#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {4056#true} is VALID
[2022-04-08 08:01:21,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {4056#true} ~cond := #in~cond; {4056#true} is VALID
[2022-04-08 08:01:21,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {4056#true} assume !(0 == ~cond); {4056#true} is VALID
[2022-04-08 08:01:21,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {4056#true} assume true; {4056#true} is VALID
[2022-04-08 08:01:21,248 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4056#true} {4056#true} #53#return; {4056#true} is VALID
[2022-04-08 08:01:21,248 INFO L272 TraceCheckUtils]: 11: Hoare triple {4056#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4056#true} is VALID
[2022-04-08 08:01:21,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {4056#true} ~cond := #in~cond; {4056#true} is VALID
[2022-04-08 08:01:21,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {4056#true} assume !(0 == ~cond); {4056#true} is VALID
[2022-04-08 08:01:21,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {4056#true} assume true; {4056#true} is VALID
[2022-04-08 08:01:21,248 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4056#true} {4056#true} #55#return; {4056#true} is VALID
[2022-04-08 08:01:21,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {4056#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4109#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 08:01:21,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {4109#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4109#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 08:01:21,249 INFO L272 TraceCheckUtils]: 18: Hoare triple {4109#(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)); {4056#true} is VALID
[2022-04-08 08:01:21,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {4056#true} ~cond := #in~cond; {4056#true} is VALID
[2022-04-08 08:01:21,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {4056#true} assume !(0 == ~cond); {4056#true} is VALID
[2022-04-08 08:01:21,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {4056#true} assume true; {4056#true} is VALID
[2022-04-08 08:01:21,249 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4056#true} {4109#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4109#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 08:01:21,250 INFO L290 TraceCheckUtils]: 23: Hoare triple {4109#(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; {4131#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID
[2022-04-08 08:01:21,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {4131#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {4131#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID
[2022-04-08 08:01:21,250 INFO L272 TraceCheckUtils]: 25: Hoare triple {4131#(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)); {4056#true} is VALID
[2022-04-08 08:01:21,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {4056#true} ~cond := #in~cond; {4056#true} is VALID
[2022-04-08 08:01:21,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {4056#true} assume !(0 == ~cond); {4056#true} is VALID
[2022-04-08 08:01:21,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {4056#true} assume true; {4056#true} is VALID
[2022-04-08 08:01:21,251 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4056#true} {4131#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {4131#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID
[2022-04-08 08:01:21,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {4131#(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; {4153#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID
[2022-04-08 08:01:21,252 INFO L290 TraceCheckUtils]: 31: Hoare triple {4153#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {4153#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID
[2022-04-08 08:01:21,252 INFO L272 TraceCheckUtils]: 32: Hoare triple {4153#(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)); {4056#true} is VALID
[2022-04-08 08:01:21,252 INFO L290 TraceCheckUtils]: 33: Hoare triple {4056#true} ~cond := #in~cond; {4056#true} is VALID
[2022-04-08 08:01:21,252 INFO L290 TraceCheckUtils]: 34: Hoare triple {4056#true} assume !(0 == ~cond); {4056#true} is VALID
[2022-04-08 08:01:21,252 INFO L290 TraceCheckUtils]: 35: Hoare triple {4056#true} assume true; {4056#true} is VALID
[2022-04-08 08:01:21,253 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4056#true} {4153#(and (= main_~y~0 2) (= main_~c~0 2))} #57#return; {4153#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID
[2022-04-08 08:01:21,253 INFO L290 TraceCheckUtils]: 37: Hoare triple {4153#(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; {4175#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID
[2022-04-08 08:01:21,253 INFO L290 TraceCheckUtils]: 38: Hoare triple {4175#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {4175#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID
[2022-04-08 08:01:21,253 INFO L272 TraceCheckUtils]: 39: Hoare triple {4175#(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)); {4056#true} is VALID
[2022-04-08 08:01:21,253 INFO L290 TraceCheckUtils]: 40: Hoare triple {4056#true} ~cond := #in~cond; {4056#true} is VALID
[2022-04-08 08:01:21,254 INFO L290 TraceCheckUtils]: 41: Hoare triple {4056#true} assume !(0 == ~cond); {4056#true} is VALID
[2022-04-08 08:01:21,254 INFO L290 TraceCheckUtils]: 42: Hoare triple {4056#true} assume true; {4056#true} is VALID
[2022-04-08 08:01:21,254 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4056#true} {4175#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #57#return; {4175#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID
[2022-04-08 08:01:21,254 INFO L290 TraceCheckUtils]: 44: Hoare triple {4175#(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; {4197#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID
[2022-04-08 08:01:21,255 INFO L290 TraceCheckUtils]: 45: Hoare triple {4197#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {4197#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID
[2022-04-08 08:01:21,255 INFO L272 TraceCheckUtils]: 46: Hoare triple {4197#(and (= main_~c~0 4) (= (+ (- 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)); {4056#true} is VALID
[2022-04-08 08:01:21,255 INFO L290 TraceCheckUtils]: 47: Hoare triple {4056#true} ~cond := #in~cond; {4056#true} is VALID
[2022-04-08 08:01:21,255 INFO L290 TraceCheckUtils]: 48: Hoare triple {4056#true} assume !(0 == ~cond); {4056#true} is VALID
[2022-04-08 08:01:21,257 INFO L290 TraceCheckUtils]: 49: Hoare triple {4056#true} assume true; {4056#true} is VALID
[2022-04-08 08:01:21,257 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4056#true} {4197#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #57#return; {4197#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID
[2022-04-08 08:01:21,258 INFO L290 TraceCheckUtils]: 51: Hoare triple {4197#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4219#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID
[2022-04-08 08:01:21,258 INFO L290 TraceCheckUtils]: 52: Hoare triple {4219#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} assume !false; {4219#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID
[2022-04-08 08:01:21,258 INFO L272 TraceCheckUtils]: 53: Hoare triple {4219#(and (= (+ main_~y~0 (- 3)) 2) (= 5 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)); {4056#true} is VALID
[2022-04-08 08:01:21,258 INFO L290 TraceCheckUtils]: 54: Hoare triple {4056#true} ~cond := #in~cond; {4056#true} is VALID
[2022-04-08 08:01:21,258 INFO L290 TraceCheckUtils]: 55: Hoare triple {4056#true} assume !(0 == ~cond); {4056#true} is VALID
[2022-04-08 08:01:21,258 INFO L290 TraceCheckUtils]: 56: Hoare triple {4056#true} assume true; {4056#true} is VALID
[2022-04-08 08:01:21,259 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4056#true} {4219#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} #57#return; {4219#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID
[2022-04-08 08:01:21,259 INFO L290 TraceCheckUtils]: 58: Hoare triple {4219#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4241#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} is VALID
[2022-04-08 08:01:21,259 INFO L290 TraceCheckUtils]: 59: Hoare triple {4241#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} assume !false; {4241#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} is VALID
[2022-04-08 08:01:21,259 INFO L272 TraceCheckUtils]: 60: Hoare triple {4241#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4056#true} is VALID
[2022-04-08 08:01:21,260 INFO L290 TraceCheckUtils]: 61: Hoare triple {4056#true} ~cond := #in~cond; {4056#true} is VALID
[2022-04-08 08:01:21,260 INFO L290 TraceCheckUtils]: 62: Hoare triple {4056#true} assume !(0 == ~cond); {4056#true} is VALID
[2022-04-08 08:01:21,260 INFO L290 TraceCheckUtils]: 63: Hoare triple {4056#true} assume true; {4056#true} is VALID
[2022-04-08 08:01:21,260 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4056#true} {4241#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} #57#return; {4241#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} is VALID
[2022-04-08 08:01:21,260 INFO L290 TraceCheckUtils]: 65: Hoare triple {4241#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4263#(and (<= main_~c~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} is VALID
[2022-04-08 08:01:21,261 INFO L290 TraceCheckUtils]: 66: Hoare triple {4263#(and (<= main_~c~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} assume !false; {4263#(and (<= main_~c~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} is VALID
[2022-04-08 08:01:21,261 INFO L272 TraceCheckUtils]: 67: Hoare triple {4263#(and (<= main_~c~0 7) (= 2 (+ main_~y~0 (- 5))) (< 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)); {4056#true} is VALID
[2022-04-08 08:01:21,261 INFO L290 TraceCheckUtils]: 68: Hoare triple {4056#true} ~cond := #in~cond; {4056#true} is VALID
[2022-04-08 08:01:21,261 INFO L290 TraceCheckUtils]: 69: Hoare triple {4056#true} assume !(0 == ~cond); {4056#true} is VALID
[2022-04-08 08:01:21,261 INFO L290 TraceCheckUtils]: 70: Hoare triple {4056#true} assume true; {4056#true} is VALID
[2022-04-08 08:01:21,262 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4056#true} {4263#(and (<= main_~c~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} #57#return; {4263#(and (<= main_~c~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} is VALID
[2022-04-08 08:01:21,262 INFO L290 TraceCheckUtils]: 72: Hoare triple {4263#(and (<= main_~c~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {4285#(and (<= main_~k~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} is VALID
[2022-04-08 08:01:21,262 INFO L272 TraceCheckUtils]: 73: Hoare triple {4285#(and (<= main_~k~0 7) (= 2 (+ main_~y~0 (- 5))) (< 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)); {4056#true} is VALID
[2022-04-08 08:01:21,262 INFO L290 TraceCheckUtils]: 74: Hoare triple {4056#true} ~cond := #in~cond; {4056#true} is VALID
[2022-04-08 08:01:21,262 INFO L290 TraceCheckUtils]: 75: Hoare triple {4056#true} assume !(0 == ~cond); {4056#true} is VALID
[2022-04-08 08:01:21,262 INFO L290 TraceCheckUtils]: 76: Hoare triple {4056#true} assume true; {4056#true} is VALID
[2022-04-08 08:01:21,263 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {4056#true} {4285#(and (<= main_~k~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} #59#return; {4285#(and (<= main_~k~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} is VALID
[2022-04-08 08:01:21,263 INFO L272 TraceCheckUtils]: 78: Hoare triple {4285#(and (<= main_~k~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4304#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 08:01:21,264 INFO L290 TraceCheckUtils]: 79: Hoare triple {4304#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4308#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 08:01:21,264 INFO L290 TraceCheckUtils]: 80: Hoare triple {4308#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4057#false} is VALID
[2022-04-08 08:01:21,264 INFO L290 TraceCheckUtils]: 81: Hoare triple {4057#false} assume !false; {4057#false} is VALID
[2022-04-08 08:01:21,265 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-08 08:01:21,265 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 08:01:21,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 08:01:21,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038086173]
[2022-04-08 08:01:21,555 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 08:01:21,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173683328]
[2022-04-08 08:01:21,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173683328] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 08:01:21,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-04-08 08:01:21,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13
[2022-04-08 08:01:21,555 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 08:01:21,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2057720055]
[2022-04-08 08:01:21,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2057720055] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:01:21,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:01:21,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2022-04-08 08:01:21,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354545118]
[2022-04-08 08:01:21,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 08:01:21,556 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-08 08:01:21,556 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 08:01:21,556 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-08 08:01:21,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:21,593 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-04-08 08:01:21,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:21,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-04-08 08:01:21,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240
[2022-04-08 08:01:21,594 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-08 08:01:22,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:22,317 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions.
[2022-04-08 08:01:22,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2022-04-08 08:01:22,317 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-08 08:01:22,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 08:01:22,318 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-08 08:01:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions.
[2022-04-08 08:01:22,320 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-08 08:01:22,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions.
[2022-04-08 08:01:22,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 66 transitions.
[2022-04-08 08:01:22,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:22,364 INFO L225 Difference]: With dead ends: 60
[2022-04-08 08:01:22,364 INFO L226 Difference]: Without dead ends: 54
[2022-04-08 08:01:22,364 INFO L912 BasicCegarLoop]: 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-08 08:01:22,365 INFO L913 BasicCegarLoop]: 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-08 08:01:22,365 INFO L914 BasicCegarLoop]: 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-08 08:01:22,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states.
[2022-04-08 08:01:22,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54.
[2022-04-08 08:01:22,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 08:01:22,399 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-08 08:01:22,399 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-08 08:01:22,399 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-08 08:01:22,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:22,400 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions.
[2022-04-08 08:01:22,400 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions.
[2022-04-08 08:01:22,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:22,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:22,401 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-08 08:01:22,401 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-08 08:01:22,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:22,402 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions.
[2022-04-08 08:01:22,402 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions.
[2022-04-08 08:01:22,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:22,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:22,402 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 08:01:22,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 08:01:22,402 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-08 08:01:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions.
[2022-04-08 08:01:22,403 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 82
[2022-04-08 08:01:22,403 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 08:01:22,404 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions.
[2022-04-08 08:01:22,404 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (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-08 08:01:22,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 63 transitions.
[2022-04-08 08:01:22,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions.
[2022-04-08 08:01:22,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2022-04-08 08:01:22,581 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:01:22,581 INFO L499 BasicCegarLoop]: 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-08 08:01:22,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2022-04-08 08:01:22,787 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2022-04-08 08:01:22,787 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:01:22,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:01:22,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 15 times
[2022-04-08 08:01:22,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:22,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [601834190]
[2022-04-08 08:01:22,788 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 08:01:22,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 16 times
[2022-04-08 08:01:22,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:01:22,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731150430]
[2022-04-08 08:01:22,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:01:22,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:01:22,800 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 08:01:22,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1854369882]
[2022-04-08 08:01:22,801 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 08:01:22,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:01:22,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 08:01:22,804 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 08:01:22,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2022-04-08 08:01:22,852 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 08:01:22,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 08:01:22,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 40 conjunts are in the unsatisfiable core
[2022-04-08 08:01:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:01:22,873 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 08:01:23,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {4711#true} call ULTIMATE.init(); {4711#true} is VALID
[2022-04-08 08:01:23,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {4711#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); {4711#true} is VALID
[2022-04-08 08:01:23,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {4711#true} assume true; {4711#true} is VALID
[2022-04-08 08:01:23,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4711#true} {4711#true} #63#return; {4711#true} is VALID
[2022-04-08 08:01:23,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {4711#true} call #t~ret5 := main(); {4711#true} is VALID
[2022-04-08 08:01:23,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {4711#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; {4711#true} is VALID
[2022-04-08 08:01:23,351 INFO L272 TraceCheckUtils]: 6: Hoare triple {4711#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {4711#true} is VALID
[2022-04-08 08:01:23,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {4711#true} ~cond := #in~cond; {4711#true} is VALID
[2022-04-08 08:01:23,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {4711#true} assume !(0 == ~cond); {4711#true} is VALID
[2022-04-08 08:01:23,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {4711#true} assume true; {4711#true} is VALID
[2022-04-08 08:01:23,351 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4711#true} {4711#true} #53#return; {4711#true} is VALID
[2022-04-08 08:01:23,351 INFO L272 TraceCheckUtils]: 11: Hoare triple {4711#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4711#true} is VALID
[2022-04-08 08:01:23,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {4711#true} ~cond := #in~cond; {4711#true} is VALID
[2022-04-08 08:01:23,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {4711#true} assume !(0 == ~cond); {4711#true} is VALID
[2022-04-08 08:01:23,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {4711#true} assume true; {4711#true} is VALID
[2022-04-08 08:01:23,351 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4711#true} {4711#true} #55#return; {4711#true} is VALID
[2022-04-08 08:01:23,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {4711#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4764#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 08:01:23,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {4764#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4764#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 08:01:23,352 INFO L272 TraceCheckUtils]: 18: Hoare triple {4764#(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)); {4711#true} is VALID
[2022-04-08 08:01:23,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {4711#true} ~cond := #in~cond; {4711#true} is VALID
[2022-04-08 08:01:23,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {4711#true} assume !(0 == ~cond); {4711#true} is VALID
[2022-04-08 08:01:23,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {4711#true} assume true; {4711#true} is VALID
[2022-04-08 08:01:23,353 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4711#true} {4764#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4764#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 08:01:23,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {4764#(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; {4786#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID
[2022-04-08 08:01:23,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {4786#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {4786#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID
[2022-04-08 08:01:23,353 INFO L272 TraceCheckUtils]: 25: Hoare triple {4786#(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)); {4711#true} is VALID
[2022-04-08 08:01:23,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {4711#true} ~cond := #in~cond; {4711#true} is VALID
[2022-04-08 08:01:23,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {4711#true} assume !(0 == ~cond); {4711#true} is VALID
[2022-04-08 08:01:23,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {4711#true} assume true; {4711#true} is VALID
[2022-04-08 08:01:23,354 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4711#true} {4786#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {4786#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID
[2022-04-08 08:01:23,354 INFO L290 TraceCheckUtils]: 30: Hoare triple {4786#(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; {4808#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID
[2022-04-08 08:01:23,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {4808#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {4808#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID
[2022-04-08 08:01:23,355 INFO L272 TraceCheckUtils]: 32: Hoare triple {4808#(and (= main_~y~0 2) (= 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)); {4711#true} is VALID
[2022-04-08 08:01:23,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {4711#true} ~cond := #in~cond; {4711#true} is VALID
[2022-04-08 08:01:23,355 INFO L290 TraceCheckUtils]: 34: Hoare triple {4711#true} assume !(0 == ~cond); {4711#true} is VALID
[2022-04-08 08:01:23,355 INFO L290 TraceCheckUtils]: 35: Hoare triple {4711#true} assume true; {4711#true} is VALID
[2022-04-08 08:01:23,355 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4711#true} {4808#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #57#return; {4808#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID
[2022-04-08 08:01:23,356 INFO L290 TraceCheckUtils]: 37: Hoare triple {4808#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4830#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID
[2022-04-08 08:01:23,357 INFO L290 TraceCheckUtils]: 38: Hoare triple {4830#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {4830#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID
[2022-04-08 08:01:23,357 INFO L272 TraceCheckUtils]: 39: Hoare triple {4830#(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)); {4711#true} is VALID
[2022-04-08 08:01:23,357 INFO L290 TraceCheckUtils]: 40: Hoare triple {4711#true} ~cond := #in~cond; {4711#true} is VALID
[2022-04-08 08:01:23,357 INFO L290 TraceCheckUtils]: 41: Hoare triple {4711#true} assume !(0 == ~cond); {4711#true} is VALID
[2022-04-08 08:01:23,357 INFO L290 TraceCheckUtils]: 42: Hoare triple {4711#true} assume true; {4711#true} is VALID
[2022-04-08 08:01:23,358 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4711#true} {4830#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #57#return; {4830#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID
[2022-04-08 08:01:23,358 INFO L290 TraceCheckUtils]: 44: Hoare triple {4830#(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; {4852#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID
[2022-04-08 08:01:23,358 INFO L290 TraceCheckUtils]: 45: Hoare triple {4852#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {4852#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID
[2022-04-08 08:01:23,358 INFO L272 TraceCheckUtils]: 46: Hoare triple {4852#(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)); {4711#true} is VALID
[2022-04-08 08:01:23,358 INFO L290 TraceCheckUtils]: 47: Hoare triple {4711#true} ~cond := #in~cond; {4711#true} is VALID
[2022-04-08 08:01:23,359 INFO L290 TraceCheckUtils]: 48: Hoare triple {4711#true} assume !(0 == ~cond); {4711#true} is VALID
[2022-04-08 08:01:23,359 INFO L290 TraceCheckUtils]: 49: Hoare triple {4711#true} assume true; {4711#true} is VALID
[2022-04-08 08:01:23,359 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4711#true} {4852#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #57#return; {4852#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID
[2022-04-08 08:01:23,359 INFO L290 TraceCheckUtils]: 51: Hoare triple {4852#(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; {4874#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID
[2022-04-08 08:01:23,360 INFO L290 TraceCheckUtils]: 52: Hoare triple {4874#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {4874#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID
[2022-04-08 08:01:23,360 INFO L272 TraceCheckUtils]: 53: Hoare triple {4874#(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)); {4711#true} is VALID
[2022-04-08 08:01:23,360 INFO L290 TraceCheckUtils]: 54: Hoare triple {4711#true} ~cond := #in~cond; {4711#true} is VALID
[2022-04-08 08:01:23,361 INFO L290 TraceCheckUtils]: 55: Hoare triple {4711#true} assume !(0 == ~cond); {4711#true} is VALID
[2022-04-08 08:01:23,361 INFO L290 TraceCheckUtils]: 56: Hoare triple {4711#true} assume true; {4711#true} is VALID
[2022-04-08 08:01:23,361 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4711#true} {4874#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {4874#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID
[2022-04-08 08:01:23,362 INFO L290 TraceCheckUtils]: 58: Hoare triple {4874#(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; {4896#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID
[2022-04-08 08:01:23,362 INFO L290 TraceCheckUtils]: 59: Hoare triple {4896#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {4896#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID
[2022-04-08 08:01:23,362 INFO L272 TraceCheckUtils]: 60: Hoare triple {4896#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4711#true} is VALID
[2022-04-08 08:01:23,362 INFO L290 TraceCheckUtils]: 61: Hoare triple {4711#true} ~cond := #in~cond; {4711#true} is VALID
[2022-04-08 08:01:23,362 INFO L290 TraceCheckUtils]: 62: Hoare triple {4711#true} assume !(0 == ~cond); {4711#true} is VALID
[2022-04-08 08:01:23,362 INFO L290 TraceCheckUtils]: 63: Hoare triple {4711#true} assume true; {4711#true} is VALID
[2022-04-08 08:01:23,363 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4711#true} {4896#(and (= main_~y~0 6) (= main_~c~0 6))} #57#return; {4896#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID
[2022-04-08 08:01:23,363 INFO L290 TraceCheckUtils]: 65: Hoare triple {4896#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4918#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID
[2022-04-08 08:01:23,364 INFO L290 TraceCheckUtils]: 66: Hoare triple {4918#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !false; {4918#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID
[2022-04-08 08:01:23,364 INFO L272 TraceCheckUtils]: 67: Hoare triple {4918#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4711#true} is VALID
[2022-04-08 08:01:23,364 INFO L290 TraceCheckUtils]: 68: Hoare triple {4711#true} ~cond := #in~cond; {4711#true} is VALID
[2022-04-08 08:01:23,364 INFO L290 TraceCheckUtils]: 69: Hoare triple {4711#true} assume !(0 == ~cond); {4711#true} is VALID
[2022-04-08 08:01:23,364 INFO L290 TraceCheckUtils]: 70: Hoare triple {4711#true} assume true; {4711#true} is VALID
[2022-04-08 08:01:23,364 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4711#true} {4918#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #57#return; {4918#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID
[2022-04-08 08:01:23,365 INFO L290 TraceCheckUtils]: 72: Hoare triple {4918#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4940#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} is VALID
[2022-04-08 08:01:23,365 INFO L290 TraceCheckUtils]: 73: Hoare triple {4940#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} assume !false; {4940#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} is VALID
[2022-04-08 08:01:23,365 INFO L272 TraceCheckUtils]: 74: Hoare triple {4940#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4711#true} is VALID
[2022-04-08 08:01:23,365 INFO L290 TraceCheckUtils]: 75: Hoare triple {4711#true} ~cond := #in~cond; {4711#true} is VALID
[2022-04-08 08:01:23,365 INFO L290 TraceCheckUtils]: 76: Hoare triple {4711#true} assume !(0 == ~cond); {4711#true} is VALID
[2022-04-08 08:01:23,365 INFO L290 TraceCheckUtils]: 77: Hoare triple {4711#true} assume true; {4711#true} is VALID
[2022-04-08 08:01:23,366 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4711#true} {4940#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} #57#return; {4940#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} is VALID
[2022-04-08 08:01:23,366 INFO L290 TraceCheckUtils]: 79: Hoare triple {4940#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} assume !(~c~0 < ~k~0); {4962#(and (< 7 main_~k~0) (= (+ (- 2) main_~y~0) 6) (<= main_~k~0 8))} is VALID
[2022-04-08 08:01:23,367 INFO L272 TraceCheckUtils]: 80: Hoare triple {4962#(and (< 7 main_~k~0) (= (+ (- 2) main_~y~0) 6) (<= 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)); {4711#true} is VALID
[2022-04-08 08:01:23,367 INFO L290 TraceCheckUtils]: 81: Hoare triple {4711#true} ~cond := #in~cond; {4711#true} is VALID
[2022-04-08 08:01:23,367 INFO L290 TraceCheckUtils]: 82: Hoare triple {4711#true} assume !(0 == ~cond); {4711#true} is VALID
[2022-04-08 08:01:23,367 INFO L290 TraceCheckUtils]: 83: Hoare triple {4711#true} assume true; {4711#true} is VALID
[2022-04-08 08:01:23,367 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {4711#true} {4962#(and (< 7 main_~k~0) (= (+ (- 2) main_~y~0) 6) (<= main_~k~0 8))} #59#return; {4962#(and (< 7 main_~k~0) (= (+ (- 2) main_~y~0) 6) (<= main_~k~0 8))} is VALID
[2022-04-08 08:01:23,368 INFO L272 TraceCheckUtils]: 85: Hoare triple {4962#(and (< 7 main_~k~0) (= (+ (- 2) main_~y~0) 6) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4981#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 08:01:23,368 INFO L290 TraceCheckUtils]: 86: Hoare triple {4981#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4985#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 08:01:23,368 INFO L290 TraceCheckUtils]: 87: Hoare triple {4985#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4712#false} is VALID
[2022-04-08 08:01:23,368 INFO L290 TraceCheckUtils]: 88: Hoare triple {4712#false} assume !false; {4712#false} is VALID
[2022-04-08 08:01:23,369 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-08 08:01:23,369 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 08:01:23,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 08:01:23,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731150430]
[2022-04-08 08:01:23,655 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 08:01:23,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854369882]
[2022-04-08 08:01:23,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854369882] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 08:01:23,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-04-08 08:01:23,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14
[2022-04-08 08:01:23,655 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 08:01:23,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [601834190]
[2022-04-08 08:01:23,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [601834190] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:01:23,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:01:23,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2022-04-08 08:01:23,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564543654]
[2022-04-08 08:01:23,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 08:01:23,656 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-08 08:01:23,656 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 08:01:23,656 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-08 08:01:23,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:23,699 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2022-04-08 08:01:23,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:23,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2022-04-08 08:01:23,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272
[2022-04-08 08:01:23,700 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-08 08:01:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:24,461 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions.
[2022-04-08 08:01:24,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-04-08 08:01:24,462 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-08 08:01:24,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 08:01:24,462 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-08 08:01:24,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions.
[2022-04-08 08:01:24,465 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-08 08:01:24,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions.
[2022-04-08 08:01:24,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions.
[2022-04-08 08:01:24,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:24,537 INFO L225 Difference]: With dead ends: 63
[2022-04-08 08:01:24,537 INFO L226 Difference]: Without dead ends: 57
[2022-04-08 08:01:24,540 INFO L912 BasicCegarLoop]: 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-08 08:01:24,541 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time
[2022-04-08 08:01:24,541 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 394 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-04-08 08:01:24,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states.
[2022-04-08 08:01:24,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57.
[2022-04-08 08:01:24,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 08:01:24,574 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-08 08:01:24,575 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-08 08:01:24,577 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-08 08:01:24,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:24,578 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions.
[2022-04-08 08:01:24,578 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions.
[2022-04-08 08:01:24,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:24,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:24,580 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-08 08:01:24,580 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-08 08:01:24,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:24,585 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions.
[2022-04-08 08:01:24,585 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions.
[2022-04-08 08:01:24,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:24,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:24,585 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 08:01:24,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 08:01:24,585 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-08 08:01:24,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions.
[2022-04-08 08:01:24,586 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 89
[2022-04-08 08:01:24,586 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 08:01:24,586 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions.
[2022-04-08 08:01:24,586 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (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-08 08:01:24,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 67 transitions.
[2022-04-08 08:01:24,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:24,724 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions.
[2022-04-08 08:01:24,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-04-08 08:01:24,726 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:01:24,726 INFO L499 BasicCegarLoop]: 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-08 08:01:24,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2022-04-08 08:01:24,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2022-04-08 08:01:24,931 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:01:24,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:01:24,932 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 17 times
[2022-04-08 08:01:24,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:24,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2141221585]
[2022-04-08 08:01:24,932 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 08:01:24,932 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 18 times
[2022-04-08 08:01:24,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:01:24,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712910120]
[2022-04-08 08:01:24,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:01:24,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:01:24,959 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 08:01:24,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2080972146]
[2022-04-08 08:01:24,959 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 08:01:24,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:01:24,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 08:01:24,961 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 08:01:24,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2022-04-08 08:01:25,676 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s)
[2022-04-08 08:01:25,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 08:01:25,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 45 conjunts are in the unsatisfiable core
[2022-04-08 08:01:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:01:25,694 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 08:01:26,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {5406#true} call ULTIMATE.init(); {5406#true} is VALID
[2022-04-08 08:01:26,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {5406#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); {5406#true} is VALID
[2022-04-08 08:01:26,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {5406#true} assume true; {5406#true} is VALID
[2022-04-08 08:01:26,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5406#true} {5406#true} #63#return; {5406#true} is VALID
[2022-04-08 08:01:26,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {5406#true} call #t~ret5 := main(); {5406#true} is VALID
[2022-04-08 08:01:26,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {5406#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; {5406#true} is VALID
[2022-04-08 08:01:26,315 INFO L272 TraceCheckUtils]: 6: Hoare triple {5406#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {5406#true} is VALID
[2022-04-08 08:01:26,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {5406#true} ~cond := #in~cond; {5406#true} is VALID
[2022-04-08 08:01:26,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {5406#true} assume !(0 == ~cond); {5406#true} is VALID
[2022-04-08 08:01:26,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {5406#true} assume true; {5406#true} is VALID
[2022-04-08 08:01:26,315 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5406#true} {5406#true} #53#return; {5406#true} is VALID
[2022-04-08 08:01:26,315 INFO L272 TraceCheckUtils]: 11: Hoare triple {5406#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5406#true} is VALID
[2022-04-08 08:01:26,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {5406#true} ~cond := #in~cond; {5406#true} is VALID
[2022-04-08 08:01:26,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {5406#true} assume !(0 == ~cond); {5406#true} is VALID
[2022-04-08 08:01:26,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {5406#true} assume true; {5406#true} is VALID
[2022-04-08 08:01:26,315 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5406#true} {5406#true} #55#return; {5406#true} is VALID
[2022-04-08 08:01:26,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {5406#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5459#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 08:01:26,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {5459#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5459#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 08:01:26,323 INFO L272 TraceCheckUtils]: 18: Hoare triple {5459#(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)); {5406#true} is VALID
[2022-04-08 08:01:26,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {5406#true} ~cond := #in~cond; {5406#true} is VALID
[2022-04-08 08:01:26,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {5406#true} assume !(0 == ~cond); {5406#true} is VALID
[2022-04-08 08:01:26,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {5406#true} assume true; {5406#true} is VALID
[2022-04-08 08:01:26,324 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5406#true} {5459#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {5459#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 08:01:26,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {5459#(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; {5481#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID
[2022-04-08 08:01:26,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {5481#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {5481#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID
[2022-04-08 08:01:26,325 INFO L272 TraceCheckUtils]: 25: Hoare triple {5481#(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)); {5406#true} is VALID
[2022-04-08 08:01:26,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {5406#true} ~cond := #in~cond; {5406#true} is VALID
[2022-04-08 08:01:26,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {5406#true} assume !(0 == ~cond); {5406#true} is VALID
[2022-04-08 08:01:26,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {5406#true} assume true; {5406#true} is VALID
[2022-04-08 08:01:26,326 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5406#true} {5481#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {5481#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID
[2022-04-08 08:01:26,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {5481#(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; {5503#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID
[2022-04-08 08:01:26,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {5503#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {5503#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID
[2022-04-08 08:01:26,326 INFO L272 TraceCheckUtils]: 32: Hoare triple {5503#(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)); {5406#true} is VALID
[2022-04-08 08:01:26,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {5406#true} ~cond := #in~cond; {5406#true} is VALID
[2022-04-08 08:01:26,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {5406#true} assume !(0 == ~cond); {5406#true} is VALID
[2022-04-08 08:01:26,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {5406#true} assume true; {5406#true} is VALID
[2022-04-08 08:01:26,327 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5406#true} {5503#(and (= main_~y~0 2) (= main_~c~0 2))} #57#return; {5503#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID
[2022-04-08 08:01:26,327 INFO L290 TraceCheckUtils]: 37: Hoare triple {5503#(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; {5525#(and (= main_~y~0 3) (< 2 main_~k~0) (= main_~c~0 3))} is VALID
[2022-04-08 08:01:26,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {5525#(and (= main_~y~0 3) (< 2 main_~k~0) (= main_~c~0 3))} assume !false; {5525#(and (= main_~y~0 3) (< 2 main_~k~0) (= main_~c~0 3))} is VALID
[2022-04-08 08:01:26,328 INFO L272 TraceCheckUtils]: 39: Hoare triple {5525#(and (= main_~y~0 3) (< 2 main_~k~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)); {5406#true} is VALID
[2022-04-08 08:01:26,328 INFO L290 TraceCheckUtils]: 40: Hoare triple {5406#true} ~cond := #in~cond; {5406#true} is VALID
[2022-04-08 08:01:26,328 INFO L290 TraceCheckUtils]: 41: Hoare triple {5406#true} assume !(0 == ~cond); {5406#true} is VALID
[2022-04-08 08:01:26,328 INFO L290 TraceCheckUtils]: 42: Hoare triple {5406#true} assume true; {5406#true} is VALID
[2022-04-08 08:01:26,328 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5406#true} {5525#(and (= main_~y~0 3) (< 2 main_~k~0) (= main_~c~0 3))} #57#return; {5525#(and (= main_~y~0 3) (< 2 main_~k~0) (= main_~c~0 3))} is VALID
[2022-04-08 08:01:26,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {5525#(and (= main_~y~0 3) (< 2 main_~k~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; {5547#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 2 main_~k~0))} is VALID
[2022-04-08 08:01:26,329 INFO L290 TraceCheckUtils]: 45: Hoare triple {5547#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 2 main_~k~0))} assume !false; {5547#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 2 main_~k~0))} is VALID
[2022-04-08 08:01:26,329 INFO L272 TraceCheckUtils]: 46: Hoare triple {5547#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 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)); {5406#true} is VALID
[2022-04-08 08:01:26,329 INFO L290 TraceCheckUtils]: 47: Hoare triple {5406#true} ~cond := #in~cond; {5406#true} is VALID
[2022-04-08 08:01:26,329 INFO L290 TraceCheckUtils]: 48: Hoare triple {5406#true} assume !(0 == ~cond); {5406#true} is VALID
[2022-04-08 08:01:26,329 INFO L290 TraceCheckUtils]: 49: Hoare triple {5406#true} assume true; {5406#true} is VALID
[2022-04-08 08:01:26,330 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5406#true} {5547#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 2 main_~k~0))} #57#return; {5547#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 2 main_~k~0))} is VALID
[2022-04-08 08:01:26,330 INFO L290 TraceCheckUtils]: 51: Hoare triple {5547#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 2 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5569#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4) (< 2 main_~k~0))} is VALID
[2022-04-08 08:01:26,331 INFO L290 TraceCheckUtils]: 52: Hoare triple {5569#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4) (< 2 main_~k~0))} assume !false; {5569#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4) (< 2 main_~k~0))} is VALID
[2022-04-08 08:01:26,331 INFO L272 TraceCheckUtils]: 53: Hoare triple {5569#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4) (< 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)); {5406#true} is VALID
[2022-04-08 08:01:26,331 INFO L290 TraceCheckUtils]: 54: Hoare triple {5406#true} ~cond := #in~cond; {5406#true} is VALID
[2022-04-08 08:01:26,331 INFO L290 TraceCheckUtils]: 55: Hoare triple {5406#true} assume !(0 == ~cond); {5406#true} is VALID
[2022-04-08 08:01:26,331 INFO L290 TraceCheckUtils]: 56: Hoare triple {5406#true} assume true; {5406#true} is VALID
[2022-04-08 08:01:26,331 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {5406#true} {5569#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4) (< 2 main_~k~0))} #57#return; {5569#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4) (< 2 main_~k~0))} is VALID
[2022-04-08 08:01:26,332 INFO L290 TraceCheckUtils]: 58: Hoare triple {5569#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4) (< 2 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5591#(and (= main_~y~0 6) (= main_~c~0 6) (< 2 main_~k~0))} is VALID
[2022-04-08 08:01:26,332 INFO L290 TraceCheckUtils]: 59: Hoare triple {5591#(and (= main_~y~0 6) (= main_~c~0 6) (< 2 main_~k~0))} assume !false; {5591#(and (= main_~y~0 6) (= main_~c~0 6) (< 2 main_~k~0))} is VALID
[2022-04-08 08:01:26,332 INFO L272 TraceCheckUtils]: 60: Hoare triple {5591#(and (= main_~y~0 6) (= main_~c~0 6) (< 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)); {5406#true} is VALID
[2022-04-08 08:01:26,332 INFO L290 TraceCheckUtils]: 61: Hoare triple {5406#true} ~cond := #in~cond; {5406#true} is VALID
[2022-04-08 08:01:26,332 INFO L290 TraceCheckUtils]: 62: Hoare triple {5406#true} assume !(0 == ~cond); {5406#true} is VALID
[2022-04-08 08:01:26,332 INFO L290 TraceCheckUtils]: 63: Hoare triple {5406#true} assume true; {5406#true} is VALID
[2022-04-08 08:01:26,333 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5406#true} {5591#(and (= main_~y~0 6) (= main_~c~0 6) (< 2 main_~k~0))} #57#return; {5591#(and (= main_~y~0 6) (= main_~c~0 6) (< 2 main_~k~0))} is VALID
[2022-04-08 08:01:26,333 INFO L290 TraceCheckUtils]: 65: Hoare triple {5591#(and (= main_~y~0 6) (= main_~c~0 6) (< 2 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5613#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 2 main_~k~0))} is VALID
[2022-04-08 08:01:26,334 INFO L290 TraceCheckUtils]: 66: Hoare triple {5613#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 2 main_~k~0))} assume !false; {5613#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 2 main_~k~0))} is VALID
[2022-04-08 08:01:26,334 INFO L272 TraceCheckUtils]: 67: Hoare triple {5613#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~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)); {5406#true} is VALID
[2022-04-08 08:01:26,334 INFO L290 TraceCheckUtils]: 68: Hoare triple {5406#true} ~cond := #in~cond; {5406#true} is VALID
[2022-04-08 08:01:26,334 INFO L290 TraceCheckUtils]: 69: Hoare triple {5406#true} assume !(0 == ~cond); {5406#true} is VALID
[2022-04-08 08:01:26,334 INFO L290 TraceCheckUtils]: 70: Hoare triple {5406#true} assume true; {5406#true} is VALID
[2022-04-08 08:01:26,334 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5406#true} {5613#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 2 main_~k~0))} #57#return; {5613#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 2 main_~k~0))} is VALID
[2022-04-08 08:01:26,335 INFO L290 TraceCheckUtils]: 72: Hoare triple {5613#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 2 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5635#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} is VALID
[2022-04-08 08:01:26,335 INFO L290 TraceCheckUtils]: 73: Hoare triple {5635#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} assume !false; {5635#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} is VALID
[2022-04-08 08:01:26,335 INFO L272 TraceCheckUtils]: 74: Hoare triple {5635#(and (= main_~y~0 8) (= main_~c~0 8) (< 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)); {5406#true} is VALID
[2022-04-08 08:01:26,335 INFO L290 TraceCheckUtils]: 75: Hoare triple {5406#true} ~cond := #in~cond; {5406#true} is VALID
[2022-04-08 08:01:26,335 INFO L290 TraceCheckUtils]: 76: Hoare triple {5406#true} assume !(0 == ~cond); {5406#true} is VALID
[2022-04-08 08:01:26,335 INFO L290 TraceCheckUtils]: 77: Hoare triple {5406#true} assume true; {5406#true} is VALID
[2022-04-08 08:01:26,336 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {5406#true} {5635#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} #57#return; {5635#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} is VALID
[2022-04-08 08:01:26,336 INFO L290 TraceCheckUtils]: 79: Hoare triple {5635#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5657#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID
[2022-04-08 08:01:26,336 INFO L290 TraceCheckUtils]: 80: Hoare triple {5657#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {5657#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID
[2022-04-08 08:01:26,337 INFO L272 TraceCheckUtils]: 81: Hoare triple {5657#(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)); {5406#true} is VALID
[2022-04-08 08:01:26,337 INFO L290 TraceCheckUtils]: 82: Hoare triple {5406#true} ~cond := #in~cond; {5406#true} is VALID
[2022-04-08 08:01:26,337 INFO L290 TraceCheckUtils]: 83: Hoare triple {5406#true} assume !(0 == ~cond); {5406#true} is VALID
[2022-04-08 08:01:26,337 INFO L290 TraceCheckUtils]: 84: Hoare triple {5406#true} assume true; {5406#true} is VALID
[2022-04-08 08:01:26,337 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {5406#true} {5657#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #57#return; {5657#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID
[2022-04-08 08:01:26,338 INFO L290 TraceCheckUtils]: 86: Hoare triple {5657#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {5679#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID
[2022-04-08 08:01:26,338 INFO L272 TraceCheckUtils]: 87: Hoare triple {5679#(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)); {5406#true} is VALID
[2022-04-08 08:01:26,338 INFO L290 TraceCheckUtils]: 88: Hoare triple {5406#true} ~cond := #in~cond; {5406#true} is VALID
[2022-04-08 08:01:26,338 INFO L290 TraceCheckUtils]: 89: Hoare triple {5406#true} assume !(0 == ~cond); {5406#true} is VALID
[2022-04-08 08:01:26,338 INFO L290 TraceCheckUtils]: 90: Hoare triple {5406#true} assume true; {5406#true} is VALID
[2022-04-08 08:01:26,338 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {5406#true} {5679#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} #59#return; {5679#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID
[2022-04-08 08:01:26,339 INFO L272 TraceCheckUtils]: 92: Hoare triple {5679#(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)); {5698#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 08:01:26,339 INFO L290 TraceCheckUtils]: 93: Hoare triple {5698#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5702#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 08:01:26,340 INFO L290 TraceCheckUtils]: 94: Hoare triple {5702#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5407#false} is VALID
[2022-04-08 08:01:26,340 INFO L290 TraceCheckUtils]: 95: Hoare triple {5407#false} assume !false; {5407#false} is VALID
[2022-04-08 08:01:26,340 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-08 08:01:26,340 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 08:01:27,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 08:01:27,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712910120]
[2022-04-08 08:01:27,211 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 08:01:27,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080972146]
[2022-04-08 08:01:27,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080972146] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 08:01:27,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-04-08 08:01:27,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15
[2022-04-08 08:01:27,211 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 08:01:27,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2141221585]
[2022-04-08 08:01:27,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2141221585] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:01:27,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:01:27,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2022-04-08 08:01:27,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297214383]
[2022-04-08 08:01:27,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 08:01:27,212 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-08 08:01:27,212 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 08:01:27,213 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-08 08:01:27,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:27,258 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2022-04-08 08:01:27,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:27,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2022-04-08 08:01:27,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552
[2022-04-08 08:01:27,259 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-08 08:01:28,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:28,368 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions.
[2022-04-08 08:01:28,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-04-08 08:01:28,368 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-08 08:01:28,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 08:01:28,368 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-08 08:01:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions.
[2022-04-08 08:01:28,369 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-08 08:01:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions.
[2022-04-08 08:01:28,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 74 transitions.
[2022-04-08 08:01:28,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:28,417 INFO L225 Difference]: With dead ends: 66
[2022-04-08 08:01:28,417 INFO L226 Difference]: Without dead ends: 60
[2022-04-08 08:01:28,417 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650
[2022-04-08 08:01:28,417 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-04-08 08:01:28,417 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 427 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-04-08 08:01:28,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2022-04-08 08:01:28,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60.
[2022-04-08 08:01:28,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 08:01:28,456 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-08 08:01:28,456 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-08 08:01:28,456 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-08 08:01:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:28,459 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions.
[2022-04-08 08:01:28,459 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions.
[2022-04-08 08:01:28,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:28,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:28,462 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-08 08:01:28,462 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-08 08:01:28,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:28,480 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions.
[2022-04-08 08:01:28,480 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions.
[2022-04-08 08:01:28,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:28,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:28,481 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 08:01:28,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 08:01:28,481 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-08 08:01:28,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions.
[2022-04-08 08:01:28,483 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 96
[2022-04-08 08:01:28,483 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 08:01:28,483 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions.
[2022-04-08 08:01:28,483 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (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-08 08:01:28,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 71 transitions.
[2022-04-08 08:01:28,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:28,607 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions.
[2022-04-08 08:01:28,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2022-04-08 08:01:28,611 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:01:28,611 INFO L499 BasicCegarLoop]: 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-08 08:01:28,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2022-04-08 08:01:28,816 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2022-04-08 08:01:28,817 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:01:28,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:01:28,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1610181715, now seen corresponding path program 19 times
[2022-04-08 08:01:28,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:28,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2001412173]
[2022-04-08 08:01:28,835 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 08:01:28,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1610181715, now seen corresponding path program 20 times
[2022-04-08 08:01:28,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:01:28,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217602580]
[2022-04-08 08:01:28,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:01:28,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:01:28,852 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 08:01:28,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1398329650]
[2022-04-08 08:01:28,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 08:01:28,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:01:28,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 08:01:28,860 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 08:01:28,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2022-04-08 08:01:29,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 08:01:29,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 08:01:29,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 48 conjunts are in the unsatisfiable core
[2022-04-08 08:01:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:01:29,853 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 08:01:30,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {6273#true} call ULTIMATE.init(); {6273#true} is VALID
[2022-04-08 08:01:30,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {6273#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); {6273#true} is VALID
[2022-04-08 08:01:30,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {6273#true} assume true; {6273#true} is VALID
[2022-04-08 08:01:30,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6273#true} {6273#true} #63#return; {6273#true} is VALID
[2022-04-08 08:01:30,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {6273#true} call #t~ret5 := main(); {6273#true} is VALID
[2022-04-08 08:01:30,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {6273#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; {6273#true} is VALID
[2022-04-08 08:01:30,398 INFO L272 TraceCheckUtils]: 6: Hoare triple {6273#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {6273#true} is VALID
[2022-04-08 08:01:30,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {6273#true} ~cond := #in~cond; {6273#true} is VALID
[2022-04-08 08:01:30,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {6273#true} assume !(0 == ~cond); {6273#true} is VALID
[2022-04-08 08:01:30,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {6273#true} assume true; {6273#true} is VALID
[2022-04-08 08:01:30,399 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6273#true} {6273#true} #53#return; {6273#true} is VALID
[2022-04-08 08:01:30,399 INFO L272 TraceCheckUtils]: 11: Hoare triple {6273#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6273#true} is VALID
[2022-04-08 08:01:30,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {6273#true} ~cond := #in~cond; {6273#true} is VALID
[2022-04-08 08:01:30,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {6273#true} assume !(0 == ~cond); {6273#true} is VALID
[2022-04-08 08:01:30,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {6273#true} assume true; {6273#true} is VALID
[2022-04-08 08:01:30,399 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6273#true} {6273#true} #55#return; {6273#true} is VALID
[2022-04-08 08:01:30,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {6273#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6326#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 08:01:30,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {6326#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6326#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 08:01:30,400 INFO L272 TraceCheckUtils]: 18: Hoare triple {6326#(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)); {6273#true} is VALID
[2022-04-08 08:01:30,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {6273#true} ~cond := #in~cond; {6273#true} is VALID
[2022-04-08 08:01:30,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {6273#true} assume !(0 == ~cond); {6273#true} is VALID
[2022-04-08 08:01:30,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {6273#true} assume true; {6273#true} is VALID
[2022-04-08 08:01:30,400 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6273#true} {6326#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {6326#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 08:01:30,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {6326#(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; {6348#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID
[2022-04-08 08:01:30,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {6348#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {6348#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID
[2022-04-08 08:01:30,401 INFO L272 TraceCheckUtils]: 25: Hoare triple {6348#(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)); {6273#true} is VALID
[2022-04-08 08:01:30,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {6273#true} ~cond := #in~cond; {6273#true} is VALID
[2022-04-08 08:01:30,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {6273#true} assume !(0 == ~cond); {6273#true} is VALID
[2022-04-08 08:01:30,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {6273#true} assume true; {6273#true} is VALID
[2022-04-08 08:01:30,402 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6273#true} {6348#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {6348#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID
[2022-04-08 08:01:30,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {6348#(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; {6370#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID
[2022-04-08 08:01:30,402 INFO L290 TraceCheckUtils]: 31: Hoare triple {6370#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {6370#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID
[2022-04-08 08:01:30,402 INFO L272 TraceCheckUtils]: 32: Hoare triple {6370#(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)); {6273#true} is VALID
[2022-04-08 08:01:30,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {6273#true} ~cond := #in~cond; {6273#true} is VALID
[2022-04-08 08:01:30,403 INFO L290 TraceCheckUtils]: 34: Hoare triple {6273#true} assume !(0 == ~cond); {6273#true} is VALID
[2022-04-08 08:01:30,403 INFO L290 TraceCheckUtils]: 35: Hoare triple {6273#true} assume true; {6273#true} is VALID
[2022-04-08 08:01:30,403 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6273#true} {6370#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #57#return; {6370#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID
[2022-04-08 08:01:30,403 INFO L290 TraceCheckUtils]: 37: Hoare triple {6370#(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; {6392#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID
[2022-04-08 08:01:30,404 INFO L290 TraceCheckUtils]: 38: Hoare triple {6392#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {6392#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID
[2022-04-08 08:01:30,404 INFO L272 TraceCheckUtils]: 39: Hoare triple {6392#(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)); {6273#true} is VALID
[2022-04-08 08:01:30,404 INFO L290 TraceCheckUtils]: 40: Hoare triple {6273#true} ~cond := #in~cond; {6273#true} is VALID
[2022-04-08 08:01:30,404 INFO L290 TraceCheckUtils]: 41: Hoare triple {6273#true} assume !(0 == ~cond); {6273#true} is VALID
[2022-04-08 08:01:30,404 INFO L290 TraceCheckUtils]: 42: Hoare triple {6273#true} assume true; {6273#true} is VALID
[2022-04-08 08:01:30,405 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6273#true} {6392#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #57#return; {6392#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID
[2022-04-08 08:01:30,405 INFO L290 TraceCheckUtils]: 44: Hoare triple {6392#(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; {6414#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID
[2022-04-08 08:01:30,405 INFO L290 TraceCheckUtils]: 45: Hoare triple {6414#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} assume !false; {6414#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID
[2022-04-08 08:01:30,405 INFO L272 TraceCheckUtils]: 46: Hoare triple {6414#(and (= (+ main_~y~0 (- 4)) 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)); {6273#true} is VALID
[2022-04-08 08:01:30,405 INFO L290 TraceCheckUtils]: 47: Hoare triple {6273#true} ~cond := #in~cond; {6273#true} is VALID
[2022-04-08 08:01:30,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {6273#true} assume !(0 == ~cond); {6273#true} is VALID
[2022-04-08 08:01:30,406 INFO L290 TraceCheckUtils]: 49: Hoare triple {6273#true} assume true; {6273#true} is VALID
[2022-04-08 08:01:30,406 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6273#true} {6414#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} #57#return; {6414#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID
[2022-04-08 08:01:30,406 INFO L290 TraceCheckUtils]: 51: Hoare triple {6414#(and (= (+ main_~y~0 (- 4)) 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; {6436#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID
[2022-04-08 08:01:30,407 INFO L290 TraceCheckUtils]: 52: Hoare triple {6436#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {6436#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID
[2022-04-08 08:01:30,407 INFO L272 TraceCheckUtils]: 53: Hoare triple {6436#(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)); {6273#true} is VALID
[2022-04-08 08:01:30,407 INFO L290 TraceCheckUtils]: 54: Hoare triple {6273#true} ~cond := #in~cond; {6273#true} is VALID
[2022-04-08 08:01:30,407 INFO L290 TraceCheckUtils]: 55: Hoare triple {6273#true} assume !(0 == ~cond); {6273#true} is VALID
[2022-04-08 08:01:30,407 INFO L290 TraceCheckUtils]: 56: Hoare triple {6273#true} assume true; {6273#true} is VALID
[2022-04-08 08:01:30,407 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {6273#true} {6436#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {6436#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID
[2022-04-08 08:01:30,408 INFO L290 TraceCheckUtils]: 58: Hoare triple {6436#(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; {6458#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID
[2022-04-08 08:01:30,408 INFO L290 TraceCheckUtils]: 59: Hoare triple {6458#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {6458#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID
[2022-04-08 08:01:30,408 INFO L272 TraceCheckUtils]: 60: Hoare triple {6458#(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)); {6273#true} is VALID
[2022-04-08 08:01:30,408 INFO L290 TraceCheckUtils]: 61: Hoare triple {6273#true} ~cond := #in~cond; {6273#true} is VALID
[2022-04-08 08:01:30,408 INFO L290 TraceCheckUtils]: 62: Hoare triple {6273#true} assume !(0 == ~cond); {6273#true} is VALID
[2022-04-08 08:01:30,408 INFO L290 TraceCheckUtils]: 63: Hoare triple {6273#true} assume true; {6273#true} is VALID
[2022-04-08 08:01:30,409 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6273#true} {6458#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #57#return; {6458#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID
[2022-04-08 08:01:30,409 INFO L290 TraceCheckUtils]: 65: Hoare triple {6458#(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; {6480#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID
[2022-04-08 08:01:30,409 INFO L290 TraceCheckUtils]: 66: Hoare triple {6480#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {6480#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID
[2022-04-08 08:01:30,410 INFO L272 TraceCheckUtils]: 67: Hoare triple {6480#(and (= 7 main_~y~0) (= 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)); {6273#true} is VALID
[2022-04-08 08:01:30,410 INFO L290 TraceCheckUtils]: 68: Hoare triple {6273#true} ~cond := #in~cond; {6273#true} is VALID
[2022-04-08 08:01:30,410 INFO L290 TraceCheckUtils]: 69: Hoare triple {6273#true} assume !(0 == ~cond); {6273#true} is VALID
[2022-04-08 08:01:30,410 INFO L290 TraceCheckUtils]: 70: Hoare triple {6273#true} assume true; {6273#true} is VALID
[2022-04-08 08:01:30,410 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6273#true} {6480#(and (= 7 main_~y~0) (= 7 main_~c~0))} #57#return; {6480#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID
[2022-04-08 08:01:30,411 INFO L290 TraceCheckUtils]: 72: Hoare triple {6480#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6502#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID
[2022-04-08 08:01:30,411 INFO L290 TraceCheckUtils]: 73: Hoare triple {6502#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {6502#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID
[2022-04-08 08:01:30,411 INFO L272 TraceCheckUtils]: 74: Hoare triple {6502#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6273#true} is VALID
[2022-04-08 08:01:30,411 INFO L290 TraceCheckUtils]: 75: Hoare triple {6273#true} ~cond := #in~cond; {6273#true} is VALID
[2022-04-08 08:01:30,411 INFO L290 TraceCheckUtils]: 76: Hoare triple {6273#true} assume !(0 == ~cond); {6273#true} is VALID
[2022-04-08 08:01:30,411 INFO L290 TraceCheckUtils]: 77: Hoare triple {6273#true} assume true; {6273#true} is VALID
[2022-04-08 08:01:30,411 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {6273#true} {6502#(and (= main_~y~0 8) (= main_~c~0 8))} #57#return; {6502#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID
[2022-04-08 08:01:30,412 INFO L290 TraceCheckUtils]: 79: Hoare triple {6502#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6524#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID
[2022-04-08 08:01:30,412 INFO L290 TraceCheckUtils]: 80: Hoare triple {6524#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {6524#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID
[2022-04-08 08:01:30,412 INFO L272 TraceCheckUtils]: 81: Hoare triple {6524#(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)); {6273#true} is VALID
[2022-04-08 08:01:30,412 INFO L290 TraceCheckUtils]: 82: Hoare triple {6273#true} ~cond := #in~cond; {6273#true} is VALID
[2022-04-08 08:01:30,412 INFO L290 TraceCheckUtils]: 83: Hoare triple {6273#true} assume !(0 == ~cond); {6273#true} is VALID
[2022-04-08 08:01:30,413 INFO L290 TraceCheckUtils]: 84: Hoare triple {6273#true} assume true; {6273#true} is VALID
[2022-04-08 08:01:30,413 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {6273#true} {6524#(and (= main_~y~0 9) (= main_~c~0 9))} #57#return; {6524#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID
[2022-04-08 08:01:30,413 INFO L290 TraceCheckUtils]: 86: Hoare triple {6524#(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; {6546#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID
[2022-04-08 08:01:30,414 INFO L290 TraceCheckUtils]: 87: Hoare triple {6546#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !false; {6546#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID
[2022-04-08 08:01:30,414 INFO L272 TraceCheckUtils]: 88: Hoare triple {6546#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6273#true} is VALID
[2022-04-08 08:01:30,414 INFO L290 TraceCheckUtils]: 89: Hoare triple {6273#true} ~cond := #in~cond; {6273#true} is VALID
[2022-04-08 08:01:30,414 INFO L290 TraceCheckUtils]: 90: Hoare triple {6273#true} assume !(0 == ~cond); {6273#true} is VALID
[2022-04-08 08:01:30,414 INFO L290 TraceCheckUtils]: 91: Hoare triple {6273#true} assume true; {6273#true} is VALID
[2022-04-08 08:01:30,414 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {6273#true} {6546#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} #57#return; {6546#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID
[2022-04-08 08:01:30,415 INFO L290 TraceCheckUtils]: 93: Hoare triple {6546#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {6568#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID
[2022-04-08 08:01:30,415 INFO L272 TraceCheckUtils]: 94: Hoare triple {6568#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6273#true} is VALID
[2022-04-08 08:01:30,415 INFO L290 TraceCheckUtils]: 95: Hoare triple {6273#true} ~cond := #in~cond; {6273#true} is VALID
[2022-04-08 08:01:30,415 INFO L290 TraceCheckUtils]: 96: Hoare triple {6273#true} assume !(0 == ~cond); {6273#true} is VALID
[2022-04-08 08:01:30,415 INFO L290 TraceCheckUtils]: 97: Hoare triple {6273#true} assume true; {6273#true} is VALID
[2022-04-08 08:01:30,416 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {6273#true} {6568#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} #59#return; {6568#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID
[2022-04-08 08:01:30,417 INFO L272 TraceCheckUtils]: 99: Hoare triple {6568#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {6587#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 08:01:30,417 INFO L290 TraceCheckUtils]: 100: Hoare triple {6587#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6591#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 08:01:30,418 INFO L290 TraceCheckUtils]: 101: Hoare triple {6591#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6274#false} is VALID
[2022-04-08 08:01:30,418 INFO L290 TraceCheckUtils]: 102: Hoare triple {6274#false} assume !false; {6274#false} is VALID
[2022-04-08 08:01:30,418 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-08 08:01:30,418 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 08:01:30,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 08:01:30,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217602580]
[2022-04-08 08:01:30,698 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 08:01:30,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398329650]
[2022-04-08 08:01:30,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398329650] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 08:01:30,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-04-08 08:01:30,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16
[2022-04-08 08:01:30,698 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 08:01:30,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2001412173]
[2022-04-08 08:01:30,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2001412173] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:01:30,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:01:30,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2022-04-08 08:01:30,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219108156]
[2022-04-08 08:01:30,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 08:01:30,699 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-08 08:01:30,699 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 08:01:30,699 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-08 08:01:30,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:30,746 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2022-04-08 08:01:30,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:30,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2022-04-08 08:01:30,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342
[2022-04-08 08:01:30,747 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-08 08:01:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:31,952 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions.
[2022-04-08 08:01:31,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2022-04-08 08:01:31,952 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-08 08:01:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 08:01:31,953 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-08 08:01:31,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions.
[2022-04-08 08:01:31,954 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-08 08:01:31,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions.
[2022-04-08 08:01:31,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 78 transitions.
[2022-04-08 08:01:32,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:32,014 INFO L225 Difference]: With dead ends: 69
[2022-04-08 08:01:32,014 INFO L226 Difference]: Without dead ends: 63
[2022-04-08 08:01:32,014 INFO L912 BasicCegarLoop]: 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-08 08:01:32,015 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time
[2022-04-08 08:01:32,015 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 486 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-04-08 08:01:32,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2022-04-08 08:01:32,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63.
[2022-04-08 08:01:32,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 08:01:32,063 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-08 08:01:32,063 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-08 08:01:32,064 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-08 08:01:32,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:32,065 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions.
[2022-04-08 08:01:32,066 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions.
[2022-04-08 08:01:32,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:32,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:32,066 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-08 08:01:32,066 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-08 08:01:32,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:32,067 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions.
[2022-04-08 08:01:32,067 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions.
[2022-04-08 08:01:32,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:32,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:32,068 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 08:01:32,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 08:01:32,068 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-08 08:01:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions.
[2022-04-08 08:01:32,071 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 103
[2022-04-08 08:01:32,073 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 08:01:32,073 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions.
[2022-04-08 08:01:32,073 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (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-08 08:01:32,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 75 transitions.
[2022-04-08 08:01:32,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:32,204 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions.
[2022-04-08 08:01:32,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2022-04-08 08:01:32,211 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:01:32,211 INFO L499 BasicCegarLoop]: 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-08 08:01:32,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2022-04-08 08:01:32,419 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2022-04-08 08:01:32,419 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:01:32,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:01:32,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1881400669, now seen corresponding path program 21 times
[2022-04-08 08:01:32,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:32,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [635727243]
[2022-04-08 08:01:32,420 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 08:01:32,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1881400669, now seen corresponding path program 22 times
[2022-04-08 08:01:32,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:01:32,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572238128]
[2022-04-08 08:01:32,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:01:32,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:01:32,441 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 08:01:32,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1405243702]
[2022-04-08 08:01:32,441 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 08:01:32,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:01:32,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 08:01:32,442 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 08:01:32,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2022-04-08 08:01:32,486 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 08:01:32,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 08:01:32,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 52 conjunts are in the unsatisfiable core
[2022-04-08 08:01:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:01:32,499 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 08:01:32,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {7048#true} call ULTIMATE.init(); {7048#true} is VALID
[2022-04-08 08:01:32,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {7048#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); {7048#true} is VALID
[2022-04-08 08:01:32,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {7048#true} assume true; {7048#true} is VALID
[2022-04-08 08:01:32,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7048#true} {7048#true} #63#return; {7048#true} is VALID
[2022-04-08 08:01:32,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {7048#true} call #t~ret5 := main(); {7048#true} is VALID
[2022-04-08 08:01:32,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {7048#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; {7048#true} is VALID
[2022-04-08 08:01:32,927 INFO L272 TraceCheckUtils]: 6: Hoare triple {7048#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {7048#true} is VALID
[2022-04-08 08:01:32,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID
[2022-04-08 08:01:32,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID
[2022-04-08 08:01:32,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {7048#true} assume true; {7048#true} is VALID
[2022-04-08 08:01:32,927 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7048#true} {7048#true} #53#return; {7048#true} is VALID
[2022-04-08 08:01:32,927 INFO L272 TraceCheckUtils]: 11: Hoare triple {7048#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7048#true} is VALID
[2022-04-08 08:01:32,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID
[2022-04-08 08:01:32,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID
[2022-04-08 08:01:32,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {7048#true} assume true; {7048#true} is VALID
[2022-04-08 08:01:32,927 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7048#true} {7048#true} #55#return; {7048#true} is VALID
[2022-04-08 08:01:32,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {7048#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 08:01:32,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {7101#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {7101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 08:01:32,928 INFO L272 TraceCheckUtils]: 18: Hoare triple {7101#(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)); {7048#true} is VALID
[2022-04-08 08:01:32,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID
[2022-04-08 08:01:32,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID
[2022-04-08 08:01:32,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {7048#true} assume true; {7048#true} is VALID
[2022-04-08 08:01:32,929 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7048#true} {7101#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {7101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 08:01:32,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {7101#(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; {7123#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID
[2022-04-08 08:01:32,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {7123#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {7123#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID
[2022-04-08 08:01:32,930 INFO L272 TraceCheckUtils]: 25: Hoare triple {7123#(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)); {7048#true} is VALID
[2022-04-08 08:01:32,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID
[2022-04-08 08:01:32,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID
[2022-04-08 08:01:32,930 INFO L290 TraceCheckUtils]: 28: Hoare triple {7048#true} assume true; {7048#true} is VALID
[2022-04-08 08:01:32,931 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {7048#true} {7123#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {7123#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID
[2022-04-08 08:01:32,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {7123#(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; {7145#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID
[2022-04-08 08:01:32,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {7145#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {7145#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID
[2022-04-08 08:01:32,931 INFO L272 TraceCheckUtils]: 32: Hoare triple {7145#(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)); {7048#true} is VALID
[2022-04-08 08:01:32,931 INFO L290 TraceCheckUtils]: 33: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID
[2022-04-08 08:01:32,931 INFO L290 TraceCheckUtils]: 34: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID
[2022-04-08 08:01:32,931 INFO L290 TraceCheckUtils]: 35: Hoare triple {7048#true} assume true; {7048#true} is VALID
[2022-04-08 08:01:32,932 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7048#true} {7145#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #57#return; {7145#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID
[2022-04-08 08:01:32,932 INFO L290 TraceCheckUtils]: 37: Hoare triple {7145#(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; {7167#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID
[2022-04-08 08:01:32,932 INFO L290 TraceCheckUtils]: 38: Hoare triple {7167#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {7167#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID
[2022-04-08 08:01:32,932 INFO L272 TraceCheckUtils]: 39: Hoare triple {7167#(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)); {7048#true} is VALID
[2022-04-08 08:01:32,932 INFO L290 TraceCheckUtils]: 40: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID
[2022-04-08 08:01:32,932 INFO L290 TraceCheckUtils]: 41: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID
[2022-04-08 08:01:32,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {7048#true} assume true; {7048#true} is VALID
[2022-04-08 08:01:32,933 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7048#true} {7167#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #57#return; {7167#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID
[2022-04-08 08:01:32,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {7167#(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; {7189#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} is VALID
[2022-04-08 08:01:32,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {7189#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} assume !false; {7189#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} is VALID
[2022-04-08 08:01:32,933 INFO L272 TraceCheckUtils]: 46: Hoare triple {7189#(and (= (+ main_~c~0 (- 3)) 1) (= 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)); {7048#true} is VALID
[2022-04-08 08:01:32,933 INFO L290 TraceCheckUtils]: 47: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID
[2022-04-08 08:01:32,934 INFO L290 TraceCheckUtils]: 48: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID
[2022-04-08 08:01:32,934 INFO L290 TraceCheckUtils]: 49: Hoare triple {7048#true} assume true; {7048#true} is VALID
[2022-04-08 08:01:32,934 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7048#true} {7189#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} #57#return; {7189#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} is VALID
[2022-04-08 08:01:32,934 INFO L290 TraceCheckUtils]: 51: Hoare triple {7189#(and (= (+ main_~c~0 (- 3)) 1) (= 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; {7211#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} is VALID
[2022-04-08 08:01:32,934 INFO L290 TraceCheckUtils]: 52: Hoare triple {7211#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} assume !false; {7211#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} is VALID
[2022-04-08 08:01:32,935 INFO L272 TraceCheckUtils]: 53: Hoare triple {7211#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 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)); {7048#true} is VALID
[2022-04-08 08:01:32,935 INFO L290 TraceCheckUtils]: 54: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID
[2022-04-08 08:01:32,935 INFO L290 TraceCheckUtils]: 55: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID
[2022-04-08 08:01:32,935 INFO L290 TraceCheckUtils]: 56: Hoare triple {7048#true} assume true; {7048#true} is VALID
[2022-04-08 08:01:32,935 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {7048#true} {7211#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} #57#return; {7211#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} is VALID
[2022-04-08 08:01:32,935 INFO L290 TraceCheckUtils]: 58: Hoare triple {7211#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 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; {7233#(and (= (+ main_~c~0 (- 5)) 1) (= (+ main_~y~0 (- 3)) 3))} is VALID
[2022-04-08 08:01:32,936 INFO L290 TraceCheckUtils]: 59: Hoare triple {7233#(and (= (+ main_~c~0 (- 5)) 1) (= (+ main_~y~0 (- 3)) 3))} assume !false; {7233#(and (= (+ main_~c~0 (- 5)) 1) (= (+ main_~y~0 (- 3)) 3))} is VALID
[2022-04-08 08:01:32,936 INFO L272 TraceCheckUtils]: 60: Hoare triple {7233#(and (= (+ main_~c~0 (- 5)) 1) (= (+ main_~y~0 (- 3)) 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)); {7048#true} is VALID
[2022-04-08 08:01:32,936 INFO L290 TraceCheckUtils]: 61: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID
[2022-04-08 08:01:32,936 INFO L290 TraceCheckUtils]: 62: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID
[2022-04-08 08:01:32,936 INFO L290 TraceCheckUtils]: 63: Hoare triple {7048#true} assume true; {7048#true} is VALID
[2022-04-08 08:01:32,936 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7048#true} {7233#(and (= (+ main_~c~0 (- 5)) 1) (= (+ main_~y~0 (- 3)) 3))} #57#return; {7233#(and (= (+ main_~c~0 (- 5)) 1) (= (+ main_~y~0 (- 3)) 3))} is VALID
[2022-04-08 08:01:32,936 INFO L290 TraceCheckUtils]: 65: Hoare triple {7233#(and (= (+ main_~c~0 (- 5)) 1) (= (+ main_~y~0 (- 3)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7255#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID
[2022-04-08 08:01:32,937 INFO L290 TraceCheckUtils]: 66: Hoare triple {7255#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} assume !false; {7255#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID
[2022-04-08 08:01:32,937 INFO L272 TraceCheckUtils]: 67: Hoare triple {7255#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 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)); {7048#true} is VALID
[2022-04-08 08:01:32,937 INFO L290 TraceCheckUtils]: 68: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID
[2022-04-08 08:01:32,937 INFO L290 TraceCheckUtils]: 69: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID
[2022-04-08 08:01:32,937 INFO L290 TraceCheckUtils]: 70: Hoare triple {7048#true} assume true; {7048#true} is VALID
[2022-04-08 08:01:32,937 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7048#true} {7255#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} #57#return; {7255#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID
[2022-04-08 08:01:32,937 INFO L290 TraceCheckUtils]: 72: Hoare triple {7255#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 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; {7277#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID
[2022-04-08 08:01:32,938 INFO L290 TraceCheckUtils]: 73: Hoare triple {7277#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {7277#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID
[2022-04-08 08:01:32,938 INFO L272 TraceCheckUtils]: 74: Hoare triple {7277#(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)); {7048#true} is VALID
[2022-04-08 08:01:32,938 INFO L290 TraceCheckUtils]: 75: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID
[2022-04-08 08:01:32,938 INFO L290 TraceCheckUtils]: 76: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID
[2022-04-08 08:01:32,938 INFO L290 TraceCheckUtils]: 77: Hoare triple {7048#true} assume true; {7048#true} is VALID
[2022-04-08 08:01:32,938 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7048#true} {7277#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #57#return; {7277#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID
[2022-04-08 08:01:32,939 INFO L290 TraceCheckUtils]: 79: Hoare triple {7277#(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; {7299#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID
[2022-04-08 08:01:32,939 INFO L290 TraceCheckUtils]: 80: Hoare triple {7299#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !false; {7299#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID
[2022-04-08 08:01:32,939 INFO L272 TraceCheckUtils]: 81: Hoare triple {7299#(and (= main_~y~0 9) (= 7 (+ (- 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)); {7048#true} is VALID
[2022-04-08 08:01:32,939 INFO L290 TraceCheckUtils]: 82: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID
[2022-04-08 08:01:32,939 INFO L290 TraceCheckUtils]: 83: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID
[2022-04-08 08:01:32,939 INFO L290 TraceCheckUtils]: 84: Hoare triple {7048#true} assume true; {7048#true} is VALID
[2022-04-08 08:01:32,939 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {7048#true} {7299#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} #57#return; {7299#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID
[2022-04-08 08:01:32,940 INFO L290 TraceCheckUtils]: 86: Hoare triple {7299#(and (= main_~y~0 9) (= 7 (+ (- 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; {7321#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID
[2022-04-08 08:01:32,940 INFO L290 TraceCheckUtils]: 87: Hoare triple {7321#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {7321#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID
[2022-04-08 08:01:32,940 INFO L272 TraceCheckUtils]: 88: Hoare triple {7321#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7048#true} is VALID
[2022-04-08 08:01:32,940 INFO L290 TraceCheckUtils]: 89: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID
[2022-04-08 08:01:32,940 INFO L290 TraceCheckUtils]: 90: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID
[2022-04-08 08:01:32,940 INFO L290 TraceCheckUtils]: 91: Hoare triple {7048#true} assume true; {7048#true} is VALID
[2022-04-08 08:01:32,940 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {7048#true} {7321#(and (= main_~y~0 10) (= main_~c~0 10))} #57#return; {7321#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID
[2022-04-08 08:01:32,941 INFO L290 TraceCheckUtils]: 93: Hoare triple {7321#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7343#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID
[2022-04-08 08:01:32,941 INFO L290 TraceCheckUtils]: 94: Hoare triple {7343#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} assume !false; {7343#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID
[2022-04-08 08:01:32,941 INFO L272 TraceCheckUtils]: 95: Hoare triple {7343#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7048#true} is VALID
[2022-04-08 08:01:32,941 INFO L290 TraceCheckUtils]: 96: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID
[2022-04-08 08:01:32,941 INFO L290 TraceCheckUtils]: 97: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID
[2022-04-08 08:01:32,941 INFO L290 TraceCheckUtils]: 98: Hoare triple {7048#true} assume true; {7048#true} is VALID
[2022-04-08 08:01:32,941 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {7048#true} {7343#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} #57#return; {7343#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID
[2022-04-08 08:01:32,942 INFO L290 TraceCheckUtils]: 100: Hoare triple {7343#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} assume !(~c~0 < ~k~0); {7365#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID
[2022-04-08 08:01:32,942 INFO L272 TraceCheckUtils]: 101: Hoare triple {7365#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7048#true} is VALID
[2022-04-08 08:01:32,942 INFO L290 TraceCheckUtils]: 102: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID
[2022-04-08 08:01:32,942 INFO L290 TraceCheckUtils]: 103: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID
[2022-04-08 08:01:32,942 INFO L290 TraceCheckUtils]: 104: Hoare triple {7048#true} assume true; {7048#true} is VALID
[2022-04-08 08:01:32,943 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {7048#true} {7365#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} #59#return; {7365#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID
[2022-04-08 08:01:32,944 INFO L272 TraceCheckUtils]: 106: Hoare triple {7365#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7384#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 08:01:32,944 INFO L290 TraceCheckUtils]: 107: Hoare triple {7384#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7388#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 08:01:32,944 INFO L290 TraceCheckUtils]: 108: Hoare triple {7388#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7049#false} is VALID
[2022-04-08 08:01:32,944 INFO L290 TraceCheckUtils]: 109: Hoare triple {7049#false} assume !false; {7049#false} is VALID
[2022-04-08 08:01:32,945 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-08 08:01:32,945 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 08:01:33,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 08:01:33,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572238128]
[2022-04-08 08:01:33,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 08:01:33,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405243702]
[2022-04-08 08:01:33,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405243702] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 08:01:33,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-04-08 08:01:33,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17
[2022-04-08 08:01:33,233 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 08:01:33,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [635727243]
[2022-04-08 08:01:33,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [635727243] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:01:33,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:01:33,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2022-04-08 08:01:33,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685119195]
[2022-04-08 08:01:33,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 08:01:33,233 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-08 08:01:33,234 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 08:01:33,234 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-08 08:01:33,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:33,284 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2022-04-08 08:01:33,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:33,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2022-04-08 08:01:33,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380
[2022-04-08 08:01:33,285 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-08 08:01:34,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:34,718 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions.
[2022-04-08 08:01:34,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-04-08 08:01:34,718 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-08 08:01:34,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 08:01:34,718 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-08 08:01:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions.
[2022-04-08 08:01:34,720 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-08 08:01:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions.
[2022-04-08 08:01:34,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 82 transitions.
[2022-04-08 08:01:34,798 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-08 08:01:34,799 INFO L225 Difference]: With dead ends: 72
[2022-04-08 08:01:34,799 INFO L226 Difference]: Without dead ends: 66
[2022-04-08 08:01:34,799 INFO L912 BasicCegarLoop]: 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-08 08:01:34,800 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time
[2022-04-08 08:01:34,800 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 535 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2022-04-08 08:01:34,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states.
[2022-04-08 08:01:34,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66.
[2022-04-08 08:01:34,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 08:01:34,851 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-08 08:01:34,851 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-08 08:01:34,852 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-08 08:01:34,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:34,853 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions.
[2022-04-08 08:01:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions.
[2022-04-08 08:01:34,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:34,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:34,853 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-08 08:01:34,853 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-08 08:01:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:01:34,854 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions.
[2022-04-08 08:01:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions.
[2022-04-08 08:01:34,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:01:34,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:01:34,855 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 08:01:34,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 08:01:34,855 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-08 08:01:34,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions.
[2022-04-08 08:01:34,856 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 110
[2022-04-08 08:01:34,856 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 08:01:34,856 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions.
[2022-04-08 08:01:34,856 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (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-08 08:01:34,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 79 transitions.
[2022-04-08 08:01:35,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:01:35,028 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions.
[2022-04-08 08:01:35,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2022-04-08 08:01:35,029 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:01:35,029 INFO L499 BasicCegarLoop]: 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-08 08:01:35,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0
[2022-04-08 08:01:35,229 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2022-04-08 08:01:35,229 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:01:35,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:01:35,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1600671149, now seen corresponding path program 23 times
[2022-04-08 08:01:35,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:01:35,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1578682923]
[2022-04-08 08:01:35,230 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 08:01:35,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1600671149, now seen corresponding path program 24 times
[2022-04-08 08:01:35,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:01:35,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824374169]
[2022-04-08 08:01:35,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:01:35,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:01:35,241 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 08:01:35,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1303333681]
[2022-04-08 08:01:35,242 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 08:01:35,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:01:35,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 08:01:35,254 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 08:01:35,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process