/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:34:48,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:34:48,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:34:48,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:34:48,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:34:48,393 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:34:48,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:34:48,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:34:48,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:34:48,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:34:48,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:34:48,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:34:48,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:34:48,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:34:48,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:34:48,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:34:48,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:34:48,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:34:48,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:34:48,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:34:48,418 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:34:48,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:34:48,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:34:48,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:34:48,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:34:48,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:34:48,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:34:48,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:34:48,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:34:48,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:34:48,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:34:48,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:34:48,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:34:48,429 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:34:48,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:34:48,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:34:48,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:34:48,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:34:48,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:34:48,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:34:48,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:34:48,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:34:48,433 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 14:34:48,454 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:34:48,455 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:34:48,455 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:34:48,455 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:34:48,455 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:34:48,455 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:34:48,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:34:48,456 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:34:48,456 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:34:48,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:34:48,457 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:34:48,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:34:48,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:34:48,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:34:48,457 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:34:48,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:34:48,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:34:48,457 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:34:48,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:34:48,457 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:34:48,458 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:34:48,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:34:48,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:34:48,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:34:48,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:34:48,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:34:48,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:34:48,458 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:34:48,458 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:34:48,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:34:48,459 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:34:48,459 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:34:48,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:34:48,459 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 14:34:48,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:34:48,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:34:48,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:34:48,658 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:34:48,659 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:34:48,660 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound20.c [2022-04-27 14:34:48,715 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2e34b36/f6c666f3246f4bbea2d070f5d1a50ba1/FLAGccbd2348a [2022-04-27 14:34:49,049 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:34:49,049 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound20.c [2022-04-27 14:34:49,053 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2e34b36/f6c666f3246f4bbea2d070f5d1a50ba1/FLAGccbd2348a [2022-04-27 14:34:49,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2e34b36/f6c666f3246f4bbea2d070f5d1a50ba1 [2022-04-27 14:34:49,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:34:49,062 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:34:49,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:34:49,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:34:49,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:34:49,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:34:49" (1/1) ... [2022-04-27 14:34:49,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce1acb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:49, skipping insertion in model container [2022-04-27 14:34:49,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:34:49" (1/1) ... [2022-04-27 14:34:49,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:34:49,099 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:34:49,202 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound20.c[458,471] [2022-04-27 14:34:49,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:34:49,226 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:34:49,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound20.c[458,471] [2022-04-27 14:34:49,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:34:49,246 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:34:49,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:49 WrapperNode [2022-04-27 14:34:49,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:34:49,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:34:49,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:34:49,247 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:34:49,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:49" (1/1) ... [2022-04-27 14:34:49,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:49" (1/1) ... [2022-04-27 14:34:49,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:49" (1/1) ... [2022-04-27 14:34:49,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:49" (1/1) ... [2022-04-27 14:34:49,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:49" (1/1) ... [2022-04-27 14:34:49,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:49" (1/1) ... [2022-04-27 14:34:49,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:49" (1/1) ... [2022-04-27 14:34:49,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:34:49,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:34:49,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:34:49,264 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:34:49,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:49" (1/1) ... [2022-04-27 14:34:49,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:34:49,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:49,291 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-27 14:34:49,292 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-27 14:34:49,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:34:49,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:34:49,318 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:34:49,319 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:34:49,320 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:34:49,320 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:34:49,320 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:34:49,320 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:34:49,321 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:34:49,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:34:49,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:34:49,321 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:34:49,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:34:49,323 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:34:49,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:34:49,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:34:49,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:34:49,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:34:49,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:34:49,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:34:49,361 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:34:49,362 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:34:49,445 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:34:49,450 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:34:49,450 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:34:49,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:34:49 BoogieIcfgContainer [2022-04-27 14:34:49,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:34:49,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:34:49,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:34:49,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:34:49,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:34:49" (1/3) ... [2022-04-27 14:34:49,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d41ad2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:34:49, skipping insertion in model container [2022-04-27 14:34:49,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:49" (2/3) ... [2022-04-27 14:34:49,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d41ad2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:34:49, skipping insertion in model container [2022-04-27 14:34:49,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:34:49" (3/3) ... [2022-04-27 14:34:49,456 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound20.c [2022-04-27 14:34:49,464 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:34:49,464 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:34:49,491 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:34:49,496 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6e383f32, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5b467a5d [2022-04-27 14:34:49,496 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:34:49,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:34:49,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 14:34:49,524 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:49,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:49,525 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:49,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:49,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 1 times [2022-04-27 14:34:49,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:49,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64150025] [2022-04-27 14:34:49,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:49,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:49,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:34:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:49,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26#true} is VALID [2022-04-27 14:34:49,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 14:34:49,679 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-27 14:34:49,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:34:49,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26#true} is VALID [2022-04-27 14:34:49,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 14:34:49,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-27 14:34:49,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret6 := main(); {26#true} is VALID [2022-04-27 14:34:49,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {26#true} is VALID [2022-04-27 14:34:49,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-27 14:34:49,682 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27#false} is VALID [2022-04-27 14:34:49,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-27 14:34:49,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-27 14:34:49,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-27 14:34:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:34:49,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:49,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64150025] [2022-04-27 14:34:49,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64150025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:34:49,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:34:49,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:34:49,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816387028] [2022-04-27 14:34:49,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:34:49,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 14:34:49,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:49,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:49,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:49,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:34:49,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:49,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:34:49,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:34:49,719 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:49,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:49,827 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-27 14:34:49,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:34:49,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 14:34:49,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:49,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:49,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 14:34:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 14:34:49,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-27 14:34:49,896 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-27 14:34:49,901 INFO L225 Difference]: With dead ends: 41 [2022-04-27 14:34:49,901 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 14:34:49,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-27 14:34:49,905 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:49,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:34:49,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 14:34:49,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-27 14:34:49,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:49,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:34:49,926 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:34:49,926 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:34:49,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:49,928 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-27 14:34:49,928 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-27 14:34:49,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:49,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:49,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-27 14:34:49,929 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-27 14:34:49,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:49,931 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-27 14:34:49,931 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-27 14:34:49,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:49,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:49,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:49,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:49,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:34:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-27 14:34:49,934 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2022-04-27 14:34:49,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:49,935 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-27 14:34:49,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:49,935 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-27 14:34:49,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 14:34:49,935 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:49,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:49,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:34:49,936 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:49,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:49,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 1 times [2022-04-27 14:34:49,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:49,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552240183] [2022-04-27 14:34:49,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:49,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:49,952 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:49,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [774484905] [2022-04-27 14:34:49,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:49,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:49,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:49,954 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-27 14:34:49,955 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-27 14:34:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:49,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 14:34:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:50,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:50,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {155#true} call ULTIMATE.init(); {155#true} is VALID [2022-04-27 14:34:50,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:50,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#(<= ~counter~0 0)} assume true; {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:50,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#(<= ~counter~0 0)} {155#true} #57#return; {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:50,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#(<= ~counter~0 0)} call #t~ret6 := main(); {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:50,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:50,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {179#(<= |main_#t~post5| 0)} is VALID [2022-04-27 14:34:50,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {179#(<= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {156#false} is VALID [2022-04-27 14:34:50,126 INFO L272 TraceCheckUtils]: 8: Hoare triple {156#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {156#false} is VALID [2022-04-27 14:34:50,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {156#false} ~cond := #in~cond; {156#false} is VALID [2022-04-27 14:34:50,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {156#false} assume 0 == ~cond; {156#false} is VALID [2022-04-27 14:34:50,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {156#false} assume !false; {156#false} is VALID [2022-04-27 14:34:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:34:50,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:34:50,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:50,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552240183] [2022-04-27 14:34:50,128 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:50,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774484905] [2022-04-27 14:34:50,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774484905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:34:50,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:34:50,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:34:50,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289212379] [2022-04-27 14:34:50,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:34:50,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:34:50,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:50,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:50,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:50,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 14:34:50,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:50,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 14:34:50,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:34:50,146 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:50,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:50,197 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-27 14:34:50,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 14:34:50,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:34:50,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-27 14:34:50,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:50,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-27 14:34:50,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-04-27 14:34:50,239 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-27 14:34:50,242 INFO L225 Difference]: With dead ends: 28 [2022-04-27 14:34:50,242 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 14:34:50,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:34:50,244 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:50,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:34:50,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 14:34:50,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 14:34:50,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:50,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:34:50,254 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:34:50,254 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:34:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:50,257 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 14:34:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 14:34:50,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:50,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:50,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 14:34:50,258 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 14:34:50,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:50,262 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 14:34:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 14:34:50,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:50,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:50,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:50,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:50,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:34:50,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-27 14:34:50,265 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-04-27 14:34:50,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:50,266 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-27 14:34:50,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 14:34:50,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 14:34:50,267 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:50,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:50,285 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-27 14:34:50,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:50,481 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:50,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:50,482 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 1 times [2022-04-27 14:34:50,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:50,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813532255] [2022-04-27 14:34:50,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:50,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:50,510 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:50,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [164694649] [2022-04-27 14:34:50,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:50,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:50,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:50,519 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-27 14:34:50,522 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-27 14:34:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:50,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:34:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:50,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:50,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {305#true} call ULTIMATE.init(); {305#true} is VALID [2022-04-27 14:34:50,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {305#true} is VALID [2022-04-27 14:34:50,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {305#true} assume true; {305#true} is VALID [2022-04-27 14:34:50,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {305#true} {305#true} #57#return; {305#true} is VALID [2022-04-27 14:34:50,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {305#true} call #t~ret6 := main(); {305#true} is VALID [2022-04-27 14:34:50,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {305#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:50,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:50,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:50,647 INFO L272 TraceCheckUtils]: 8: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {335#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:50,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {335#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:50,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {306#false} is VALID [2022-04-27 14:34:50,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {306#false} assume !false; {306#false} is VALID [2022-04-27 14:34:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:34:50,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:34:50,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:50,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813532255] [2022-04-27 14:34:50,657 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:50,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164694649] [2022-04-27 14:34:50,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164694649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:34:50,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:34:50,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:34:50,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350477570] [2022-04-27 14:34:50,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:34:50,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:34:50,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:50,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:50,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:50,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:34:50,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:50,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:34:50,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:34:50,668 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:50,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:50,760 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-27 14:34:50,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:34:50,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:34:50,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:50,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:50,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 14:34:50,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 14:34:50,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-27 14:34:50,796 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-27 14:34:50,798 INFO L225 Difference]: With dead ends: 30 [2022-04-27 14:34:50,798 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 14:34:50,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-27 14:34:50,801 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 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-27 14:34:50,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:34:50,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 14:34:50,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 14:34:50,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:50,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:34:50,811 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:34:50,811 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:34:50,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:50,816 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:34:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:34:50,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:50,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:50,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 14:34:50,817 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 14:34:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:50,820 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:34:50,820 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:34:50,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:50,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:50,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:50,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:34:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-27 14:34:50,824 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12 [2022-04-27 14:34:50,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:50,824 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-27 14:34:50,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:34:50,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 14:34:50,828 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:50,828 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:50,847 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-27 14:34:51,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 14:34:51,042 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:51,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:51,043 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 1 times [2022-04-27 14:34:51,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:51,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679094827] [2022-04-27 14:34:51,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:51,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:51,053 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:51,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2002624190] [2022-04-27 14:34:51,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:51,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:51,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:51,058 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-27 14:34:51,060 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-27 14:34:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:51,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:34:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:51,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:51,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2022-04-27 14:34:51,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:51,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#(<= ~counter~0 0)} assume true; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:51,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {489#(<= ~counter~0 0)} {481#true} #57#return; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:51,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {489#(<= ~counter~0 0)} call #t~ret6 := main(); {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:51,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:51,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {489#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:51,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {505#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:51,240 INFO L272 TraceCheckUtils]: 8: Hoare triple {505#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:51,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {505#(<= ~counter~0 1)} ~cond := #in~cond; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:51,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {505#(<= ~counter~0 1)} assume !(0 == ~cond); {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:51,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {505#(<= ~counter~0 1)} assume true; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:51,244 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {505#(<= ~counter~0 1)} {505#(<= ~counter~0 1)} #51#return; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:51,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {505#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:51,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {505#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {530#(<= |main_#t~post5| 1)} is VALID [2022-04-27 14:34:51,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {482#false} is VALID [2022-04-27 14:34:51,245 INFO L272 TraceCheckUtils]: 16: Hoare triple {482#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {482#false} is VALID [2022-04-27 14:34:51,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2022-04-27 14:34:51,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2022-04-27 14:34:51,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-04-27 14:34:51,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:34:51,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:34:51,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-04-27 14:34:51,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2022-04-27 14:34:51,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2022-04-27 14:34:51,373 INFO L272 TraceCheckUtils]: 16: Hoare triple {482#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {482#false} is VALID [2022-04-27 14:34:51,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {558#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {482#false} is VALID [2022-04-27 14:34:51,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {562#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {558#(< |main_#t~post5| 20)} is VALID [2022-04-27 14:34:51,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {562#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {562#(< ~counter~0 20)} is VALID [2022-04-27 14:34:51,375 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {481#true} {562#(< ~counter~0 20)} #51#return; {562#(< ~counter~0 20)} is VALID [2022-04-27 14:34:51,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {481#true} assume true; {481#true} is VALID [2022-04-27 14:34:51,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {481#true} assume !(0 == ~cond); {481#true} is VALID [2022-04-27 14:34:51,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {481#true} ~cond := #in~cond; {481#true} is VALID [2022-04-27 14:34:51,375 INFO L272 TraceCheckUtils]: 8: Hoare triple {562#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {481#true} is VALID [2022-04-27 14:34:51,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {562#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {562#(< ~counter~0 20)} is VALID [2022-04-27 14:34:51,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {587#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {562#(< ~counter~0 20)} is VALID [2022-04-27 14:34:51,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {587#(< ~counter~0 19)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {587#(< ~counter~0 19)} is VALID [2022-04-27 14:34:51,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {587#(< ~counter~0 19)} call #t~ret6 := main(); {587#(< ~counter~0 19)} is VALID [2022-04-27 14:34:51,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {587#(< ~counter~0 19)} {481#true} #57#return; {587#(< ~counter~0 19)} is VALID [2022-04-27 14:34:51,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {587#(< ~counter~0 19)} assume true; {587#(< ~counter~0 19)} is VALID [2022-04-27 14:34:51,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {587#(< ~counter~0 19)} is VALID [2022-04-27 14:34:51,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2022-04-27 14:34:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:34:51,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:51,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679094827] [2022-04-27 14:34:51,381 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:51,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002624190] [2022-04-27 14:34:51,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002624190] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:34:51,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:34:51,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 14:34:51,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083530227] [2022-04-27 14:34:51,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:34:51,382 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-27 14:34:51,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:51,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:34:51,403 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-27 14:34:51,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:34:51,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:51,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:34:51,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:34:51,404 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:34:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:51,554 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-27 14:34:51,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:34:51,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-27 14:34:51,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:34:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2022-04-27 14:34:51,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:34:51,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2022-04-27 14:34:51,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 70 transitions. [2022-04-27 14:34:51,604 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-27 14:34:51,605 INFO L225 Difference]: With dead ends: 60 [2022-04-27 14:34:51,605 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 14:34:51,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:34:51,606 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:51,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 90 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:34:51,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 14:34:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-27 14:34:51,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:51,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:34:51,620 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:34:51,620 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:34:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:51,622 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 14:34:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:34:51,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:51,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:51,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 52 states. [2022-04-27 14:34:51,623 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 52 states. [2022-04-27 14:34:51,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:51,624 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 14:34:51,624 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:34:51,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:51,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:51,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:51,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:51,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:34:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-27 14:34:51,626 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 20 [2022-04-27 14:34:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:51,627 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-27 14:34:51,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:34:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-27 14:34:51,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 14:34:51,627 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:51,627 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:51,647 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-27 14:34:51,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:51,848 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:51,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:51,848 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 1 times [2022-04-27 14:34:51,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:51,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493231515] [2022-04-27 14:34:51,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:51,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:51,856 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:51,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1237654145] [2022-04-27 14:34:51,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:51,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:51,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:51,857 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-27 14:34:51,858 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-27 14:34:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:51,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:34:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:51,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:52,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {875#true} call ULTIMATE.init(); {875#true} is VALID [2022-04-27 14:34:52,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {875#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {875#true} is VALID [2022-04-27 14:34:52,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {875#true} assume true; {875#true} is VALID [2022-04-27 14:34:52,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {875#true} {875#true} #57#return; {875#true} is VALID [2022-04-27 14:34:52,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {875#true} call #t~ret6 := main(); {875#true} is VALID [2022-04-27 14:34:52,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {875#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:52,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:52,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:52,005 INFO L272 TraceCheckUtils]: 8: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {875#true} is VALID [2022-04-27 14:34:52,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {875#true} ~cond := #in~cond; {875#true} is VALID [2022-04-27 14:34:52,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {875#true} assume !(0 == ~cond); {875#true} is VALID [2022-04-27 14:34:52,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {875#true} assume true; {875#true} is VALID [2022-04-27 14:34:52,005 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {875#true} {895#(and (= main_~x~0 0) (= main_~y~0 0))} #51#return; {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:52,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:34:52,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:34:52,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:34:52,007 INFO L272 TraceCheckUtils]: 16: Hoare triple {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:52,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:52,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {876#false} is VALID [2022-04-27 14:34:52,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {876#false} assume !false; {876#false} is VALID [2022-04-27 14:34:52,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:34:52,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:17,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {876#false} assume !false; {876#false} is VALID [2022-04-27 14:35:17,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {876#false} is VALID [2022-04-27 14:35:17,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:17,187 INFO L272 TraceCheckUtils]: 16: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:17,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:35:17,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:35:17,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:35:17,211 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {875#true} {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #51#return; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:35:17,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {875#true} assume true; {875#true} is VALID [2022-04-27 14:35:17,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {875#true} assume !(0 == ~cond); {875#true} is VALID [2022-04-27 14:35:17,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {875#true} ~cond := #in~cond; {875#true} is VALID [2022-04-27 14:35:17,211 INFO L272 TraceCheckUtils]: 8: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {875#true} is VALID [2022-04-27 14:35:17,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:35:17,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:35:17,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {875#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:35:17,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {875#true} call #t~ret6 := main(); {875#true} is VALID [2022-04-27 14:35:17,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {875#true} {875#true} #57#return; {875#true} is VALID [2022-04-27 14:35:17,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {875#true} assume true; {875#true} is VALID [2022-04-27 14:35:17,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {875#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {875#true} is VALID [2022-04-27 14:35:17,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {875#true} call ULTIMATE.init(); {875#true} is VALID [2022-04-27 14:35:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 14:35:17,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:17,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493231515] [2022-04-27 14:35:17,214 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:17,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237654145] [2022-04-27 14:35:17,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237654145] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:35:17,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:35:17,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:35:17,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022355210] [2022-04-27 14:35:17,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:35:17,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 14:35:17,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:17,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:35:17,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:17,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:35:17,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:17,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:35:17,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=28, Unknown=1, NotChecked=0, Total=42 [2022-04-27 14:35:17,234 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:35:17,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:17,321 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-04-27 14:35:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:35:17,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 14:35:17,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:17,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:35:17,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-27 14:35:17,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:35:17,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-27 14:35:17,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-27 14:35:17,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:17,350 INFO L225 Difference]: With dead ends: 62 [2022-04-27 14:35:17,350 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 14:35:17,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=17, Invalid=38, Unknown=1, NotChecked=0, Total=56 [2022-04-27 14:35:17,351 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:17,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:35:17,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 14:35:17,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2022-04-27 14:35:17,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:17,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:17,366 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:17,366 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:17,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:17,367 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-04-27 14:35:17,367 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-27 14:35:17,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:17,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:17,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-04-27 14:35:17,368 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-04-27 14:35:17,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:17,369 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-04-27 14:35:17,369 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-27 14:35:17,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:17,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:17,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:17,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:17,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-04-27 14:35:17,371 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 20 [2022-04-27 14:35:17,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:17,371 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-04-27 14:35:17,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:35:17,371 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-04-27 14:35:17,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 14:35:17,371 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:17,372 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:17,399 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-27 14:35:17,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:17,602 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:17,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:17,603 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 1 times [2022-04-27 14:35:17,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:17,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378516340] [2022-04-27 14:35:17,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:17,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:17,611 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:17,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1993553316] [2022-04-27 14:35:17,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:17,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:17,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:17,612 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-27 14:35:17,613 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-27 14:35:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:17,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 14:35:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:17,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:17,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {1257#true} call ULTIMATE.init(); {1257#true} is VALID [2022-04-27 14:35:17,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {1257#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1257#true} is VALID [2022-04-27 14:35:17,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {1257#true} assume true; {1257#true} is VALID [2022-04-27 14:35:17,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1257#true} {1257#true} #57#return; {1257#true} is VALID [2022-04-27 14:35:17,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {1257#true} call #t~ret6 := main(); {1257#true} is VALID [2022-04-27 14:35:17,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {1257#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:17,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:17,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:17,988 INFO L272 TraceCheckUtils]: 8: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1257#true} is VALID [2022-04-27 14:35:17,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {1257#true} ~cond := #in~cond; {1257#true} is VALID [2022-04-27 14:35:17,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {1257#true} assume !(0 == ~cond); {1257#true} is VALID [2022-04-27 14:35:17,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {1257#true} assume true; {1257#true} is VALID [2022-04-27 14:35:17,989 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1257#true} {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #51#return; {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:17,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:35:17,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:35:17,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:35:17,991 INFO L272 TraceCheckUtils]: 16: Hoare triple {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1257#true} is VALID [2022-04-27 14:35:17,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {1257#true} ~cond := #in~cond; {1315#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:17,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {1315#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:35:17,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:35:17,992 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} #51#return; {1326#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:35:17,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {1326#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1330#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:17,993 INFO L272 TraceCheckUtils]: 22: Hoare triple {1330#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1334#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:17,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {1334#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1338#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:17,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {1338#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1258#false} is VALID [2022-04-27 14:35:17,994 INFO L290 TraceCheckUtils]: 25: Hoare triple {1258#false} assume !false; {1258#false} is VALID [2022-04-27 14:35:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 14:35:17,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:50,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:50,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378516340] [2022-04-27 14:35:50,577 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:50,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993553316] [2022-04-27 14:35:50,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993553316] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:35:50,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:35:50,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:35:50,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512084119] [2022-04-27 14:35:50,577 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:50,577 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-27 14:35:50,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:50,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:50,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:50,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:35:50,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:50,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:35:50,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=162, Unknown=2, NotChecked=0, Total=210 [2022-04-27 14:35:50,597 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:50,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:50,854 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-04-27 14:35:50,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:35:50,854 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-27 14:35:50,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-27 14:35:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:50,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-27 14:35:50,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2022-04-27 14:35:50,882 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-27 14:35:50,884 INFO L225 Difference]: With dead ends: 50 [2022-04-27 14:35:50,884 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 14:35:50,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=67, Invalid=237, Unknown=2, NotChecked=0, Total=306 [2022-04-27 14:35:50,884 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:50,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 112 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:35:50,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 14:35:50,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 14:35:50,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:50,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:50,904 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:50,904 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:50,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:50,905 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-27 14:35:50,905 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-27 14:35:50,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:50,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:50,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 14:35:50,905 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 14:35:50,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:50,906 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-27 14:35:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-27 14:35:50,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:50,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:50,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:50,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-04-27 14:35:50,908 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 26 [2022-04-27 14:35:50,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:50,908 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-04-27 14:35:50,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:50,908 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-27 14:35:50,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 14:35:50,909 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:50,909 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:50,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 14:35:51,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:51,124 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:51,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:51,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1036651181, now seen corresponding path program 2 times [2022-04-27 14:35:51,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:51,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236021874] [2022-04-27 14:35:51,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:51,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:51,134 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:51,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2030970872] [2022-04-27 14:35:51,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:35:51,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:51,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:51,141 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-27 14:35:51,142 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-27 14:35:51,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:35:51,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:35:51,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 14:35:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:51,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:51,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1622#true} is VALID [2022-04-27 14:35:51,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {1622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1622#true} is VALID [2022-04-27 14:35:51,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-27 14:35:51,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1622#true} {1622#true} #57#return; {1622#true} is VALID [2022-04-27 14:35:51,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {1622#true} call #t~ret6 := main(); {1622#true} is VALID [2022-04-27 14:35:51,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {1622#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:51,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:51,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:51,488 INFO L272 TraceCheckUtils]: 8: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1622#true} is VALID [2022-04-27 14:35:51,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-27 14:35:51,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-27 14:35:51,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-27 14:35:51,489 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1622#true} {1642#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:51,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:35:51,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:35:51,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:35:51,490 INFO L272 TraceCheckUtils]: 16: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1622#true} is VALID [2022-04-27 14:35:51,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-27 14:35:51,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-27 14:35:51,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-27 14:35:51,491 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1622#true} {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #51#return; {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:35:51,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:35:51,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:35:51,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:35:51,492 INFO L272 TraceCheckUtils]: 24: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1622#true} is VALID [2022-04-27 14:35:51,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-27 14:35:51,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-27 14:35:51,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-27 14:35:51,493 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1622#true} {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #51#return; {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:35:51,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1717#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-27 14:35:51,494 INFO L272 TraceCheckUtils]: 30: Hoare triple {1717#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1721#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:51,495 INFO L290 TraceCheckUtils]: 31: Hoare triple {1721#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1725#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:51,495 INFO L290 TraceCheckUtils]: 32: Hoare triple {1725#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1623#false} is VALID [2022-04-27 14:35:51,495 INFO L290 TraceCheckUtils]: 33: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2022-04-27 14:35:51,495 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:35:51,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:51,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:51,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236021874] [2022-04-27 14:35:51,805 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:51,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030970872] [2022-04-27 14:35:51,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030970872] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:35:51,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:35:51,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 14:35:51,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378938832] [2022-04-27 14:35:51,806 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:51,806 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-27 14:35:51,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:51,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:51,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:51,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:35:51,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:51,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:35:51,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:35:51,823 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:52,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:52,042 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-27 14:35:52,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:35:52,042 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-27 14:35:52,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:52,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 14:35:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:52,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 14:35:52,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-27 14:35:52,079 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-27 14:35:52,080 INFO L225 Difference]: With dead ends: 50 [2022-04-27 14:35:52,080 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 14:35:52,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 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-27 14:35:52,081 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:52,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 132 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:35:52,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 14:35:52,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 14:35:52,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:52,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:52,101 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:52,101 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:52,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:52,102 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-27 14:35:52,102 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-27 14:35:52,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:52,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:52,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 14:35:52,103 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 14:35:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:52,104 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-27 14:35:52,104 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-27 14:35:52,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:52,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:52,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:52,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:52,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-04-27 14:35:52,106 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 34 [2022-04-27 14:35:52,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:52,108 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-04-27 14:35:52,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:52,108 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-27 14:35:52,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 14:35:52,110 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:52,110 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:52,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 14:35:52,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:52,332 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:52,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:52,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1383171920, now seen corresponding path program 3 times [2022-04-27 14:35:52,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:52,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330114060] [2022-04-27 14:35:52,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:52,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:52,353 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:52,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [233012337] [2022-04-27 14:35:52,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:35:52,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:52,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:52,360 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-27 14:35:52,361 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-27 14:35:52,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:35:52,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:35:52,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 14:35:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:52,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:52,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {2005#true} call ULTIMATE.init(); {2005#true} is VALID [2022-04-27 14:35:52,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {2005#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2005#true} is VALID [2022-04-27 14:35:52,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:35:52,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2005#true} {2005#true} #57#return; {2005#true} is VALID [2022-04-27 14:35:52,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {2005#true} call #t~ret6 := main(); {2005#true} is VALID [2022-04-27 14:35:52,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {2005#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:52,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:52,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:52,699 INFO L272 TraceCheckUtils]: 8: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2005#true} is VALID [2022-04-27 14:35:52,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-04-27 14:35:52,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-04-27 14:35:52,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:35:52,700 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2005#true} {2025#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:52,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:52,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:52,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:52,701 INFO L272 TraceCheckUtils]: 16: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2005#true} is VALID [2022-04-27 14:35:52,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-04-27 14:35:52,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-04-27 14:35:52,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:35:52,702 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2005#true} {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #51#return; {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:52,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:35:52,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:35:52,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:35:52,703 INFO L272 TraceCheckUtils]: 24: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2005#true} is VALID [2022-04-27 14:35:52,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-04-27 14:35:52,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-04-27 14:35:52,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:35:52,704 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2005#true} {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #51#return; {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:35:52,704 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:35:52,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:35:52,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:35:52,705 INFO L272 TraceCheckUtils]: 32: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2005#true} is VALID [2022-04-27 14:35:52,705 INFO L290 TraceCheckUtils]: 33: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-04-27 14:35:52,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-04-27 14:35:52,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:35:52,706 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2005#true} {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #51#return; {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:35:52,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {2125#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:35:52,707 INFO L272 TraceCheckUtils]: 38: Hoare triple {2125#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2129#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:52,707 INFO L290 TraceCheckUtils]: 39: Hoare triple {2129#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2133#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:52,707 INFO L290 TraceCheckUtils]: 40: Hoare triple {2133#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2006#false} is VALID [2022-04-27 14:35:52,707 INFO L290 TraceCheckUtils]: 41: Hoare triple {2006#false} assume !false; {2006#false} is VALID [2022-04-27 14:35:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:35:52,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:52,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:52,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330114060] [2022-04-27 14:35:52,990 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:52,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233012337] [2022-04-27 14:35:52,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233012337] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:35:52,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:35:52,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 14:35:52,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537268341] [2022-04-27 14:35:52,991 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:52,991 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-04-27 14:35:52,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:52,991 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:53,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:53,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 14:35:53,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:53,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 14:35:53,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:35:53,015 INFO L87 Difference]: Start difference. First operand 45 states and 46 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:53,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:53,319 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-27 14:35:53,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:35:53,319 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-04-27 14:35:53,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:53,320 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:53,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-27 14:35:53,320 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-27 14:35:53,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-27 14:35:53,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:53,351 INFO L225 Difference]: With dead ends: 52 [2022-04-27 14:35:53,351 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 14:35:53,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 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-27 14:35:53,352 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:53,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 168 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:35:53,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 14:35:53,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-27 14:35:53,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:53,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:53,374 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:53,375 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:53,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:53,376 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-27 14:35:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-27 14:35:53,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:53,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:53,377 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-27 14:35:53,377 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-27 14:35:53,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:53,379 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-27 14:35:53,379 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-27 14:35:53,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:53,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:53,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:53,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:53,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-27 14:35:53,382 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42 [2022-04-27 14:35:53,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:53,383 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-27 14:35:53,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:53,383 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-27 14:35:53,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 14:35:53,384 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:53,384 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:53,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 14:35:53,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:53,601 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:53,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:53,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1386691371, now seen corresponding path program 2 times [2022-04-27 14:35:53,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:53,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233133109] [2022-04-27 14:35:53,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:53,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:53,611 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:53,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [983863496] [2022-04-27 14:35:53,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:35:53,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:53,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:53,623 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-27 14:35:53,639 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-27 14:35:53,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:35:53,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:35:53,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 14:35:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:53,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:53,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {2423#true} call ULTIMATE.init(); {2423#true} is VALID [2022-04-27 14:35:53,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {2423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:53,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {2431#(<= ~counter~0 0)} assume true; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:53,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2431#(<= ~counter~0 0)} {2423#true} #57#return; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:53,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {2431#(<= ~counter~0 0)} call #t~ret6 := main(); {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:53,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {2431#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:53,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {2431#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:53,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {2447#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:53,915 INFO L272 TraceCheckUtils]: 8: Hoare triple {2447#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:53,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {2447#(<= ~counter~0 1)} ~cond := #in~cond; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:53,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {2447#(<= ~counter~0 1)} assume !(0 == ~cond); {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:53,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {2447#(<= ~counter~0 1)} assume true; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:53,916 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2447#(<= ~counter~0 1)} {2447#(<= ~counter~0 1)} #51#return; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:53,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {2447#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:53,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {2447#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:53,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {2472#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:53,917 INFO L272 TraceCheckUtils]: 16: Hoare triple {2472#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:53,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {2472#(<= ~counter~0 2)} ~cond := #in~cond; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:53,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {2472#(<= ~counter~0 2)} assume !(0 == ~cond); {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:53,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {2472#(<= ~counter~0 2)} assume true; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:53,918 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2472#(<= ~counter~0 2)} {2472#(<= ~counter~0 2)} #51#return; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:53,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {2472#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:53,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {2472#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:53,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {2497#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:53,925 INFO L272 TraceCheckUtils]: 24: Hoare triple {2497#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:53,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {2497#(<= ~counter~0 3)} ~cond := #in~cond; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:53,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {2497#(<= ~counter~0 3)} assume !(0 == ~cond); {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:53,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {2497#(<= ~counter~0 3)} assume true; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:53,930 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2497#(<= ~counter~0 3)} {2497#(<= ~counter~0 3)} #51#return; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:53,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {2497#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:53,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {2497#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:53,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {2522#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:53,932 INFO L272 TraceCheckUtils]: 32: Hoare triple {2522#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:53,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {2522#(<= ~counter~0 4)} ~cond := #in~cond; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:53,934 INFO L290 TraceCheckUtils]: 34: Hoare triple {2522#(<= ~counter~0 4)} assume !(0 == ~cond); {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:53,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {2522#(<= ~counter~0 4)} assume true; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:53,938 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2522#(<= ~counter~0 4)} {2522#(<= ~counter~0 4)} #51#return; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:53,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {2522#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:53,938 INFO L290 TraceCheckUtils]: 38: Hoare triple {2522#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2547#(<= |main_#t~post5| 4)} is VALID [2022-04-27 14:35:53,939 INFO L290 TraceCheckUtils]: 39: Hoare triple {2547#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {2424#false} is VALID [2022-04-27 14:35:53,939 INFO L272 TraceCheckUtils]: 40: Hoare triple {2424#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2424#false} is VALID [2022-04-27 14:35:53,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {2424#false} ~cond := #in~cond; {2424#false} is VALID [2022-04-27 14:35:53,939 INFO L290 TraceCheckUtils]: 42: Hoare triple {2424#false} assume 0 == ~cond; {2424#false} is VALID [2022-04-27 14:35:53,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {2424#false} assume !false; {2424#false} is VALID [2022-04-27 14:35:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:35:53,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:54,132 INFO L290 TraceCheckUtils]: 43: Hoare triple {2424#false} assume !false; {2424#false} is VALID [2022-04-27 14:35:54,132 INFO L290 TraceCheckUtils]: 42: Hoare triple {2424#false} assume 0 == ~cond; {2424#false} is VALID [2022-04-27 14:35:54,132 INFO L290 TraceCheckUtils]: 41: Hoare triple {2424#false} ~cond := #in~cond; {2424#false} is VALID [2022-04-27 14:35:54,132 INFO L272 TraceCheckUtils]: 40: Hoare triple {2424#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2424#false} is VALID [2022-04-27 14:35:54,133 INFO L290 TraceCheckUtils]: 39: Hoare triple {2575#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {2424#false} is VALID [2022-04-27 14:35:54,133 INFO L290 TraceCheckUtils]: 38: Hoare triple {2579#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2575#(< |main_#t~post5| 20)} is VALID [2022-04-27 14:35:54,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {2579#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2579#(< ~counter~0 20)} is VALID [2022-04-27 14:35:54,134 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2423#true} {2579#(< ~counter~0 20)} #51#return; {2579#(< ~counter~0 20)} is VALID [2022-04-27 14:35:54,134 INFO L290 TraceCheckUtils]: 35: Hoare triple {2423#true} assume true; {2423#true} is VALID [2022-04-27 14:35:54,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {2423#true} assume !(0 == ~cond); {2423#true} is VALID [2022-04-27 14:35:54,134 INFO L290 TraceCheckUtils]: 33: Hoare triple {2423#true} ~cond := #in~cond; {2423#true} is VALID [2022-04-27 14:35:54,134 INFO L272 TraceCheckUtils]: 32: Hoare triple {2579#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2423#true} is VALID [2022-04-27 14:35:54,134 INFO L290 TraceCheckUtils]: 31: Hoare triple {2579#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {2579#(< ~counter~0 20)} is VALID [2022-04-27 14:35:54,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {2604#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2579#(< ~counter~0 20)} is VALID [2022-04-27 14:35:54,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {2604#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2604#(< ~counter~0 19)} is VALID [2022-04-27 14:35:54,135 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2423#true} {2604#(< ~counter~0 19)} #51#return; {2604#(< ~counter~0 19)} is VALID [2022-04-27 14:35:54,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {2423#true} assume true; {2423#true} is VALID [2022-04-27 14:35:54,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {2423#true} assume !(0 == ~cond); {2423#true} is VALID [2022-04-27 14:35:54,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {2423#true} ~cond := #in~cond; {2423#true} is VALID [2022-04-27 14:35:54,137 INFO L272 TraceCheckUtils]: 24: Hoare triple {2604#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2423#true} is VALID [2022-04-27 14:35:54,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {2604#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {2604#(< ~counter~0 19)} is VALID [2022-04-27 14:35:54,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {2629#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2604#(< ~counter~0 19)} is VALID [2022-04-27 14:35:54,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {2629#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2629#(< ~counter~0 18)} is VALID [2022-04-27 14:35:54,138 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2423#true} {2629#(< ~counter~0 18)} #51#return; {2629#(< ~counter~0 18)} is VALID [2022-04-27 14:35:54,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {2423#true} assume true; {2423#true} is VALID [2022-04-27 14:35:54,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {2423#true} assume !(0 == ~cond); {2423#true} is VALID [2022-04-27 14:35:54,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {2423#true} ~cond := #in~cond; {2423#true} is VALID [2022-04-27 14:35:54,138 INFO L272 TraceCheckUtils]: 16: Hoare triple {2629#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2423#true} is VALID [2022-04-27 14:35:54,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {2629#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {2629#(< ~counter~0 18)} is VALID [2022-04-27 14:35:54,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {2654#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2629#(< ~counter~0 18)} is VALID [2022-04-27 14:35:54,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {2654#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2654#(< ~counter~0 17)} is VALID [2022-04-27 14:35:54,140 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2423#true} {2654#(< ~counter~0 17)} #51#return; {2654#(< ~counter~0 17)} is VALID [2022-04-27 14:35:54,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {2423#true} assume true; {2423#true} is VALID [2022-04-27 14:35:54,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {2423#true} assume !(0 == ~cond); {2423#true} is VALID [2022-04-27 14:35:54,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {2423#true} ~cond := #in~cond; {2423#true} is VALID [2022-04-27 14:35:54,140 INFO L272 TraceCheckUtils]: 8: Hoare triple {2654#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2423#true} is VALID [2022-04-27 14:35:54,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {2654#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {2654#(< ~counter~0 17)} is VALID [2022-04-27 14:35:54,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {2679#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2654#(< ~counter~0 17)} is VALID [2022-04-27 14:35:54,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {2679#(< ~counter~0 16)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2679#(< ~counter~0 16)} is VALID [2022-04-27 14:35:54,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {2679#(< ~counter~0 16)} call #t~ret6 := main(); {2679#(< ~counter~0 16)} is VALID [2022-04-27 14:35:54,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2679#(< ~counter~0 16)} {2423#true} #57#return; {2679#(< ~counter~0 16)} is VALID [2022-04-27 14:35:54,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {2679#(< ~counter~0 16)} assume true; {2679#(< ~counter~0 16)} is VALID [2022-04-27 14:35:54,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {2423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2679#(< ~counter~0 16)} is VALID [2022-04-27 14:35:54,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {2423#true} call ULTIMATE.init(); {2423#true} is VALID [2022-04-27 14:35:54,144 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:35:54,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:54,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233133109] [2022-04-27 14:35:54,145 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:54,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983863496] [2022-04-27 14:35:54,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983863496] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:35:54,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:35:54,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 14:35:54,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089053256] [2022-04-27 14:35:54,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:54,148 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 44 [2022-04-27 14:35:54,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:54,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:35:54,203 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-27 14:35:54,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:35:54,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:54,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:35:54,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:35:54,204 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:35:54,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:54,595 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2022-04-27 14:35:54,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 14:35:54,595 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 44 [2022-04-27 14:35:54,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:35:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 123 transitions. [2022-04-27 14:35:54,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:35:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 123 transitions. [2022-04-27 14:35:54,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 123 transitions. [2022-04-27 14:35:54,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:54,693 INFO L225 Difference]: With dead ends: 123 [2022-04-27 14:35:54,693 INFO L226 Difference]: Without dead ends: 118 [2022-04-27 14:35:54,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-27 14:35:54,694 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 120 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:54,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 148 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:35:54,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-27 14:35:54,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 93. [2022-04-27 14:35:54,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:54,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:54,734 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:54,734 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:54,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:54,737 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2022-04-27 14:35:54,737 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2022-04-27 14:35:54,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:54,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:54,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 118 states. [2022-04-27 14:35:54,739 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 118 states. [2022-04-27 14:35:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:54,741 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2022-04-27 14:35:54,741 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2022-04-27 14:35:54,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:54,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:54,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:54,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2022-04-27 14:35:54,747 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 44 [2022-04-27 14:35:54,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:54,747 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2022-04-27 14:35:54,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:35:54,747 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2022-04-27 14:35:54,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 14:35:54,748 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:54,748 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:54,779 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-27 14:35:54,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 14:35:54,967 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:54,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:54,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1037185971, now seen corresponding path program 4 times [2022-04-27 14:35:54,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:54,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893698028] [2022-04-27 14:35:54,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:54,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:54,978 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:54,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [483548375] [2022-04-27 14:35:54,979 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:35:54,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:54,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:54,980 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-27 14:35:54,981 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-27 14:35:55,046 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:35:55,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:35:55,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 14:35:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:55,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:55,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {3256#true} call ULTIMATE.init(); {3256#true} is VALID [2022-04-27 14:35:55,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {3256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3256#true} is VALID [2022-04-27 14:35:55,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:35:55,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3256#true} {3256#true} #57#return; {3256#true} is VALID [2022-04-27 14:35:55,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {3256#true} call #t~ret6 := main(); {3256#true} is VALID [2022-04-27 14:35:55,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {3256#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:55,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {3276#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:55,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {3276#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {3276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:55,372 INFO L272 TraceCheckUtils]: 8: Hoare triple {3276#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3256#true} is VALID [2022-04-27 14:35:55,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {3256#true} ~cond := #in~cond; {3256#true} is VALID [2022-04-27 14:35:55,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {3256#true} assume !(0 == ~cond); {3256#true} is VALID [2022-04-27 14:35:55,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:35:55,377 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3256#true} {3276#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {3276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:55,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {3276#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:35:55,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:35:55,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:35:55,378 INFO L272 TraceCheckUtils]: 16: Hoare triple {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3256#true} is VALID [2022-04-27 14:35:55,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {3256#true} ~cond := #in~cond; {3256#true} is VALID [2022-04-27 14:35:55,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {3256#true} assume !(0 == ~cond); {3256#true} is VALID [2022-04-27 14:35:55,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:35:55,378 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3256#true} {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #51#return; {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:35:55,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:35:55,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:35:55,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:35:55,380 INFO L272 TraceCheckUtils]: 24: Hoare triple {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3256#true} is VALID [2022-04-27 14:35:55,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {3256#true} ~cond := #in~cond; {3256#true} is VALID [2022-04-27 14:35:55,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {3256#true} assume !(0 == ~cond); {3256#true} is VALID [2022-04-27 14:35:55,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:35:55,380 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3256#true} {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #51#return; {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:35:55,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:35:55,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:35:55,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:35:55,381 INFO L272 TraceCheckUtils]: 32: Hoare triple {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3256#true} is VALID [2022-04-27 14:35:55,381 INFO L290 TraceCheckUtils]: 33: Hoare triple {3256#true} ~cond := #in~cond; {3256#true} is VALID [2022-04-27 14:35:55,381 INFO L290 TraceCheckUtils]: 34: Hoare triple {3256#true} assume !(0 == ~cond); {3256#true} is VALID [2022-04-27 14:35:55,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:35:55,382 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3256#true} {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #51#return; {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:35:55,382 INFO L290 TraceCheckUtils]: 37: Hoare triple {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:35:55,382 INFO L290 TraceCheckUtils]: 38: Hoare triple {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:35:55,383 INFO L290 TraceCheckUtils]: 39: Hoare triple {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:35:55,383 INFO L272 TraceCheckUtils]: 40: Hoare triple {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3256#true} is VALID [2022-04-27 14:35:55,383 INFO L290 TraceCheckUtils]: 41: Hoare triple {3256#true} ~cond := #in~cond; {3256#true} is VALID [2022-04-27 14:35:55,383 INFO L290 TraceCheckUtils]: 42: Hoare triple {3256#true} assume !(0 == ~cond); {3256#true} is VALID [2022-04-27 14:35:55,383 INFO L290 TraceCheckUtils]: 43: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:35:55,383 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3256#true} {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #51#return; {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:35:55,384 INFO L290 TraceCheckUtils]: 45: Hoare triple {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {3401#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:35:55,384 INFO L272 TraceCheckUtils]: 46: Hoare triple {3401#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3405#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:55,385 INFO L290 TraceCheckUtils]: 47: Hoare triple {3405#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3409#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:55,385 INFO L290 TraceCheckUtils]: 48: Hoare triple {3409#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3257#false} is VALID [2022-04-27 14:35:55,385 INFO L290 TraceCheckUtils]: 49: Hoare triple {3257#false} assume !false; {3257#false} is VALID [2022-04-27 14:35:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 14:35:55,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:55,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:55,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893698028] [2022-04-27 14:35:55,653 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:55,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483548375] [2022-04-27 14:35:55,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483548375] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:35:55,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:35:55,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:35:55,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639378970] [2022-04-27 14:35:55,654 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:55,655 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-04-27 14:35:55,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:55,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:55,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:55,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:35:55,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:55,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:35:55,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:35:55,682 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:56,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:56,058 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-04-27 14:35:56,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:35:56,058 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-04-27 14:35:56,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:56,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-27 14:35:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:56,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-27 14:35:56,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 49 transitions. [2022-04-27 14:35:56,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:56,094 INFO L225 Difference]: With dead ends: 98 [2022-04-27 14:35:56,094 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 14:35:56,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:35:56,095 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:56,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 208 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:35:56,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 14:35:56,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 14:35:56,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:56,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:56,136 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:56,136 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:56,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:56,138 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-04-27 14:35:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-27 14:35:56,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:56,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:56,138 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:35:56,138 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:35:56,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:56,140 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-04-27 14:35:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-27 14:35:56,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:56,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:56,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:56,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:56,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2022-04-27 14:35:56,142 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 50 [2022-04-27 14:35:56,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:56,142 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2022-04-27 14:35:56,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:56,142 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-27 14:35:56,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 14:35:56,143 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:56,143 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:56,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 14:35:56,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 14:35:56,359 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:56,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:56,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1795671114, now seen corresponding path program 5 times [2022-04-27 14:35:56,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:56,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780668847] [2022-04-27 14:35:56,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:56,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:56,369 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:56,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1829137245] [2022-04-27 14:35:56,369 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:35:56,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:56,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:56,370 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-27 14:35:56,374 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-27 14:35:56,537 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 14:35:56,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:35:56,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:35:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:56,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:56,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {3917#true} call ULTIMATE.init(); {3917#true} is VALID [2022-04-27 14:35:56,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {3917#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3917#true} is VALID [2022-04-27 14:35:56,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:35:56,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3917#true} {3917#true} #57#return; {3917#true} is VALID [2022-04-27 14:35:56,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {3917#true} call #t~ret6 := main(); {3917#true} is VALID [2022-04-27 14:35:56,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {3917#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3937#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:56,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {3937#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3937#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:56,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {3937#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {3937#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:56,936 INFO L272 TraceCheckUtils]: 8: Hoare triple {3937#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:35:56,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:35:56,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:35:56,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:35:56,936 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3917#true} {3937#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {3937#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:56,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {3937#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:56,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:56,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:56,938 INFO L272 TraceCheckUtils]: 16: Hoare triple {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:35:56,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:35:56,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:35:56,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:35:56,938 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3917#true} {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #51#return; {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:56,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:35:56,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:35:56,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:35:56,940 INFO L272 TraceCheckUtils]: 24: Hoare triple {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:35:56,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:35:56,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:35:56,940 INFO L290 TraceCheckUtils]: 27: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:35:56,940 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3917#true} {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #51#return; {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:35:56,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:35:56,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:35:56,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:35:56,942 INFO L272 TraceCheckUtils]: 32: Hoare triple {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:35:56,942 INFO L290 TraceCheckUtils]: 33: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:35:56,942 INFO L290 TraceCheckUtils]: 34: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:35:56,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:35:56,942 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3917#true} {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #51#return; {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:35:56,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:35:56,943 INFO L290 TraceCheckUtils]: 38: Hoare triple {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:35:56,943 INFO L290 TraceCheckUtils]: 39: Hoare triple {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:35:56,944 INFO L272 TraceCheckUtils]: 40: Hoare triple {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:35:56,944 INFO L290 TraceCheckUtils]: 41: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:35:56,944 INFO L290 TraceCheckUtils]: 42: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:35:56,944 INFO L290 TraceCheckUtils]: 43: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:35:56,944 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3917#true} {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #51#return; {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:35:56,945 INFO L290 TraceCheckUtils]: 45: Hoare triple {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:35:56,945 INFO L290 TraceCheckUtils]: 46: Hoare triple {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:35:56,945 INFO L290 TraceCheckUtils]: 47: Hoare triple {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:35:56,945 INFO L272 TraceCheckUtils]: 48: Hoare triple {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:35:56,946 INFO L290 TraceCheckUtils]: 49: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:35:56,946 INFO L290 TraceCheckUtils]: 50: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:35:56,946 INFO L290 TraceCheckUtils]: 51: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:35:56,946 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3917#true} {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #51#return; {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:35:56,947 INFO L290 TraceCheckUtils]: 53: Hoare triple {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {4087#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:35:56,947 INFO L272 TraceCheckUtils]: 54: Hoare triple {4087#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4091#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:56,948 INFO L290 TraceCheckUtils]: 55: Hoare triple {4091#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4095#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:56,948 INFO L290 TraceCheckUtils]: 56: Hoare triple {4095#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3918#false} is VALID [2022-04-27 14:35:56,948 INFO L290 TraceCheckUtils]: 57: Hoare triple {3918#false} assume !false; {3918#false} is VALID [2022-04-27 14:35:56,948 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 14:35:56,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:57,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:57,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780668847] [2022-04-27 14:35:57,201 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:57,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829137245] [2022-04-27 14:35:57,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829137245] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:35:57,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:35:57,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 14:35:57,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728193050] [2022-04-27 14:35:57,201 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:57,201 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 58 [2022-04-27 14:35:57,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:57,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:35:57,230 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-27 14:35:57,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:35:57,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:57,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:35:57,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:35:57,231 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:35:57,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:57,699 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2022-04-27 14:35:57,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 14:35:57,699 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 58 [2022-04-27 14:35:57,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:57,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:35:57,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-27 14:35:57,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:35:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-27 14:35:57,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 54 transitions. [2022-04-27 14:35:57,741 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-27 14:35:57,742 INFO L225 Difference]: With dead ends: 98 [2022-04-27 14:35:57,742 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 14:35:57,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:35:57,743 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:57,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 252 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:35:57,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 14:35:57,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 14:35:57,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:57,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:57,790 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:57,790 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:57,792 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-27 14:35:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-27 14:35:57,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:57,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:57,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:35:57,792 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:35:57,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:57,793 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-27 14:35:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-27 14:35:57,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:57,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:57,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:57,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:57,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2022-04-27 14:35:57,795 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 58 [2022-04-27 14:35:57,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:57,795 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2022-04-27 14:35:57,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:35:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-27 14:35:57,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 14:35:57,796 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:57,796 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:57,802 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-27 14:35:58,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 14:35:58,000 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:58,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:58,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1180930233, now seen corresponding path program 6 times [2022-04-27 14:35:58,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:58,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657178892] [2022-04-27 14:35:58,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:58,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:58,013 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:58,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1316706576] [2022-04-27 14:35:58,013 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:35:58,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:58,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:58,014 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-27 14:35:58,054 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-27 14:35:58,237 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 14:35:58,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:35:58,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-27 14:35:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:58,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:58,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {4603#true} call ULTIMATE.init(); {4603#true} is VALID [2022-04-27 14:35:58,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {4603#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4603#true} is VALID [2022-04-27 14:35:58,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:35:58,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4603#true} {4603#true} #57#return; {4603#true} is VALID [2022-04-27 14:35:58,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {4603#true} call #t~ret6 := main(); {4603#true} is VALID [2022-04-27 14:35:58,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {4603#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {4623#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:58,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {4623#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4623#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:58,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {4623#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {4623#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:58,697 INFO L272 TraceCheckUtils]: 8: Hoare triple {4623#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4603#true} is VALID [2022-04-27 14:35:58,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {4603#true} ~cond := #in~cond; {4603#true} is VALID [2022-04-27 14:35:58,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {4603#true} assume !(0 == ~cond); {4603#true} is VALID [2022-04-27 14:35:58,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:35:58,698 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4603#true} {4623#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {4623#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:58,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {4623#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:58,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:58,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:58,699 INFO L272 TraceCheckUtils]: 16: Hoare triple {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4603#true} is VALID [2022-04-27 14:35:58,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {4603#true} ~cond := #in~cond; {4603#true} is VALID [2022-04-27 14:35:58,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {4603#true} assume !(0 == ~cond); {4603#true} is VALID [2022-04-27 14:35:58,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:35:58,699 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4603#true} {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #51#return; {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:58,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4673#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-27 14:35:58,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {4673#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4673#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-27 14:35:58,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {4673#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {4673#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-27 14:35:58,700 INFO L272 TraceCheckUtils]: 24: Hoare triple {4673#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4603#true} is VALID [2022-04-27 14:35:58,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {4603#true} ~cond := #in~cond; {4603#true} is VALID [2022-04-27 14:35:58,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {4603#true} assume !(0 == ~cond); {4603#true} is VALID [2022-04-27 14:35:58,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:35:58,701 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4603#true} {4673#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #51#return; {4673#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-27 14:35:58,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {4673#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4698#(and (= 2 (+ (- 1) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:35:58,701 INFO L290 TraceCheckUtils]: 30: Hoare triple {4698#(and (= 2 (+ (- 1) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4698#(and (= 2 (+ (- 1) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:35:58,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {4698#(and (= 2 (+ (- 1) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {4698#(and (= 2 (+ (- 1) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:35:58,702 INFO L272 TraceCheckUtils]: 32: Hoare triple {4698#(and (= 2 (+ (- 1) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4603#true} is VALID [2022-04-27 14:35:58,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {4603#true} ~cond := #in~cond; {4603#true} is VALID [2022-04-27 14:35:58,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {4603#true} assume !(0 == ~cond); {4603#true} is VALID [2022-04-27 14:35:58,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:35:58,702 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4603#true} {4698#(and (= 2 (+ (- 1) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 3))} #51#return; {4698#(and (= 2 (+ (- 1) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:35:58,703 INFO L290 TraceCheckUtils]: 37: Hoare triple {4698#(and (= 2 (+ (- 1) main_~y~0)) (< 1 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 + ~x~0; {4723#(and (< 1 main_~k~0) (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:35:58,703 INFO L290 TraceCheckUtils]: 38: Hoare triple {4723#(and (< 1 main_~k~0) (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4723#(and (< 1 main_~k~0) (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:35:58,703 INFO L290 TraceCheckUtils]: 39: Hoare triple {4723#(and (< 1 main_~k~0) (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {4723#(and (< 1 main_~k~0) (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:35:58,703 INFO L272 TraceCheckUtils]: 40: Hoare triple {4723#(and (< 1 main_~k~0) (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4603#true} is VALID [2022-04-27 14:35:58,704 INFO L290 TraceCheckUtils]: 41: Hoare triple {4603#true} ~cond := #in~cond; {4603#true} is VALID [2022-04-27 14:35:58,704 INFO L290 TraceCheckUtils]: 42: Hoare triple {4603#true} assume !(0 == ~cond); {4603#true} is VALID [2022-04-27 14:35:58,704 INFO L290 TraceCheckUtils]: 43: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:35:58,704 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4603#true} {4723#(and (< 1 main_~k~0) (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #51#return; {4723#(and (< 1 main_~k~0) (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:35:58,704 INFO L290 TraceCheckUtils]: 45: Hoare triple {4723#(and (< 1 main_~k~0) (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4748#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-27 14:35:58,705 INFO L290 TraceCheckUtils]: 46: Hoare triple {4748#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4748#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-27 14:35:58,705 INFO L290 TraceCheckUtils]: 47: Hoare triple {4748#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} assume !!(#t~post5 < 20);havoc #t~post5; {4748#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-27 14:35:58,705 INFO L272 TraceCheckUtils]: 48: Hoare triple {4748#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4603#true} is VALID [2022-04-27 14:35:58,705 INFO L290 TraceCheckUtils]: 49: Hoare triple {4603#true} ~cond := #in~cond; {4603#true} is VALID [2022-04-27 14:35:58,705 INFO L290 TraceCheckUtils]: 50: Hoare triple {4603#true} assume !(0 == ~cond); {4603#true} is VALID [2022-04-27 14:35:58,705 INFO L290 TraceCheckUtils]: 51: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:35:58,706 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4603#true} {4748#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} #51#return; {4748#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-27 14:35:58,706 INFO L290 TraceCheckUtils]: 53: Hoare triple {4748#(and (< 1 main_~k~0) (= (+ 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 + ~x~0; {4773#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:35:58,706 INFO L290 TraceCheckUtils]: 54: Hoare triple {4773#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4773#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:35:58,707 INFO L290 TraceCheckUtils]: 55: Hoare triple {4773#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {4773#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:35:58,707 INFO L272 TraceCheckUtils]: 56: Hoare triple {4773#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4603#true} is VALID [2022-04-27 14:35:58,707 INFO L290 TraceCheckUtils]: 57: Hoare triple {4603#true} ~cond := #in~cond; {4603#true} is VALID [2022-04-27 14:35:58,707 INFO L290 TraceCheckUtils]: 58: Hoare triple {4603#true} assume !(0 == ~cond); {4603#true} is VALID [2022-04-27 14:35:58,707 INFO L290 TraceCheckUtils]: 59: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:35:58,707 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4603#true} {4773#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #51#return; {4773#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:35:58,708 INFO L290 TraceCheckUtils]: 61: Hoare triple {4773#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {4798#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:35:58,708 INFO L272 TraceCheckUtils]: 62: Hoare triple {4798#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4802#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:58,709 INFO L290 TraceCheckUtils]: 63: Hoare triple {4802#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4806#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:58,709 INFO L290 TraceCheckUtils]: 64: Hoare triple {4806#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4604#false} is VALID [2022-04-27 14:35:58,709 INFO L290 TraceCheckUtils]: 65: Hoare triple {4604#false} assume !false; {4604#false} is VALID [2022-04-27 14:35:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 14 proven. 84 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 14:35:58,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:59,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:59,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657178892] [2022-04-27 14:35:59,374 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:59,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316706576] [2022-04-27 14:35:59,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316706576] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:35:59,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:35:59,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 14:35:59,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116663686] [2022-04-27 14:35:59,374 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:59,374 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 66 [2022-04-27 14:35:59,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:59,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:35:59,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:59,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 14:35:59,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:59,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 14:35:59,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:35:59,406 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:35:59,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:59,974 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2022-04-27 14:35:59,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:35:59,975 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 66 [2022-04-27 14:35:59,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:59,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:35:59,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-27 14:35:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:35:59,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-27 14:35:59,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-04-27 14:36:00,025 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-27 14:36:00,026 INFO L225 Difference]: With dead ends: 98 [2022-04-27 14:36:00,026 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 14:36:00,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-27 14:36:00,027 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:00,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 300 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:36:00,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 14:36:00,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 14:36:00,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:00,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:00,072 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:00,072 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:00,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:00,073 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-04-27 14:36:00,073 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-27 14:36:00,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:00,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:00,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:36:00,074 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:36:00,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:00,076 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-04-27 14:36:00,076 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-27 14:36:00,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:00,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:00,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:00,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:00,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2022-04-27 14:36:00,079 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 66 [2022-04-27 14:36:00,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:00,079 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2022-04-27 14:36:00,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:36:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-27 14:36:00,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-27 14:36:00,079 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:00,079 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:00,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-27 14:36:00,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 14:36:00,284 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:00,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:00,284 INFO L85 PathProgramCache]: Analyzing trace with hash -763940164, now seen corresponding path program 7 times [2022-04-27 14:36:00,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:00,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892562450] [2022-04-27 14:36:00,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:00,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:00,301 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:00,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [844758128] [2022-04-27 14:36:00,301 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:36:00,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:00,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:00,303 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-27 14:36:00,304 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-27 14:36:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:00,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-27 14:36:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:00,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:01,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {5414#true} call ULTIMATE.init(); {5414#true} is VALID [2022-04-27 14:36:01,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {5414#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5414#true} is VALID [2022-04-27 14:36:01,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {5414#true} assume true; {5414#true} is VALID [2022-04-27 14:36:01,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5414#true} {5414#true} #57#return; {5414#true} is VALID [2022-04-27 14:36:01,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {5414#true} call #t~ret6 := main(); {5414#true} is VALID [2022-04-27 14:36:01,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {5414#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {5434#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:01,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {5434#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5434#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:01,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {5434#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {5434#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:01,237 INFO L272 TraceCheckUtils]: 8: Hoare triple {5434#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5414#true} is VALID [2022-04-27 14:36:01,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {5414#true} ~cond := #in~cond; {5414#true} is VALID [2022-04-27 14:36:01,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {5414#true} assume !(0 == ~cond); {5414#true} is VALID [2022-04-27 14:36:01,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {5414#true} assume true; {5414#true} is VALID [2022-04-27 14:36:01,237 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5414#true} {5434#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {5434#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:01,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {5434#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5459#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:01,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {5459#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5459#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:01,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {5459#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {5459#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:01,239 INFO L272 TraceCheckUtils]: 16: Hoare triple {5459#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5414#true} is VALID [2022-04-27 14:36:01,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {5414#true} ~cond := #in~cond; {5414#true} is VALID [2022-04-27 14:36:01,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {5414#true} assume !(0 == ~cond); {5414#true} is VALID [2022-04-27 14:36:01,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {5414#true} assume true; {5414#true} is VALID [2022-04-27 14:36:01,239 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5414#true} {5459#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #51#return; {5459#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:01,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {5459#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5484#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:36:01,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {5484#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5484#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:36:01,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {5484#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {5484#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:36:01,240 INFO L272 TraceCheckUtils]: 24: Hoare triple {5484#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5414#true} is VALID [2022-04-27 14:36:01,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {5414#true} ~cond := #in~cond; {5414#true} is VALID [2022-04-27 14:36:01,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {5414#true} assume !(0 == ~cond); {5414#true} is VALID [2022-04-27 14:36:01,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {5414#true} assume true; {5414#true} is VALID [2022-04-27 14:36:01,241 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5414#true} {5484#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} #51#return; {5484#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:36:01,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {5484#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5509#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:36:01,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {5509#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5509#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:36:01,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {5509#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {5509#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:36:01,242 INFO L272 TraceCheckUtils]: 32: Hoare triple {5509#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5414#true} is VALID [2022-04-27 14:36:01,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {5414#true} ~cond := #in~cond; {5414#true} is VALID [2022-04-27 14:36:01,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {5414#true} assume !(0 == ~cond); {5414#true} is VALID [2022-04-27 14:36:01,242 INFO L290 TraceCheckUtils]: 35: Hoare triple {5414#true} assume true; {5414#true} is VALID [2022-04-27 14:36:01,242 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5414#true} {5509#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #51#return; {5509#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:36:01,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {5509#(and (= main_~y~0 3) (< 0 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 + ~x~0; {5534#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:36:01,243 INFO L290 TraceCheckUtils]: 38: Hoare triple {5534#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5534#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:36:01,243 INFO L290 TraceCheckUtils]: 39: Hoare triple {5534#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {5534#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:36:01,244 INFO L272 TraceCheckUtils]: 40: Hoare triple {5534#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5414#true} is VALID [2022-04-27 14:36:01,244 INFO L290 TraceCheckUtils]: 41: Hoare triple {5414#true} ~cond := #in~cond; {5414#true} is VALID [2022-04-27 14:36:01,244 INFO L290 TraceCheckUtils]: 42: Hoare triple {5414#true} assume !(0 == ~cond); {5414#true} is VALID [2022-04-27 14:36:01,244 INFO L290 TraceCheckUtils]: 43: Hoare triple {5414#true} assume true; {5414#true} is VALID [2022-04-27 14:36:01,244 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5414#true} {5534#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} #51#return; {5534#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:36:01,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {5534#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5559#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:36:01,245 INFO L290 TraceCheckUtils]: 46: Hoare triple {5559#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5559#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:36:01,245 INFO L290 TraceCheckUtils]: 47: Hoare triple {5559#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {5559#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:36:01,245 INFO L272 TraceCheckUtils]: 48: Hoare triple {5559#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5414#true} is VALID [2022-04-27 14:36:01,245 INFO L290 TraceCheckUtils]: 49: Hoare triple {5414#true} ~cond := #in~cond; {5414#true} is VALID [2022-04-27 14:36:01,245 INFO L290 TraceCheckUtils]: 50: Hoare triple {5414#true} assume !(0 == ~cond); {5414#true} is VALID [2022-04-27 14:36:01,245 INFO L290 TraceCheckUtils]: 51: Hoare triple {5414#true} assume true; {5414#true} is VALID [2022-04-27 14:36:01,246 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5414#true} {5559#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} #51#return; {5559#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:36:01,246 INFO L290 TraceCheckUtils]: 53: Hoare triple {5559#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5584#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 14:36:01,247 INFO L290 TraceCheckUtils]: 54: Hoare triple {5584#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5584#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 14:36:01,247 INFO L290 TraceCheckUtils]: 55: Hoare triple {5584#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {5584#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 14:36:01,247 INFO L272 TraceCheckUtils]: 56: Hoare triple {5584#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5414#true} is VALID [2022-04-27 14:36:01,247 INFO L290 TraceCheckUtils]: 57: Hoare triple {5414#true} ~cond := #in~cond; {5414#true} is VALID [2022-04-27 14:36:01,247 INFO L290 TraceCheckUtils]: 58: Hoare triple {5414#true} assume !(0 == ~cond); {5414#true} is VALID [2022-04-27 14:36:01,247 INFO L290 TraceCheckUtils]: 59: Hoare triple {5414#true} assume true; {5414#true} is VALID [2022-04-27 14:36:01,248 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5414#true} {5584#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} #51#return; {5584#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 14:36:01,248 INFO L290 TraceCheckUtils]: 61: Hoare triple {5584#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5609#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:36:01,248 INFO L290 TraceCheckUtils]: 62: Hoare triple {5609#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5609#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:36:01,249 INFO L290 TraceCheckUtils]: 63: Hoare triple {5609#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {5609#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:36:01,249 INFO L272 TraceCheckUtils]: 64: Hoare triple {5609#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5414#true} is VALID [2022-04-27 14:36:01,249 INFO L290 TraceCheckUtils]: 65: Hoare triple {5414#true} ~cond := #in~cond; {5414#true} is VALID [2022-04-27 14:36:01,249 INFO L290 TraceCheckUtils]: 66: Hoare triple {5414#true} assume !(0 == ~cond); {5414#true} is VALID [2022-04-27 14:36:01,249 INFO L290 TraceCheckUtils]: 67: Hoare triple {5414#true} assume true; {5414#true} is VALID [2022-04-27 14:36:01,249 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5414#true} {5609#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #51#return; {5609#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:36:01,250 INFO L290 TraceCheckUtils]: 69: Hoare triple {5609#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {5634#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:36:01,250 INFO L272 TraceCheckUtils]: 70: Hoare triple {5634#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:01,251 INFO L290 TraceCheckUtils]: 71: Hoare triple {5638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:01,251 INFO L290 TraceCheckUtils]: 72: Hoare triple {5642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5415#false} is VALID [2022-04-27 14:36:01,251 INFO L290 TraceCheckUtils]: 73: Hoare triple {5415#false} assume !false; {5415#false} is VALID [2022-04-27 14:36:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 16 proven. 112 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 14:36:01,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:01,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:01,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892562450] [2022-04-27 14:36:01,986 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:01,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844758128] [2022-04-27 14:36:01,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844758128] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:01,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:01,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 14:36:01,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675152514] [2022-04-27 14:36:01,987 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:01,987 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74 [2022-04-27 14:36:01,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:01,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:36:02,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:02,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 14:36:02,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:02,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 14:36:02,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2022-04-27 14:36:02,025 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:36:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:02,691 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2022-04-27 14:36:02,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:36:02,691 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74 [2022-04-27 14:36:02,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:02,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:36:02,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-27 14:36:02,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:36:02,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-27 14:36:02,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2022-04-27 14:36:02,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:02,741 INFO L225 Difference]: With dead ends: 98 [2022-04-27 14:36:02,741 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 14:36:02,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2022-04-27 14:36:02,742 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:02,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 352 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:36:02,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 14:36:02,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 14:36:02,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:02,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:02,785 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:02,786 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:02,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:02,787 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2022-04-27 14:36:02,787 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-27 14:36:02,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:02,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:02,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:36:02,787 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:36:02,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:02,788 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2022-04-27 14:36:02,789 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-27 14:36:02,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:02,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:02,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:02,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:02,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2022-04-27 14:36:02,790 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 74 [2022-04-27 14:36:02,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:02,790 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2022-04-27 14:36:02,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:36:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-27 14:36:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-27 14:36:02,791 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:02,791 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:02,796 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-27 14:36:02,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 14:36:02,996 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:02,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:02,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1500110401, now seen corresponding path program 8 times [2022-04-27 14:36:02,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:02,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381765892] [2022-04-27 14:36:02,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:02,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:03,013 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:03,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [198069840] [2022-04-27 14:36:03,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:36:03,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:03,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:03,014 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-27 14:36:03,015 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-27 14:36:03,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:36:03,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:03,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 14:36:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:03,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:03,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {6300#true} call ULTIMATE.init(); {6300#true} is VALID [2022-04-27 14:36:03,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {6300#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6300#true} is VALID [2022-04-27 14:36:03,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {6300#true} assume true; {6300#true} is VALID [2022-04-27 14:36:03,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6300#true} {6300#true} #57#return; {6300#true} is VALID [2022-04-27 14:36:03,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {6300#true} call #t~ret6 := main(); {6300#true} is VALID [2022-04-27 14:36:03,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {6300#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {6320#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:03,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {6320#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6320#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:03,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {6320#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {6320#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:03,946 INFO L272 TraceCheckUtils]: 8: Hoare triple {6320#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6300#true} is VALID [2022-04-27 14:36:03,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {6300#true} ~cond := #in~cond; {6300#true} is VALID [2022-04-27 14:36:03,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {6300#true} assume !(0 == ~cond); {6300#true} is VALID [2022-04-27 14:36:03,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {6300#true} assume true; {6300#true} is VALID [2022-04-27 14:36:03,947 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6300#true} {6320#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {6320#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:03,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {6320#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6345#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:03,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {6345#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6345#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:03,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {6345#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {6345#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:03,948 INFO L272 TraceCheckUtils]: 16: Hoare triple {6345#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6300#true} is VALID [2022-04-27 14:36:03,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {6300#true} ~cond := #in~cond; {6300#true} is VALID [2022-04-27 14:36:03,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {6300#true} assume !(0 == ~cond); {6300#true} is VALID [2022-04-27 14:36:03,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {6300#true} assume true; {6300#true} is VALID [2022-04-27 14:36:03,948 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6300#true} {6345#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {6345#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:03,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {6345#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6370#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:36:03,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {6370#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6370#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:36:03,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {6370#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {6370#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:36:03,949 INFO L272 TraceCheckUtils]: 24: Hoare triple {6370#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6300#true} is VALID [2022-04-27 14:36:03,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {6300#true} ~cond := #in~cond; {6300#true} is VALID [2022-04-27 14:36:03,949 INFO L290 TraceCheckUtils]: 26: Hoare triple {6300#true} assume !(0 == ~cond); {6300#true} is VALID [2022-04-27 14:36:03,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {6300#true} assume true; {6300#true} is VALID [2022-04-27 14:36:03,950 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6300#true} {6370#(and (= main_~y~0 2) (= main_~c~0 2))} #51#return; {6370#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:36:03,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {6370#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6395#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:03,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {6395#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6395#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:03,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {6395#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {6395#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:03,951 INFO L272 TraceCheckUtils]: 32: Hoare triple {6395#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6300#true} is VALID [2022-04-27 14:36:03,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {6300#true} ~cond := #in~cond; {6300#true} is VALID [2022-04-27 14:36:03,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {6300#true} assume !(0 == ~cond); {6300#true} is VALID [2022-04-27 14:36:03,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {6300#true} assume true; {6300#true} is VALID [2022-04-27 14:36:03,951 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6300#true} {6395#(and (= main_~y~0 3) (= main_~c~0 3))} #51#return; {6395#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:03,952 INFO L290 TraceCheckUtils]: 37: Hoare triple {6395#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6420#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:36:03,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {6420#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6420#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:36:03,952 INFO L290 TraceCheckUtils]: 39: Hoare triple {6420#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {6420#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:36:03,952 INFO L272 TraceCheckUtils]: 40: Hoare triple {6420#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6300#true} is VALID [2022-04-27 14:36:03,953 INFO L290 TraceCheckUtils]: 41: Hoare triple {6300#true} ~cond := #in~cond; {6300#true} is VALID [2022-04-27 14:36:03,953 INFO L290 TraceCheckUtils]: 42: Hoare triple {6300#true} assume !(0 == ~cond); {6300#true} is VALID [2022-04-27 14:36:03,953 INFO L290 TraceCheckUtils]: 43: Hoare triple {6300#true} assume true; {6300#true} is VALID [2022-04-27 14:36:03,953 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6300#true} {6420#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #51#return; {6420#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:36:03,953 INFO L290 TraceCheckUtils]: 45: Hoare triple {6420#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6445#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:03,954 INFO L290 TraceCheckUtils]: 46: Hoare triple {6445#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6445#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:03,954 INFO L290 TraceCheckUtils]: 47: Hoare triple {6445#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {6445#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:03,954 INFO L272 TraceCheckUtils]: 48: Hoare triple {6445#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6300#true} is VALID [2022-04-27 14:36:03,954 INFO L290 TraceCheckUtils]: 49: Hoare triple {6300#true} ~cond := #in~cond; {6300#true} is VALID [2022-04-27 14:36:03,954 INFO L290 TraceCheckUtils]: 50: Hoare triple {6300#true} assume !(0 == ~cond); {6300#true} is VALID [2022-04-27 14:36:03,954 INFO L290 TraceCheckUtils]: 51: Hoare triple {6300#true} assume true; {6300#true} is VALID [2022-04-27 14:36:03,955 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6300#true} {6445#(and (= 5 main_~c~0) (= 5 main_~y~0))} #51#return; {6445#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:03,955 INFO L290 TraceCheckUtils]: 53: Hoare triple {6445#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6470#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:03,955 INFO L290 TraceCheckUtils]: 54: Hoare triple {6470#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6470#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:03,956 INFO L290 TraceCheckUtils]: 55: Hoare triple {6470#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {6470#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:03,956 INFO L272 TraceCheckUtils]: 56: Hoare triple {6470#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6300#true} is VALID [2022-04-27 14:36:03,956 INFO L290 TraceCheckUtils]: 57: Hoare triple {6300#true} ~cond := #in~cond; {6300#true} is VALID [2022-04-27 14:36:03,956 INFO L290 TraceCheckUtils]: 58: Hoare triple {6300#true} assume !(0 == ~cond); {6300#true} is VALID [2022-04-27 14:36:03,956 INFO L290 TraceCheckUtils]: 59: Hoare triple {6300#true} assume true; {6300#true} is VALID [2022-04-27 14:36:03,956 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6300#true} {6470#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #51#return; {6470#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:03,957 INFO L290 TraceCheckUtils]: 61: Hoare triple {6470#(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 + ~x~0; {6495#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:03,957 INFO L290 TraceCheckUtils]: 62: Hoare triple {6495#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6495#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:03,957 INFO L290 TraceCheckUtils]: 63: Hoare triple {6495#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {6495#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:03,957 INFO L272 TraceCheckUtils]: 64: Hoare triple {6495#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6300#true} is VALID [2022-04-27 14:36:03,957 INFO L290 TraceCheckUtils]: 65: Hoare triple {6300#true} ~cond := #in~cond; {6300#true} is VALID [2022-04-27 14:36:03,957 INFO L290 TraceCheckUtils]: 66: Hoare triple {6300#true} assume !(0 == ~cond); {6300#true} is VALID [2022-04-27 14:36:03,957 INFO L290 TraceCheckUtils]: 67: Hoare triple {6300#true} assume true; {6300#true} is VALID [2022-04-27 14:36:03,958 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6300#true} {6495#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #51#return; {6495#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:03,958 INFO L290 TraceCheckUtils]: 69: Hoare triple {6495#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6520#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:36:03,958 INFO L290 TraceCheckUtils]: 70: Hoare triple {6520#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6520#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:36:03,959 INFO L290 TraceCheckUtils]: 71: Hoare triple {6520#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {6520#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:36:03,959 INFO L272 TraceCheckUtils]: 72: Hoare triple {6520#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6300#true} is VALID [2022-04-27 14:36:03,959 INFO L290 TraceCheckUtils]: 73: Hoare triple {6300#true} ~cond := #in~cond; {6300#true} is VALID [2022-04-27 14:36:03,959 INFO L290 TraceCheckUtils]: 74: Hoare triple {6300#true} assume !(0 == ~cond); {6300#true} is VALID [2022-04-27 14:36:03,959 INFO L290 TraceCheckUtils]: 75: Hoare triple {6300#true} assume true; {6300#true} is VALID [2022-04-27 14:36:03,959 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {6300#true} {6520#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #51#return; {6520#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:36:03,960 INFO L290 TraceCheckUtils]: 77: Hoare triple {6520#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {6545#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 14:36:03,960 INFO L272 TraceCheckUtils]: 78: Hoare triple {6545#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6549#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:03,961 INFO L290 TraceCheckUtils]: 79: Hoare triple {6549#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6553#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:03,961 INFO L290 TraceCheckUtils]: 80: Hoare triple {6553#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6301#false} is VALID [2022-04-27 14:36:03,961 INFO L290 TraceCheckUtils]: 81: Hoare triple {6301#false} assume !false; {6301#false} is VALID [2022-04-27 14:36:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 18 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-27 14:36:03,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:04,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:04,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381765892] [2022-04-27 14:36:04,228 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:04,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198069840] [2022-04-27 14:36:04,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198069840] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:04,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:04,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 14:36:04,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377055950] [2022-04-27 14:36:04,228 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:04,228 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 82 [2022-04-27 14:36:04,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:04,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:36:04,267 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-27 14:36:04,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:36:04,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:04,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:36:04,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:36:04,268 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:36:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:05,060 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-04-27 14:36:05,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 14:36:05,060 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 82 [2022-04-27 14:36:05,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:36:05,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-27 14:36:05,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:36:05,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-27 14:36:05,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 69 transitions. [2022-04-27 14:36:05,112 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-27 14:36:05,113 INFO L225 Difference]: With dead ends: 98 [2022-04-27 14:36:05,113 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 14:36:05,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 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-27 14:36:05,114 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:05,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 408 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:36:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 14:36:05,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 14:36:05,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:05,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:05,175 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:05,175 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:05,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:05,176 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-04-27 14:36:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-27 14:36:05,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:05,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:05,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:36:05,177 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:36:05,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:05,178 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-04-27 14:36:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-27 14:36:05,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:05,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:05,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:05,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:05,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:05,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2022-04-27 14:36:05,180 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 82 [2022-04-27 14:36:05,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:05,180 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2022-04-27 14:36:05,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:36:05,180 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-27 14:36:05,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-27 14:36:05,180 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:05,180 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:05,203 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-27 14:36:05,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 14:36:05,385 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:05,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:05,386 INFO L85 PathProgramCache]: Analyzing trace with hash 488857026, now seen corresponding path program 9 times [2022-04-27 14:36:05,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:05,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428019773] [2022-04-27 14:36:05,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:05,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:05,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:05,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1245741292] [2022-04-27 14:36:05,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:36:05,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:05,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:05,397 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-27 14:36:05,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-27 14:36:05,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-04-27 14:36:05,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:05,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-27 14:36:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:05,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:06,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {7061#true} call ULTIMATE.init(); {7061#true} is VALID [2022-04-27 14:36:06,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {7061#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7061#true} is VALID [2022-04-27 14:36:06,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {7061#true} assume true; {7061#true} is VALID [2022-04-27 14:36:06,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7061#true} {7061#true} #57#return; {7061#true} is VALID [2022-04-27 14:36:06,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {7061#true} call #t~ret6 := main(); {7061#true} is VALID [2022-04-27 14:36:06,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {7061#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {7081#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:06,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {7081#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7081#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:06,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {7081#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {7081#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:06,421 INFO L272 TraceCheckUtils]: 8: Hoare triple {7081#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7061#true} is VALID [2022-04-27 14:36:06,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {7061#true} ~cond := #in~cond; {7061#true} is VALID [2022-04-27 14:36:06,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {7061#true} assume !(0 == ~cond); {7061#true} is VALID [2022-04-27 14:36:06,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {7061#true} assume true; {7061#true} is VALID [2022-04-27 14:36:06,421 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7061#true} {7081#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {7081#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:06,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {7081#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7106#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:06,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {7106#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7106#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:06,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {7106#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {7106#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:06,428 INFO L272 TraceCheckUtils]: 16: Hoare triple {7106#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7061#true} is VALID [2022-04-27 14:36:06,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {7061#true} ~cond := #in~cond; {7061#true} is VALID [2022-04-27 14:36:06,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {7061#true} assume !(0 == ~cond); {7061#true} is VALID [2022-04-27 14:36:06,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {7061#true} assume true; {7061#true} is VALID [2022-04-27 14:36:06,429 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7061#true} {7106#(and (= main_~y~0 1) (= main_~c~0 1))} #51#return; {7106#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:06,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {7106#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7131#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:36:06,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {7131#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7131#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:36:06,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {7131#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {7131#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:36:06,430 INFO L272 TraceCheckUtils]: 24: Hoare triple {7131#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7061#true} is VALID [2022-04-27 14:36:06,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {7061#true} ~cond := #in~cond; {7061#true} is VALID [2022-04-27 14:36:06,430 INFO L290 TraceCheckUtils]: 26: Hoare triple {7061#true} assume !(0 == ~cond); {7061#true} is VALID [2022-04-27 14:36:06,430 INFO L290 TraceCheckUtils]: 27: Hoare triple {7061#true} assume true; {7061#true} is VALID [2022-04-27 14:36:06,431 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7061#true} {7131#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #51#return; {7131#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:36:06,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {7131#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7156#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:36:06,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {7156#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7156#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:36:06,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {7156#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {7156#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:36:06,432 INFO L272 TraceCheckUtils]: 32: Hoare triple {7156#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7061#true} is VALID [2022-04-27 14:36:06,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {7061#true} ~cond := #in~cond; {7061#true} is VALID [2022-04-27 14:36:06,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {7061#true} assume !(0 == ~cond); {7061#true} is VALID [2022-04-27 14:36:06,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {7061#true} assume true; {7061#true} is VALID [2022-04-27 14:36:06,432 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7061#true} {7156#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} #51#return; {7156#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:36:06,433 INFO L290 TraceCheckUtils]: 37: Hoare triple {7156#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7181#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:36:06,433 INFO L290 TraceCheckUtils]: 38: Hoare triple {7181#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7181#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:36:06,434 INFO L290 TraceCheckUtils]: 39: Hoare triple {7181#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {7181#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:36:06,434 INFO L272 TraceCheckUtils]: 40: Hoare triple {7181#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7061#true} is VALID [2022-04-27 14:36:06,434 INFO L290 TraceCheckUtils]: 41: Hoare triple {7061#true} ~cond := #in~cond; {7061#true} is VALID [2022-04-27 14:36:06,434 INFO L290 TraceCheckUtils]: 42: Hoare triple {7061#true} assume !(0 == ~cond); {7061#true} is VALID [2022-04-27 14:36:06,434 INFO L290 TraceCheckUtils]: 43: Hoare triple {7061#true} assume true; {7061#true} is VALID [2022-04-27 14:36:06,434 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7061#true} {7181#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #51#return; {7181#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:36:06,435 INFO L290 TraceCheckUtils]: 45: Hoare triple {7181#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7206#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:06,435 INFO L290 TraceCheckUtils]: 46: Hoare triple {7206#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7206#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:06,435 INFO L290 TraceCheckUtils]: 47: Hoare triple {7206#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {7206#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:06,435 INFO L272 TraceCheckUtils]: 48: Hoare triple {7206#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7061#true} is VALID [2022-04-27 14:36:06,435 INFO L290 TraceCheckUtils]: 49: Hoare triple {7061#true} ~cond := #in~cond; {7061#true} is VALID [2022-04-27 14:36:06,436 INFO L290 TraceCheckUtils]: 50: Hoare triple {7061#true} assume !(0 == ~cond); {7061#true} is VALID [2022-04-27 14:36:06,436 INFO L290 TraceCheckUtils]: 51: Hoare triple {7061#true} assume true; {7061#true} is VALID [2022-04-27 14:36:06,436 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7061#true} {7206#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #51#return; {7206#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:06,436 INFO L290 TraceCheckUtils]: 53: Hoare triple {7206#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7231#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:06,437 INFO L290 TraceCheckUtils]: 54: Hoare triple {7231#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7231#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:06,437 INFO L290 TraceCheckUtils]: 55: Hoare triple {7231#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {7231#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:06,437 INFO L272 TraceCheckUtils]: 56: Hoare triple {7231#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7061#true} is VALID [2022-04-27 14:36:06,437 INFO L290 TraceCheckUtils]: 57: Hoare triple {7061#true} ~cond := #in~cond; {7061#true} is VALID [2022-04-27 14:36:06,437 INFO L290 TraceCheckUtils]: 58: Hoare triple {7061#true} assume !(0 == ~cond); {7061#true} is VALID [2022-04-27 14:36:06,437 INFO L290 TraceCheckUtils]: 59: Hoare triple {7061#true} assume true; {7061#true} is VALID [2022-04-27 14:36:06,438 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7061#true} {7231#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #51#return; {7231#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:06,438 INFO L290 TraceCheckUtils]: 61: Hoare triple {7231#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7256#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-27 14:36:06,439 INFO L290 TraceCheckUtils]: 62: Hoare triple {7256#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7256#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-27 14:36:06,439 INFO L290 TraceCheckUtils]: 63: Hoare triple {7256#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {7256#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-27 14:36:06,439 INFO L272 TraceCheckUtils]: 64: Hoare triple {7256#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7061#true} is VALID [2022-04-27 14:36:06,439 INFO L290 TraceCheckUtils]: 65: Hoare triple {7061#true} ~cond := #in~cond; {7061#true} is VALID [2022-04-27 14:36:06,439 INFO L290 TraceCheckUtils]: 66: Hoare triple {7061#true} assume !(0 == ~cond); {7061#true} is VALID [2022-04-27 14:36:06,439 INFO L290 TraceCheckUtils]: 67: Hoare triple {7061#true} assume true; {7061#true} is VALID [2022-04-27 14:36:06,440 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7061#true} {7256#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} #51#return; {7256#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-27 14:36:06,440 INFO L290 TraceCheckUtils]: 69: Hoare triple {7256#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7281#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:36:06,440 INFO L290 TraceCheckUtils]: 70: Hoare triple {7281#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7281#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:36:06,441 INFO L290 TraceCheckUtils]: 71: Hoare triple {7281#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} assume !!(#t~post5 < 20);havoc #t~post5; {7281#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:36:06,441 INFO L272 TraceCheckUtils]: 72: Hoare triple {7281#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7061#true} is VALID [2022-04-27 14:36:06,441 INFO L290 TraceCheckUtils]: 73: Hoare triple {7061#true} ~cond := #in~cond; {7294#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:06,442 INFO L290 TraceCheckUtils]: 74: Hoare triple {7294#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7298#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:36:06,442 INFO L290 TraceCheckUtils]: 75: Hoare triple {7298#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7298#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:36:06,443 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7298#(not (= |__VERIFIER_assert_#in~cond| 0))} {7281#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} #51#return; {7305#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} is VALID [2022-04-27 14:36:06,443 INFO L290 TraceCheckUtils]: 77: Hoare triple {7305#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7309#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 1296) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:36:06,443 INFO L290 TraceCheckUtils]: 78: Hoare triple {7309#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 1296) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7309#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 1296) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:36:06,444 INFO L290 TraceCheckUtils]: 79: Hoare triple {7309#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 1296) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {7309#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 1296) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:36:06,444 INFO L272 TraceCheckUtils]: 80: Hoare triple {7309#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 1296) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7061#true} is VALID [2022-04-27 14:36:06,444 INFO L290 TraceCheckUtils]: 81: Hoare triple {7061#true} ~cond := #in~cond; {7294#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:06,444 INFO L290 TraceCheckUtils]: 82: Hoare triple {7294#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7298#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:36:06,444 INFO L290 TraceCheckUtils]: 83: Hoare triple {7298#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7298#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:36:06,445 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {7298#(not (= |__VERIFIER_assert_#in~cond| 0))} {7309#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 1296) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} #51#return; {7331#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:36:06,446 INFO L290 TraceCheckUtils]: 85: Hoare triple {7331#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {7335#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-27 14:36:06,446 INFO L272 TraceCheckUtils]: 86: Hoare triple {7335#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7339#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:06,447 INFO L290 TraceCheckUtils]: 87: Hoare triple {7339#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7343#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:06,447 INFO L290 TraceCheckUtils]: 88: Hoare triple {7343#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7062#false} is VALID [2022-04-27 14:36:06,447 INFO L290 TraceCheckUtils]: 89: Hoare triple {7062#false} assume !false; {7062#false} is VALID [2022-04-27 14:36:06,447 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 66 proven. 182 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-04-27 14:36:06,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:25,046 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (.cse1 (* 13 c_main_~y~0 c_main_~y~0)) (.cse2 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (or (not (<= (+ (* c_main_~y~0 c_main_~y~0 c_main_~y~0) c_main_~x~0 1 (* 3 (* c_main_~y~0 c_main_~y~0))) (div (+ .cse0 .cse1 4 .cse2) 4))) (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse3 (+ c_main_~y~0 1))) (= (* .cse3 .cse3) (* main_~k~0 .cse3))))) (not (= 0 (mod (+ .cse0 .cse1 .cse2) 4))))) is different from false [2022-04-27 14:36:29,207 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0))))) (not (= 0 (mod (+ (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 13 c_main_~y~0 c_main_~y~0) (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4)))) is different from false [2022-04-27 14:36:29,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:29,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428019773] [2022-04-27 14:36:29,210 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:29,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245741292] [2022-04-27 14:36:29,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245741292] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:29,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:29,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-27 14:36:29,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291561573] [2022-04-27 14:36:29,210 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:29,211 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 90 [2022-04-27 14:36:29,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:29,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:29,257 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-27 14:36:29,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 14:36:29,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:29,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 14:36:29,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=446, Unknown=2, NotChecked=86, Total=600 [2022-04-27 14:36:29,258 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:30,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:30,449 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-27 14:36:30,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 14:36:30,449 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 90 [2022-04-27 14:36:30,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:30,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-04-27 14:36:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-04-27 14:36:30,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 74 transitions. [2022-04-27 14:36:30,507 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-27 14:36:30,508 INFO L225 Difference]: With dead ends: 100 [2022-04-27 14:36:30,508 INFO L226 Difference]: Without dead ends: 95 [2022-04-27 14:36:30,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=87, Invalid=569, Unknown=2, NotChecked=98, Total=756 [2022-04-27 14:36:30,509 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 9 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:30,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 454 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 14:36:30,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-27 14:36:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-04-27 14:36:30,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:30,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:30,567 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:30,568 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:30,571 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2022-04-27 14:36:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-27 14:36:30,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:30,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:30,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 95 states. [2022-04-27 14:36:30,572 INFO L87 Difference]: Start difference. First operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 95 states. [2022-04-27 14:36:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:30,574 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2022-04-27 14:36:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-27 14:36:30,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:30,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:30,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:30,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2022-04-27 14:36:30,575 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 90 [2022-04-27 14:36:30,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:30,575 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2022-04-27 14:36:30,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:30,576 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-27 14:36:30,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-27 14:36:30,576 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:30,577 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:30,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 14:36:30,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:30,781 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:30,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:30,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1958171289, now seen corresponding path program 3 times [2022-04-27 14:36:30,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:30,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460707101] [2022-04-27 14:36:30,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:30,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:30,792 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:30,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1793627790] [2022-04-27 14:36:30,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:36:30,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:30,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:30,793 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:30,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-27 14:36:30,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 14:36:30,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:30,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 14:36:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:30,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:31,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {7866#true} call ULTIMATE.init(); {7866#true} is VALID [2022-04-27 14:36:31,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {7866#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7874#(<= ~counter~0 0)} is VALID [2022-04-27 14:36:31,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {7874#(<= ~counter~0 0)} assume true; {7874#(<= ~counter~0 0)} is VALID [2022-04-27 14:36:31,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7874#(<= ~counter~0 0)} {7866#true} #57#return; {7874#(<= ~counter~0 0)} is VALID [2022-04-27 14:36:31,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {7874#(<= ~counter~0 0)} call #t~ret6 := main(); {7874#(<= ~counter~0 0)} is VALID [2022-04-27 14:36:31,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {7874#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {7874#(<= ~counter~0 0)} is VALID [2022-04-27 14:36:31,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {7874#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7890#(<= ~counter~0 1)} is VALID [2022-04-27 14:36:31,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {7890#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {7890#(<= ~counter~0 1)} is VALID [2022-04-27 14:36:31,302 INFO L272 TraceCheckUtils]: 8: Hoare triple {7890#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7890#(<= ~counter~0 1)} is VALID [2022-04-27 14:36:31,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {7890#(<= ~counter~0 1)} ~cond := #in~cond; {7890#(<= ~counter~0 1)} is VALID [2022-04-27 14:36:31,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {7890#(<= ~counter~0 1)} assume !(0 == ~cond); {7890#(<= ~counter~0 1)} is VALID [2022-04-27 14:36:31,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {7890#(<= ~counter~0 1)} assume true; {7890#(<= ~counter~0 1)} is VALID [2022-04-27 14:36:31,304 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7890#(<= ~counter~0 1)} {7890#(<= ~counter~0 1)} #51#return; {7890#(<= ~counter~0 1)} is VALID [2022-04-27 14:36:31,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {7890#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7890#(<= ~counter~0 1)} is VALID [2022-04-27 14:36:31,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {7890#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7915#(<= ~counter~0 2)} is VALID [2022-04-27 14:36:31,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {7915#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {7915#(<= ~counter~0 2)} is VALID [2022-04-27 14:36:31,305 INFO L272 TraceCheckUtils]: 16: Hoare triple {7915#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7915#(<= ~counter~0 2)} is VALID [2022-04-27 14:36:31,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {7915#(<= ~counter~0 2)} ~cond := #in~cond; {7915#(<= ~counter~0 2)} is VALID [2022-04-27 14:36:31,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {7915#(<= ~counter~0 2)} assume !(0 == ~cond); {7915#(<= ~counter~0 2)} is VALID [2022-04-27 14:36:31,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {7915#(<= ~counter~0 2)} assume true; {7915#(<= ~counter~0 2)} is VALID [2022-04-27 14:36:31,306 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7915#(<= ~counter~0 2)} {7915#(<= ~counter~0 2)} #51#return; {7915#(<= ~counter~0 2)} is VALID [2022-04-27 14:36:31,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {7915#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7915#(<= ~counter~0 2)} is VALID [2022-04-27 14:36:31,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {7915#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7940#(<= ~counter~0 3)} is VALID [2022-04-27 14:36:31,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {7940#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {7940#(<= ~counter~0 3)} is VALID [2022-04-27 14:36:31,307 INFO L272 TraceCheckUtils]: 24: Hoare triple {7940#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7940#(<= ~counter~0 3)} is VALID [2022-04-27 14:36:31,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {7940#(<= ~counter~0 3)} ~cond := #in~cond; {7940#(<= ~counter~0 3)} is VALID [2022-04-27 14:36:31,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {7940#(<= ~counter~0 3)} assume !(0 == ~cond); {7940#(<= ~counter~0 3)} is VALID [2022-04-27 14:36:31,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {7940#(<= ~counter~0 3)} assume true; {7940#(<= ~counter~0 3)} is VALID [2022-04-27 14:36:31,309 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7940#(<= ~counter~0 3)} {7940#(<= ~counter~0 3)} #51#return; {7940#(<= ~counter~0 3)} is VALID [2022-04-27 14:36:31,309 INFO L290 TraceCheckUtils]: 29: Hoare triple {7940#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7940#(<= ~counter~0 3)} is VALID [2022-04-27 14:36:31,309 INFO L290 TraceCheckUtils]: 30: Hoare triple {7940#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7965#(<= ~counter~0 4)} is VALID [2022-04-27 14:36:31,310 INFO L290 TraceCheckUtils]: 31: Hoare triple {7965#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {7965#(<= ~counter~0 4)} is VALID [2022-04-27 14:36:31,310 INFO L272 TraceCheckUtils]: 32: Hoare triple {7965#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7965#(<= ~counter~0 4)} is VALID [2022-04-27 14:36:31,310 INFO L290 TraceCheckUtils]: 33: Hoare triple {7965#(<= ~counter~0 4)} ~cond := #in~cond; {7965#(<= ~counter~0 4)} is VALID [2022-04-27 14:36:31,310 INFO L290 TraceCheckUtils]: 34: Hoare triple {7965#(<= ~counter~0 4)} assume !(0 == ~cond); {7965#(<= ~counter~0 4)} is VALID [2022-04-27 14:36:31,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {7965#(<= ~counter~0 4)} assume true; {7965#(<= ~counter~0 4)} is VALID [2022-04-27 14:36:31,311 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7965#(<= ~counter~0 4)} {7965#(<= ~counter~0 4)} #51#return; {7965#(<= ~counter~0 4)} is VALID [2022-04-27 14:36:31,311 INFO L290 TraceCheckUtils]: 37: Hoare triple {7965#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7965#(<= ~counter~0 4)} is VALID [2022-04-27 14:36:31,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {7965#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7990#(<= ~counter~0 5)} is VALID [2022-04-27 14:36:31,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {7990#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {7990#(<= ~counter~0 5)} is VALID [2022-04-27 14:36:31,313 INFO L272 TraceCheckUtils]: 40: Hoare triple {7990#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7990#(<= ~counter~0 5)} is VALID [2022-04-27 14:36:31,313 INFO L290 TraceCheckUtils]: 41: Hoare triple {7990#(<= ~counter~0 5)} ~cond := #in~cond; {7990#(<= ~counter~0 5)} is VALID [2022-04-27 14:36:31,313 INFO L290 TraceCheckUtils]: 42: Hoare triple {7990#(<= ~counter~0 5)} assume !(0 == ~cond); {7990#(<= ~counter~0 5)} is VALID [2022-04-27 14:36:31,313 INFO L290 TraceCheckUtils]: 43: Hoare triple {7990#(<= ~counter~0 5)} assume true; {7990#(<= ~counter~0 5)} is VALID [2022-04-27 14:36:31,314 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7990#(<= ~counter~0 5)} {7990#(<= ~counter~0 5)} #51#return; {7990#(<= ~counter~0 5)} is VALID [2022-04-27 14:36:31,314 INFO L290 TraceCheckUtils]: 45: Hoare triple {7990#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7990#(<= ~counter~0 5)} is VALID [2022-04-27 14:36:31,315 INFO L290 TraceCheckUtils]: 46: Hoare triple {7990#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8015#(<= ~counter~0 6)} is VALID [2022-04-27 14:36:31,315 INFO L290 TraceCheckUtils]: 47: Hoare triple {8015#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {8015#(<= ~counter~0 6)} is VALID [2022-04-27 14:36:31,315 INFO L272 TraceCheckUtils]: 48: Hoare triple {8015#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8015#(<= ~counter~0 6)} is VALID [2022-04-27 14:36:31,316 INFO L290 TraceCheckUtils]: 49: Hoare triple {8015#(<= ~counter~0 6)} ~cond := #in~cond; {8015#(<= ~counter~0 6)} is VALID [2022-04-27 14:36:31,316 INFO L290 TraceCheckUtils]: 50: Hoare triple {8015#(<= ~counter~0 6)} assume !(0 == ~cond); {8015#(<= ~counter~0 6)} is VALID [2022-04-27 14:36:31,316 INFO L290 TraceCheckUtils]: 51: Hoare triple {8015#(<= ~counter~0 6)} assume true; {8015#(<= ~counter~0 6)} is VALID [2022-04-27 14:36:31,316 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8015#(<= ~counter~0 6)} {8015#(<= ~counter~0 6)} #51#return; {8015#(<= ~counter~0 6)} is VALID [2022-04-27 14:36:31,317 INFO L290 TraceCheckUtils]: 53: Hoare triple {8015#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8015#(<= ~counter~0 6)} is VALID [2022-04-27 14:36:31,317 INFO L290 TraceCheckUtils]: 54: Hoare triple {8015#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8040#(<= ~counter~0 7)} is VALID [2022-04-27 14:36:31,317 INFO L290 TraceCheckUtils]: 55: Hoare triple {8040#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {8040#(<= ~counter~0 7)} is VALID [2022-04-27 14:36:31,318 INFO L272 TraceCheckUtils]: 56: Hoare triple {8040#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8040#(<= ~counter~0 7)} is VALID [2022-04-27 14:36:31,318 INFO L290 TraceCheckUtils]: 57: Hoare triple {8040#(<= ~counter~0 7)} ~cond := #in~cond; {8040#(<= ~counter~0 7)} is VALID [2022-04-27 14:36:31,318 INFO L290 TraceCheckUtils]: 58: Hoare triple {8040#(<= ~counter~0 7)} assume !(0 == ~cond); {8040#(<= ~counter~0 7)} is VALID [2022-04-27 14:36:31,319 INFO L290 TraceCheckUtils]: 59: Hoare triple {8040#(<= ~counter~0 7)} assume true; {8040#(<= ~counter~0 7)} is VALID [2022-04-27 14:36:31,319 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8040#(<= ~counter~0 7)} {8040#(<= ~counter~0 7)} #51#return; {8040#(<= ~counter~0 7)} is VALID [2022-04-27 14:36:31,319 INFO L290 TraceCheckUtils]: 61: Hoare triple {8040#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8040#(<= ~counter~0 7)} is VALID [2022-04-27 14:36:31,320 INFO L290 TraceCheckUtils]: 62: Hoare triple {8040#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8065#(<= ~counter~0 8)} is VALID [2022-04-27 14:36:31,320 INFO L290 TraceCheckUtils]: 63: Hoare triple {8065#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {8065#(<= ~counter~0 8)} is VALID [2022-04-27 14:36:31,320 INFO L272 TraceCheckUtils]: 64: Hoare triple {8065#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8065#(<= ~counter~0 8)} is VALID [2022-04-27 14:36:31,320 INFO L290 TraceCheckUtils]: 65: Hoare triple {8065#(<= ~counter~0 8)} ~cond := #in~cond; {8065#(<= ~counter~0 8)} is VALID [2022-04-27 14:36:31,321 INFO L290 TraceCheckUtils]: 66: Hoare triple {8065#(<= ~counter~0 8)} assume !(0 == ~cond); {8065#(<= ~counter~0 8)} is VALID [2022-04-27 14:36:31,321 INFO L290 TraceCheckUtils]: 67: Hoare triple {8065#(<= ~counter~0 8)} assume true; {8065#(<= ~counter~0 8)} is VALID [2022-04-27 14:36:31,321 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8065#(<= ~counter~0 8)} {8065#(<= ~counter~0 8)} #51#return; {8065#(<= ~counter~0 8)} is VALID [2022-04-27 14:36:31,322 INFO L290 TraceCheckUtils]: 69: Hoare triple {8065#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8065#(<= ~counter~0 8)} is VALID [2022-04-27 14:36:31,322 INFO L290 TraceCheckUtils]: 70: Hoare triple {8065#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8090#(<= ~counter~0 9)} is VALID [2022-04-27 14:36:31,322 INFO L290 TraceCheckUtils]: 71: Hoare triple {8090#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {8090#(<= ~counter~0 9)} is VALID [2022-04-27 14:36:31,323 INFO L272 TraceCheckUtils]: 72: Hoare triple {8090#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8090#(<= ~counter~0 9)} is VALID [2022-04-27 14:36:31,323 INFO L290 TraceCheckUtils]: 73: Hoare triple {8090#(<= ~counter~0 9)} ~cond := #in~cond; {8090#(<= ~counter~0 9)} is VALID [2022-04-27 14:36:31,323 INFO L290 TraceCheckUtils]: 74: Hoare triple {8090#(<= ~counter~0 9)} assume !(0 == ~cond); {8090#(<= ~counter~0 9)} is VALID [2022-04-27 14:36:31,323 INFO L290 TraceCheckUtils]: 75: Hoare triple {8090#(<= ~counter~0 9)} assume true; {8090#(<= ~counter~0 9)} is VALID [2022-04-27 14:36:31,324 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8090#(<= ~counter~0 9)} {8090#(<= ~counter~0 9)} #51#return; {8090#(<= ~counter~0 9)} is VALID [2022-04-27 14:36:31,339 INFO L290 TraceCheckUtils]: 77: Hoare triple {8090#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8090#(<= ~counter~0 9)} is VALID [2022-04-27 14:36:31,340 INFO L290 TraceCheckUtils]: 78: Hoare triple {8090#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8115#(<= ~counter~0 10)} is VALID [2022-04-27 14:36:31,340 INFO L290 TraceCheckUtils]: 79: Hoare triple {8115#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {8115#(<= ~counter~0 10)} is VALID [2022-04-27 14:36:31,341 INFO L272 TraceCheckUtils]: 80: Hoare triple {8115#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8115#(<= ~counter~0 10)} is VALID [2022-04-27 14:36:31,341 INFO L290 TraceCheckUtils]: 81: Hoare triple {8115#(<= ~counter~0 10)} ~cond := #in~cond; {8115#(<= ~counter~0 10)} is VALID [2022-04-27 14:36:31,341 INFO L290 TraceCheckUtils]: 82: Hoare triple {8115#(<= ~counter~0 10)} assume !(0 == ~cond); {8115#(<= ~counter~0 10)} is VALID [2022-04-27 14:36:31,341 INFO L290 TraceCheckUtils]: 83: Hoare triple {8115#(<= ~counter~0 10)} assume true; {8115#(<= ~counter~0 10)} is VALID [2022-04-27 14:36:31,342 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {8115#(<= ~counter~0 10)} {8115#(<= ~counter~0 10)} #51#return; {8115#(<= ~counter~0 10)} is VALID [2022-04-27 14:36:31,342 INFO L290 TraceCheckUtils]: 85: Hoare triple {8115#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8115#(<= ~counter~0 10)} is VALID [2022-04-27 14:36:31,342 INFO L290 TraceCheckUtils]: 86: Hoare triple {8115#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8140#(<= |main_#t~post5| 10)} is VALID [2022-04-27 14:36:31,343 INFO L290 TraceCheckUtils]: 87: Hoare triple {8140#(<= |main_#t~post5| 10)} assume !(#t~post5 < 20);havoc #t~post5; {7867#false} is VALID [2022-04-27 14:36:31,343 INFO L272 TraceCheckUtils]: 88: Hoare triple {7867#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7867#false} is VALID [2022-04-27 14:36:31,343 INFO L290 TraceCheckUtils]: 89: Hoare triple {7867#false} ~cond := #in~cond; {7867#false} is VALID [2022-04-27 14:36:31,343 INFO L290 TraceCheckUtils]: 90: Hoare triple {7867#false} assume 0 == ~cond; {7867#false} is VALID [2022-04-27 14:36:31,343 INFO L290 TraceCheckUtils]: 91: Hoare triple {7867#false} assume !false; {7867#false} is VALID [2022-04-27 14:36:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:36:31,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:31,804 INFO L290 TraceCheckUtils]: 91: Hoare triple {7867#false} assume !false; {7867#false} is VALID [2022-04-27 14:36:31,804 INFO L290 TraceCheckUtils]: 90: Hoare triple {7867#false} assume 0 == ~cond; {7867#false} is VALID [2022-04-27 14:36:31,804 INFO L290 TraceCheckUtils]: 89: Hoare triple {7867#false} ~cond := #in~cond; {7867#false} is VALID [2022-04-27 14:36:31,804 INFO L272 TraceCheckUtils]: 88: Hoare triple {7867#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7867#false} is VALID [2022-04-27 14:36:31,804 INFO L290 TraceCheckUtils]: 87: Hoare triple {8168#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {7867#false} is VALID [2022-04-27 14:36:31,805 INFO L290 TraceCheckUtils]: 86: Hoare triple {8172#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8168#(< |main_#t~post5| 20)} is VALID [2022-04-27 14:36:31,805 INFO L290 TraceCheckUtils]: 85: Hoare triple {8172#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8172#(< ~counter~0 20)} is VALID [2022-04-27 14:36:31,805 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {7866#true} {8172#(< ~counter~0 20)} #51#return; {8172#(< ~counter~0 20)} is VALID [2022-04-27 14:36:31,805 INFO L290 TraceCheckUtils]: 83: Hoare triple {7866#true} assume true; {7866#true} is VALID [2022-04-27 14:36:31,805 INFO L290 TraceCheckUtils]: 82: Hoare triple {7866#true} assume !(0 == ~cond); {7866#true} is VALID [2022-04-27 14:36:31,806 INFO L290 TraceCheckUtils]: 81: Hoare triple {7866#true} ~cond := #in~cond; {7866#true} is VALID [2022-04-27 14:36:31,806 INFO L272 TraceCheckUtils]: 80: Hoare triple {8172#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7866#true} is VALID [2022-04-27 14:36:31,806 INFO L290 TraceCheckUtils]: 79: Hoare triple {8172#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {8172#(< ~counter~0 20)} is VALID [2022-04-27 14:36:31,806 INFO L290 TraceCheckUtils]: 78: Hoare triple {8197#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8172#(< ~counter~0 20)} is VALID [2022-04-27 14:36:31,815 INFO L290 TraceCheckUtils]: 77: Hoare triple {8197#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8197#(< ~counter~0 19)} is VALID [2022-04-27 14:36:31,816 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7866#true} {8197#(< ~counter~0 19)} #51#return; {8197#(< ~counter~0 19)} is VALID [2022-04-27 14:36:31,816 INFO L290 TraceCheckUtils]: 75: Hoare triple {7866#true} assume true; {7866#true} is VALID [2022-04-27 14:36:31,816 INFO L290 TraceCheckUtils]: 74: Hoare triple {7866#true} assume !(0 == ~cond); {7866#true} is VALID [2022-04-27 14:36:31,816 INFO L290 TraceCheckUtils]: 73: Hoare triple {7866#true} ~cond := #in~cond; {7866#true} is VALID [2022-04-27 14:36:31,816 INFO L272 TraceCheckUtils]: 72: Hoare triple {8197#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7866#true} is VALID [2022-04-27 14:36:31,816 INFO L290 TraceCheckUtils]: 71: Hoare triple {8197#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {8197#(< ~counter~0 19)} is VALID [2022-04-27 14:36:31,817 INFO L290 TraceCheckUtils]: 70: Hoare triple {8222#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8197#(< ~counter~0 19)} is VALID [2022-04-27 14:36:31,817 INFO L290 TraceCheckUtils]: 69: Hoare triple {8222#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8222#(< ~counter~0 18)} is VALID [2022-04-27 14:36:31,818 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7866#true} {8222#(< ~counter~0 18)} #51#return; {8222#(< ~counter~0 18)} is VALID [2022-04-27 14:36:31,818 INFO L290 TraceCheckUtils]: 67: Hoare triple {7866#true} assume true; {7866#true} is VALID [2022-04-27 14:36:31,818 INFO L290 TraceCheckUtils]: 66: Hoare triple {7866#true} assume !(0 == ~cond); {7866#true} is VALID [2022-04-27 14:36:31,818 INFO L290 TraceCheckUtils]: 65: Hoare triple {7866#true} ~cond := #in~cond; {7866#true} is VALID [2022-04-27 14:36:31,818 INFO L272 TraceCheckUtils]: 64: Hoare triple {8222#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7866#true} is VALID [2022-04-27 14:36:31,818 INFO L290 TraceCheckUtils]: 63: Hoare triple {8222#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {8222#(< ~counter~0 18)} is VALID [2022-04-27 14:36:31,819 INFO L290 TraceCheckUtils]: 62: Hoare triple {8247#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8222#(< ~counter~0 18)} is VALID [2022-04-27 14:36:31,819 INFO L290 TraceCheckUtils]: 61: Hoare triple {8247#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8247#(< ~counter~0 17)} is VALID [2022-04-27 14:36:31,819 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7866#true} {8247#(< ~counter~0 17)} #51#return; {8247#(< ~counter~0 17)} is VALID [2022-04-27 14:36:31,820 INFO L290 TraceCheckUtils]: 59: Hoare triple {7866#true} assume true; {7866#true} is VALID [2022-04-27 14:36:31,820 INFO L290 TraceCheckUtils]: 58: Hoare triple {7866#true} assume !(0 == ~cond); {7866#true} is VALID [2022-04-27 14:36:31,820 INFO L290 TraceCheckUtils]: 57: Hoare triple {7866#true} ~cond := #in~cond; {7866#true} is VALID [2022-04-27 14:36:31,820 INFO L272 TraceCheckUtils]: 56: Hoare triple {8247#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7866#true} is VALID [2022-04-27 14:36:31,820 INFO L290 TraceCheckUtils]: 55: Hoare triple {8247#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {8247#(< ~counter~0 17)} is VALID [2022-04-27 14:36:31,820 INFO L290 TraceCheckUtils]: 54: Hoare triple {8272#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8247#(< ~counter~0 17)} is VALID [2022-04-27 14:36:31,821 INFO L290 TraceCheckUtils]: 53: Hoare triple {8272#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8272#(< ~counter~0 16)} is VALID [2022-04-27 14:36:31,821 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7866#true} {8272#(< ~counter~0 16)} #51#return; {8272#(< ~counter~0 16)} is VALID [2022-04-27 14:36:31,821 INFO L290 TraceCheckUtils]: 51: Hoare triple {7866#true} assume true; {7866#true} is VALID [2022-04-27 14:36:31,821 INFO L290 TraceCheckUtils]: 50: Hoare triple {7866#true} assume !(0 == ~cond); {7866#true} is VALID [2022-04-27 14:36:31,821 INFO L290 TraceCheckUtils]: 49: Hoare triple {7866#true} ~cond := #in~cond; {7866#true} is VALID [2022-04-27 14:36:31,821 INFO L272 TraceCheckUtils]: 48: Hoare triple {8272#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7866#true} is VALID [2022-04-27 14:36:31,822 INFO L290 TraceCheckUtils]: 47: Hoare triple {8272#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {8272#(< ~counter~0 16)} is VALID [2022-04-27 14:36:31,822 INFO L290 TraceCheckUtils]: 46: Hoare triple {8297#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8272#(< ~counter~0 16)} is VALID [2022-04-27 14:36:31,823 INFO L290 TraceCheckUtils]: 45: Hoare triple {8297#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8297#(< ~counter~0 15)} is VALID [2022-04-27 14:36:31,823 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7866#true} {8297#(< ~counter~0 15)} #51#return; {8297#(< ~counter~0 15)} is VALID [2022-04-27 14:36:31,823 INFO L290 TraceCheckUtils]: 43: Hoare triple {7866#true} assume true; {7866#true} is VALID [2022-04-27 14:36:31,823 INFO L290 TraceCheckUtils]: 42: Hoare triple {7866#true} assume !(0 == ~cond); {7866#true} is VALID [2022-04-27 14:36:31,823 INFO L290 TraceCheckUtils]: 41: Hoare triple {7866#true} ~cond := #in~cond; {7866#true} is VALID [2022-04-27 14:36:31,823 INFO L272 TraceCheckUtils]: 40: Hoare triple {8297#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7866#true} is VALID [2022-04-27 14:36:31,824 INFO L290 TraceCheckUtils]: 39: Hoare triple {8297#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {8297#(< ~counter~0 15)} is VALID [2022-04-27 14:36:31,824 INFO L290 TraceCheckUtils]: 38: Hoare triple {8322#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8297#(< ~counter~0 15)} is VALID [2022-04-27 14:36:31,824 INFO L290 TraceCheckUtils]: 37: Hoare triple {8322#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8322#(< ~counter~0 14)} is VALID [2022-04-27 14:36:31,825 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7866#true} {8322#(< ~counter~0 14)} #51#return; {8322#(< ~counter~0 14)} is VALID [2022-04-27 14:36:31,825 INFO L290 TraceCheckUtils]: 35: Hoare triple {7866#true} assume true; {7866#true} is VALID [2022-04-27 14:36:31,825 INFO L290 TraceCheckUtils]: 34: Hoare triple {7866#true} assume !(0 == ~cond); {7866#true} is VALID [2022-04-27 14:36:31,825 INFO L290 TraceCheckUtils]: 33: Hoare triple {7866#true} ~cond := #in~cond; {7866#true} is VALID [2022-04-27 14:36:31,825 INFO L272 TraceCheckUtils]: 32: Hoare triple {8322#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7866#true} is VALID [2022-04-27 14:36:31,825 INFO L290 TraceCheckUtils]: 31: Hoare triple {8322#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {8322#(< ~counter~0 14)} is VALID [2022-04-27 14:36:31,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {8347#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8322#(< ~counter~0 14)} is VALID [2022-04-27 14:36:31,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {8347#(< ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8347#(< ~counter~0 13)} is VALID [2022-04-27 14:36:31,827 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7866#true} {8347#(< ~counter~0 13)} #51#return; {8347#(< ~counter~0 13)} is VALID [2022-04-27 14:36:31,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {7866#true} assume true; {7866#true} is VALID [2022-04-27 14:36:31,827 INFO L290 TraceCheckUtils]: 26: Hoare triple {7866#true} assume !(0 == ~cond); {7866#true} is VALID [2022-04-27 14:36:31,827 INFO L290 TraceCheckUtils]: 25: Hoare triple {7866#true} ~cond := #in~cond; {7866#true} is VALID [2022-04-27 14:36:31,827 INFO L272 TraceCheckUtils]: 24: Hoare triple {8347#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7866#true} is VALID [2022-04-27 14:36:31,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {8347#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {8347#(< ~counter~0 13)} is VALID [2022-04-27 14:36:31,828 INFO L290 TraceCheckUtils]: 22: Hoare triple {8372#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8347#(< ~counter~0 13)} is VALID [2022-04-27 14:36:31,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {8372#(< ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8372#(< ~counter~0 12)} is VALID [2022-04-27 14:36:31,828 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7866#true} {8372#(< ~counter~0 12)} #51#return; {8372#(< ~counter~0 12)} is VALID [2022-04-27 14:36:31,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {7866#true} assume true; {7866#true} is VALID [2022-04-27 14:36:31,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {7866#true} assume !(0 == ~cond); {7866#true} is VALID [2022-04-27 14:36:31,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {7866#true} ~cond := #in~cond; {7866#true} is VALID [2022-04-27 14:36:31,829 INFO L272 TraceCheckUtils]: 16: Hoare triple {8372#(< ~counter~0 12)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7866#true} is VALID [2022-04-27 14:36:31,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {8372#(< ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {8372#(< ~counter~0 12)} is VALID [2022-04-27 14:36:31,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {8115#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8372#(< ~counter~0 12)} is VALID [2022-04-27 14:36:31,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {8115#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8115#(<= ~counter~0 10)} is VALID [2022-04-27 14:36:31,830 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7866#true} {8115#(<= ~counter~0 10)} #51#return; {8115#(<= ~counter~0 10)} is VALID [2022-04-27 14:36:31,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {7866#true} assume true; {7866#true} is VALID [2022-04-27 14:36:31,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {7866#true} assume !(0 == ~cond); {7866#true} is VALID [2022-04-27 14:36:31,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {7866#true} ~cond := #in~cond; {7866#true} is VALID [2022-04-27 14:36:31,831 INFO L272 TraceCheckUtils]: 8: Hoare triple {8115#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7866#true} is VALID [2022-04-27 14:36:31,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {8115#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {8115#(<= ~counter~0 10)} is VALID [2022-04-27 14:36:31,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {8090#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8115#(<= ~counter~0 10)} is VALID [2022-04-27 14:36:31,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {8090#(<= ~counter~0 9)} 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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {8090#(<= ~counter~0 9)} is VALID [2022-04-27 14:36:31,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {8090#(<= ~counter~0 9)} call #t~ret6 := main(); {8090#(<= ~counter~0 9)} is VALID [2022-04-27 14:36:31,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8090#(<= ~counter~0 9)} {7866#true} #57#return; {8090#(<= ~counter~0 9)} is VALID [2022-04-27 14:36:31,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {8090#(<= ~counter~0 9)} assume true; {8090#(<= ~counter~0 9)} is VALID [2022-04-27 14:36:31,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {7866#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8090#(<= ~counter~0 9)} is VALID [2022-04-27 14:36:31,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {7866#true} call ULTIMATE.init(); {7866#true} is VALID [2022-04-27 14:36:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 200 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 14:36:31,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:31,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460707101] [2022-04-27 14:36:31,834 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:31,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793627790] [2022-04-27 14:36:31,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793627790] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:36:31,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:36:31,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-27 14:36:31,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285346242] [2022-04-27 14:36:31,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:31,836 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) Word has length 92 [2022-04-27 14:36:31,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:31,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2022-04-27 14:36:31,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:31,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 14:36:31,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:31,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 14:36:31,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-27 14:36:31,931 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2022-04-27 14:36:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:32,732 INFO L93 Difference]: Finished difference Result 223 states and 233 transitions. [2022-04-27 14:36:32,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-27 14:36:32,732 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) Word has length 92 [2022-04-27 14:36:32,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:32,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2022-04-27 14:36:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 223 transitions. [2022-04-27 14:36:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2022-04-27 14:36:32,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 223 transitions. [2022-04-27 14:36:32,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 223 transitions. [2022-04-27 14:36:32,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:32,903 INFO L225 Difference]: With dead ends: 223 [2022-04-27 14:36:32,903 INFO L226 Difference]: Without dead ends: 218 [2022-04-27 14:36:32,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2022-04-27 14:36:32,904 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 192 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:32,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 213 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:36:32,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-04-27 14:36:32,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 173. [2022-04-27 14:36:32,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:32,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand has 173 states, 128 states have (on average 1.0859375) internal successors, (139), 128 states have internal predecessors, (139), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:36:32,983 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand has 173 states, 128 states have (on average 1.0859375) internal successors, (139), 128 states have internal predecessors, (139), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:36:32,983 INFO L87 Difference]: Start difference. First operand 218 states. Second operand has 173 states, 128 states have (on average 1.0859375) internal successors, (139), 128 states have internal predecessors, (139), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:36:32,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:32,986 INFO L93 Difference]: Finished difference Result 218 states and 219 transitions. [2022-04-27 14:36:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 219 transitions. [2022-04-27 14:36:32,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:32,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:32,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 128 states have (on average 1.0859375) internal successors, (139), 128 states have internal predecessors, (139), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 218 states. [2022-04-27 14:36:32,987 INFO L87 Difference]: Start difference. First operand has 173 states, 128 states have (on average 1.0859375) internal successors, (139), 128 states have internal predecessors, (139), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 218 states. [2022-04-27 14:36:32,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:32,990 INFO L93 Difference]: Finished difference Result 218 states and 219 transitions. [2022-04-27 14:36:32,991 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 219 transitions. [2022-04-27 14:36:32,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:32,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:32,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:32,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.0859375) internal successors, (139), 128 states have internal predecessors, (139), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:36:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 183 transitions. [2022-04-27 14:36:32,993 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 183 transitions. Word has length 92 [2022-04-27 14:36:32,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:32,994 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 183 transitions. [2022-04-27 14:36:32,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2022-04-27 14:36:32,994 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 183 transitions. [2022-04-27 14:36:32,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-27 14:36:32,994 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:32,994 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:33,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-27 14:36:33,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 14:36:33,211 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:33,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:33,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2105665221, now seen corresponding path program 10 times [2022-04-27 14:36:33,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:33,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122698251] [2022-04-27 14:36:33,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:33,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:33,228 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:33,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1372484829] [2022-04-27 14:36:33,229 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:36:33,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:33,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:33,230 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:33,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-27 14:36:34,420 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:36:34,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:34,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-27 14:36:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:34,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:34,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {9465#true} call ULTIMATE.init(); {9465#true} is VALID [2022-04-27 14:36:34,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {9465#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9465#true} is VALID [2022-04-27 14:36:34,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {9465#true} assume true; {9465#true} is VALID [2022-04-27 14:36:34,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9465#true} {9465#true} #57#return; {9465#true} is VALID [2022-04-27 14:36:34,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {9465#true} call #t~ret6 := main(); {9465#true} is VALID [2022-04-27 14:36:34,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {9465#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {9485#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:34,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {9485#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9485#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:34,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {9485#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {9485#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:34,917 INFO L272 TraceCheckUtils]: 8: Hoare triple {9485#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9465#true} is VALID [2022-04-27 14:36:34,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {9465#true} ~cond := #in~cond; {9465#true} is VALID [2022-04-27 14:36:34,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {9465#true} assume !(0 == ~cond); {9465#true} is VALID [2022-04-27 14:36:34,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {9465#true} assume true; {9465#true} is VALID [2022-04-27 14:36:34,917 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9465#true} {9485#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {9485#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:34,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {9485#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9510#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:34,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {9510#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9510#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:34,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {9510#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {9510#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:34,918 INFO L272 TraceCheckUtils]: 16: Hoare triple {9510#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9465#true} is VALID [2022-04-27 14:36:34,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {9465#true} ~cond := #in~cond; {9465#true} is VALID [2022-04-27 14:36:34,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {9465#true} assume !(0 == ~cond); {9465#true} is VALID [2022-04-27 14:36:34,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {9465#true} assume true; {9465#true} is VALID [2022-04-27 14:36:34,919 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9465#true} {9510#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {9510#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:34,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {9510#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9535#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:36:34,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {9535#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9535#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:36:34,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {9535#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {9535#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:36:34,920 INFO L272 TraceCheckUtils]: 24: Hoare triple {9535#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9465#true} is VALID [2022-04-27 14:36:34,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {9465#true} ~cond := #in~cond; {9465#true} is VALID [2022-04-27 14:36:34,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {9465#true} assume !(0 == ~cond); {9465#true} is VALID [2022-04-27 14:36:34,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {9465#true} assume true; {9465#true} is VALID [2022-04-27 14:36:34,920 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9465#true} {9535#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #51#return; {9535#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:36:34,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {9535#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9560#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:34,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {9560#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9560#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:34,921 INFO L290 TraceCheckUtils]: 31: Hoare triple {9560#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {9560#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:34,921 INFO L272 TraceCheckUtils]: 32: Hoare triple {9560#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9465#true} is VALID [2022-04-27 14:36:34,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {9465#true} ~cond := #in~cond; {9465#true} is VALID [2022-04-27 14:36:34,921 INFO L290 TraceCheckUtils]: 34: Hoare triple {9465#true} assume !(0 == ~cond); {9465#true} is VALID [2022-04-27 14:36:34,921 INFO L290 TraceCheckUtils]: 35: Hoare triple {9465#true} assume true; {9465#true} is VALID [2022-04-27 14:36:34,922 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9465#true} {9560#(and (= main_~y~0 3) (= main_~c~0 3))} #51#return; {9560#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:34,922 INFO L290 TraceCheckUtils]: 37: Hoare triple {9560#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9585#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:34,922 INFO L290 TraceCheckUtils]: 38: Hoare triple {9585#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9585#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:34,923 INFO L290 TraceCheckUtils]: 39: Hoare triple {9585#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {9585#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:34,923 INFO L272 TraceCheckUtils]: 40: Hoare triple {9585#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9465#true} is VALID [2022-04-27 14:36:34,923 INFO L290 TraceCheckUtils]: 41: Hoare triple {9465#true} ~cond := #in~cond; {9465#true} is VALID [2022-04-27 14:36:34,923 INFO L290 TraceCheckUtils]: 42: Hoare triple {9465#true} assume !(0 == ~cond); {9465#true} is VALID [2022-04-27 14:36:34,923 INFO L290 TraceCheckUtils]: 43: Hoare triple {9465#true} assume true; {9465#true} is VALID [2022-04-27 14:36:34,923 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9465#true} {9585#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #51#return; {9585#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:34,924 INFO L290 TraceCheckUtils]: 45: Hoare triple {9585#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9610#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:34,924 INFO L290 TraceCheckUtils]: 46: Hoare triple {9610#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9610#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:34,924 INFO L290 TraceCheckUtils]: 47: Hoare triple {9610#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {9610#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:34,924 INFO L272 TraceCheckUtils]: 48: Hoare triple {9610#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9465#true} is VALID [2022-04-27 14:36:34,924 INFO L290 TraceCheckUtils]: 49: Hoare triple {9465#true} ~cond := #in~cond; {9465#true} is VALID [2022-04-27 14:36:34,924 INFO L290 TraceCheckUtils]: 50: Hoare triple {9465#true} assume !(0 == ~cond); {9465#true} is VALID [2022-04-27 14:36:34,925 INFO L290 TraceCheckUtils]: 51: Hoare triple {9465#true} assume true; {9465#true} is VALID [2022-04-27 14:36:34,925 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9465#true} {9610#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #51#return; {9610#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:34,925 INFO L290 TraceCheckUtils]: 53: Hoare triple {9610#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9635#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:34,926 INFO L290 TraceCheckUtils]: 54: Hoare triple {9635#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9635#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:34,926 INFO L290 TraceCheckUtils]: 55: Hoare triple {9635#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {9635#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:34,926 INFO L272 TraceCheckUtils]: 56: Hoare triple {9635#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9465#true} is VALID [2022-04-27 14:36:34,926 INFO L290 TraceCheckUtils]: 57: Hoare triple {9465#true} ~cond := #in~cond; {9465#true} is VALID [2022-04-27 14:36:34,926 INFO L290 TraceCheckUtils]: 58: Hoare triple {9465#true} assume !(0 == ~cond); {9465#true} is VALID [2022-04-27 14:36:34,926 INFO L290 TraceCheckUtils]: 59: Hoare triple {9465#true} assume true; {9465#true} is VALID [2022-04-27 14:36:34,927 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9465#true} {9635#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #51#return; {9635#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:34,927 INFO L290 TraceCheckUtils]: 61: Hoare triple {9635#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9660#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:36:34,927 INFO L290 TraceCheckUtils]: 62: Hoare triple {9660#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9660#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:36:34,928 INFO L290 TraceCheckUtils]: 63: Hoare triple {9660#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !!(#t~post5 < 20);havoc #t~post5; {9660#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:36:34,928 INFO L272 TraceCheckUtils]: 64: Hoare triple {9660#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9465#true} is VALID [2022-04-27 14:36:34,928 INFO L290 TraceCheckUtils]: 65: Hoare triple {9465#true} ~cond := #in~cond; {9465#true} is VALID [2022-04-27 14:36:34,928 INFO L290 TraceCheckUtils]: 66: Hoare triple {9465#true} assume !(0 == ~cond); {9465#true} is VALID [2022-04-27 14:36:34,928 INFO L290 TraceCheckUtils]: 67: Hoare triple {9465#true} assume true; {9465#true} is VALID [2022-04-27 14:36:34,928 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9465#true} {9660#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #51#return; {9660#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:36:34,929 INFO L290 TraceCheckUtils]: 69: Hoare triple {9660#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9685#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:34,929 INFO L290 TraceCheckUtils]: 70: Hoare triple {9685#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9685#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:34,929 INFO L290 TraceCheckUtils]: 71: Hoare triple {9685#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {9685#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:34,929 INFO L272 TraceCheckUtils]: 72: Hoare triple {9685#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9465#true} is VALID [2022-04-27 14:36:34,929 INFO L290 TraceCheckUtils]: 73: Hoare triple {9465#true} ~cond := #in~cond; {9465#true} is VALID [2022-04-27 14:36:34,929 INFO L290 TraceCheckUtils]: 74: Hoare triple {9465#true} assume !(0 == ~cond); {9465#true} is VALID [2022-04-27 14:36:34,930 INFO L290 TraceCheckUtils]: 75: Hoare triple {9465#true} assume true; {9465#true} is VALID [2022-04-27 14:36:34,930 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {9465#true} {9685#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} #51#return; {9685#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:34,930 INFO L290 TraceCheckUtils]: 77: Hoare triple {9685#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9710#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-27 14:36:34,931 INFO L290 TraceCheckUtils]: 78: Hoare triple {9710#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9710#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-27 14:36:34,931 INFO L290 TraceCheckUtils]: 79: Hoare triple {9710#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {9710#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-27 14:36:34,931 INFO L272 TraceCheckUtils]: 80: Hoare triple {9710#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9465#true} is VALID [2022-04-27 14:36:34,931 INFO L290 TraceCheckUtils]: 81: Hoare triple {9465#true} ~cond := #in~cond; {9465#true} is VALID [2022-04-27 14:36:34,931 INFO L290 TraceCheckUtils]: 82: Hoare triple {9465#true} assume !(0 == ~cond); {9465#true} is VALID [2022-04-27 14:36:34,931 INFO L290 TraceCheckUtils]: 83: Hoare triple {9465#true} assume true; {9465#true} is VALID [2022-04-27 14:36:34,931 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {9465#true} {9710#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} #51#return; {9710#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-27 14:36:34,932 INFO L290 TraceCheckUtils]: 85: Hoare triple {9710#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9735#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:36:34,932 INFO L290 TraceCheckUtils]: 86: Hoare triple {9735#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9735#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:36:34,932 INFO L290 TraceCheckUtils]: 87: Hoare triple {9735#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {9735#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:36:34,932 INFO L272 TraceCheckUtils]: 88: Hoare triple {9735#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9465#true} is VALID [2022-04-27 14:36:34,932 INFO L290 TraceCheckUtils]: 89: Hoare triple {9465#true} ~cond := #in~cond; {9465#true} is VALID [2022-04-27 14:36:34,933 INFO L290 TraceCheckUtils]: 90: Hoare triple {9465#true} assume !(0 == ~cond); {9465#true} is VALID [2022-04-27 14:36:34,933 INFO L290 TraceCheckUtils]: 91: Hoare triple {9465#true} assume true; {9465#true} is VALID [2022-04-27 14:36:34,933 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {9465#true} {9735#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} #51#return; {9735#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:36:34,933 INFO L290 TraceCheckUtils]: 93: Hoare triple {9735#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {9760#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~k~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:36:34,934 INFO L272 TraceCheckUtils]: 94: Hoare triple {9760#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~k~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9764#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:34,934 INFO L290 TraceCheckUtils]: 95: Hoare triple {9764#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9768#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:34,934 INFO L290 TraceCheckUtils]: 96: Hoare triple {9768#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9466#false} is VALID [2022-04-27 14:36:34,935 INFO L290 TraceCheckUtils]: 97: Hoare triple {9466#false} assume !false; {9466#false} is VALID [2022-04-27 14:36:34,935 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 22 proven. 220 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-27 14:36:34,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:35,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:35,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122698251] [2022-04-27 14:36:35,223 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:35,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372484829] [2022-04-27 14:36:35,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372484829] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:35,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:35,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-27 14:36:35,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154891721] [2022-04-27 14:36:35,223 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:35,223 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 98 [2022-04-27 14:36:35,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:35,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:35,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:35,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 14:36:35,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:35,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 14:36:35,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:36:35,273 INFO L87 Difference]: Start difference. First operand 173 states and 183 transitions. Second operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:36,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:36,429 INFO L93 Difference]: Finished difference Result 178 states and 187 transitions. [2022-04-27 14:36:36,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 14:36:36,429 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 98 [2022-04-27 14:36:36,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:36,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:36,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 79 transitions. [2022-04-27 14:36:36,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:36,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 79 transitions. [2022-04-27 14:36:36,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 79 transitions. [2022-04-27 14:36:36,496 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-27 14:36:36,498 INFO L225 Difference]: With dead ends: 178 [2022-04-27 14:36:36,498 INFO L226 Difference]: Without dead ends: 173 [2022-04-27 14:36:36,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 93 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-27 14:36:36,499 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:36,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 532 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 14:36:36,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-27 14:36:36,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-04-27 14:36:36,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:36,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.078125) internal successors, (138), 128 states have internal predecessors, (138), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:36:36,577 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.078125) internal successors, (138), 128 states have internal predecessors, (138), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:36:36,577 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.078125) internal successors, (138), 128 states have internal predecessors, (138), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:36:36,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:36,579 INFO L93 Difference]: Finished difference Result 173 states and 182 transitions. [2022-04-27 14:36:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 182 transitions. [2022-04-27 14:36:36,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:36,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:36,580 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 128 states have (on average 1.078125) internal successors, (138), 128 states have internal predecessors, (138), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-27 14:36:36,580 INFO L87 Difference]: Start difference. First operand has 173 states, 128 states have (on average 1.078125) internal successors, (138), 128 states have internal predecessors, (138), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-27 14:36:36,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:36,582 INFO L93 Difference]: Finished difference Result 173 states and 182 transitions. [2022-04-27 14:36:36,582 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 182 transitions. [2022-04-27 14:36:36,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:36,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:36,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:36,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:36,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.078125) internal successors, (138), 128 states have internal predecessors, (138), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:36:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 182 transitions. [2022-04-27 14:36:36,585 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 182 transitions. Word has length 98 [2022-04-27 14:36:36,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:36,585 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 182 transitions. [2022-04-27 14:36:36,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:36,585 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 182 transitions. [2022-04-27 14:36:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-27 14:36:36,586 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:36,586 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:36,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-27 14:36:36,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 14:36:36,791 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:36,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:36,792 INFO L85 PathProgramCache]: Analyzing trace with hash -65749816, now seen corresponding path program 11 times [2022-04-27 14:36:36,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:36,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109397049] [2022-04-27 14:36:36,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:36,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:36,803 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:36,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [26582650] [2022-04-27 14:36:36,803 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:36:36,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:36,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:36,804 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:36,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-27 14:36:37,352 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-04-27 14:36:37,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:37,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-27 14:36:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:37,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:37,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {10656#true} call ULTIMATE.init(); {10656#true} is VALID [2022-04-27 14:36:37,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {10656#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10656#true} is VALID [2022-04-27 14:36:37,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {10656#true} assume true; {10656#true} is VALID [2022-04-27 14:36:37,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10656#true} {10656#true} #57#return; {10656#true} is VALID [2022-04-27 14:36:37,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {10656#true} call #t~ret6 := main(); {10656#true} is VALID [2022-04-27 14:36:37,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {10656#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {10676#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:37,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {10676#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10676#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:37,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {10676#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {10676#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:37,918 INFO L272 TraceCheckUtils]: 8: Hoare triple {10676#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10656#true} is VALID [2022-04-27 14:36:37,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {10656#true} ~cond := #in~cond; {10656#true} is VALID [2022-04-27 14:36:37,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {10656#true} assume !(0 == ~cond); {10656#true} is VALID [2022-04-27 14:36:37,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {10656#true} assume true; {10656#true} is VALID [2022-04-27 14:36:37,918 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10656#true} {10676#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {10676#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:37,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {10676#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10701#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:36:37,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {10701#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10701#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:36:37,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {10701#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {10701#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:36:37,919 INFO L272 TraceCheckUtils]: 16: Hoare triple {10701#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10656#true} is VALID [2022-04-27 14:36:37,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {10656#true} ~cond := #in~cond; {10656#true} is VALID [2022-04-27 14:36:37,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {10656#true} assume !(0 == ~cond); {10656#true} is VALID [2022-04-27 14:36:37,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {10656#true} assume true; {10656#true} is VALID [2022-04-27 14:36:37,920 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10656#true} {10701#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #51#return; {10701#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:36:37,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {10701#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10726#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:37,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {10726#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10726#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:37,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {10726#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {10726#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:37,923 INFO L272 TraceCheckUtils]: 24: Hoare triple {10726#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10656#true} is VALID [2022-04-27 14:36:37,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {10656#true} ~cond := #in~cond; {10656#true} is VALID [2022-04-27 14:36:37,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {10656#true} assume !(0 == ~cond); {10656#true} is VALID [2022-04-27 14:36:37,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {10656#true} assume true; {10656#true} is VALID [2022-04-27 14:36:37,923 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10656#true} {10726#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #51#return; {10726#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:37,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {10726#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10751#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-27 14:36:37,924 INFO L290 TraceCheckUtils]: 30: Hoare triple {10751#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10751#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-27 14:36:37,924 INFO L290 TraceCheckUtils]: 31: Hoare triple {10751#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {10751#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-27 14:36:37,924 INFO L272 TraceCheckUtils]: 32: Hoare triple {10751#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10656#true} is VALID [2022-04-27 14:36:37,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {10656#true} ~cond := #in~cond; {10656#true} is VALID [2022-04-27 14:36:37,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {10656#true} assume !(0 == ~cond); {10656#true} is VALID [2022-04-27 14:36:37,924 INFO L290 TraceCheckUtils]: 35: Hoare triple {10656#true} assume true; {10656#true} is VALID [2022-04-27 14:36:37,925 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10656#true} {10751#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} #51#return; {10751#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-27 14:36:37,925 INFO L290 TraceCheckUtils]: 37: Hoare triple {10751#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10776#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:36:37,925 INFO L290 TraceCheckUtils]: 38: Hoare triple {10776#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10776#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:36:37,926 INFO L290 TraceCheckUtils]: 39: Hoare triple {10776#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {10776#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:36:37,926 INFO L272 TraceCheckUtils]: 40: Hoare triple {10776#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10656#true} is VALID [2022-04-27 14:36:37,926 INFO L290 TraceCheckUtils]: 41: Hoare triple {10656#true} ~cond := #in~cond; {10656#true} is VALID [2022-04-27 14:36:37,926 INFO L290 TraceCheckUtils]: 42: Hoare triple {10656#true} assume !(0 == ~cond); {10656#true} is VALID [2022-04-27 14:36:37,926 INFO L290 TraceCheckUtils]: 43: Hoare triple {10656#true} assume true; {10656#true} is VALID [2022-04-27 14:36:37,926 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10656#true} {10776#(and (= main_~y~0 4) (= main_~c~0 4))} #51#return; {10776#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:36:37,927 INFO L290 TraceCheckUtils]: 45: Hoare triple {10776#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10801#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:37,927 INFO L290 TraceCheckUtils]: 46: Hoare triple {10801#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10801#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:37,927 INFO L290 TraceCheckUtils]: 47: Hoare triple {10801#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {10801#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:37,927 INFO L272 TraceCheckUtils]: 48: Hoare triple {10801#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10656#true} is VALID [2022-04-27 14:36:37,927 INFO L290 TraceCheckUtils]: 49: Hoare triple {10656#true} ~cond := #in~cond; {10656#true} is VALID [2022-04-27 14:36:37,927 INFO L290 TraceCheckUtils]: 50: Hoare triple {10656#true} assume !(0 == ~cond); {10656#true} is VALID [2022-04-27 14:36:37,927 INFO L290 TraceCheckUtils]: 51: Hoare triple {10656#true} assume true; {10656#true} is VALID [2022-04-27 14:36:37,928 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10656#true} {10801#(and (= 5 main_~c~0) (= 5 main_~y~0))} #51#return; {10801#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:37,928 INFO L290 TraceCheckUtils]: 53: Hoare triple {10801#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:36:37,928 INFO L290 TraceCheckUtils]: 54: Hoare triple {10826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:36:37,929 INFO L290 TraceCheckUtils]: 55: Hoare triple {10826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(#t~post5 < 20);havoc #t~post5; {10826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:36:37,929 INFO L272 TraceCheckUtils]: 56: Hoare triple {10826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10656#true} is VALID [2022-04-27 14:36:37,929 INFO L290 TraceCheckUtils]: 57: Hoare triple {10656#true} ~cond := #in~cond; {10656#true} is VALID [2022-04-27 14:36:37,929 INFO L290 TraceCheckUtils]: 58: Hoare triple {10656#true} assume !(0 == ~cond); {10656#true} is VALID [2022-04-27 14:36:37,929 INFO L290 TraceCheckUtils]: 59: Hoare triple {10656#true} assume true; {10656#true} is VALID [2022-04-27 14:36:37,929 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10656#true} {10826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #51#return; {10826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:36:37,930 INFO L290 TraceCheckUtils]: 61: Hoare triple {10826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10851#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:37,930 INFO L290 TraceCheckUtils]: 62: Hoare triple {10851#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10851#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:37,930 INFO L290 TraceCheckUtils]: 63: Hoare triple {10851#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {10851#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:37,930 INFO L272 TraceCheckUtils]: 64: Hoare triple {10851#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10656#true} is VALID [2022-04-27 14:36:37,930 INFO L290 TraceCheckUtils]: 65: Hoare triple {10656#true} ~cond := #in~cond; {10656#true} is VALID [2022-04-27 14:36:37,930 INFO L290 TraceCheckUtils]: 66: Hoare triple {10656#true} assume !(0 == ~cond); {10656#true} is VALID [2022-04-27 14:36:37,930 INFO L290 TraceCheckUtils]: 67: Hoare triple {10656#true} assume true; {10656#true} is VALID [2022-04-27 14:36:37,931 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10656#true} {10851#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #51#return; {10851#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:37,931 INFO L290 TraceCheckUtils]: 69: Hoare triple {10851#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10876#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:36:37,931 INFO L290 TraceCheckUtils]: 70: Hoare triple {10876#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10876#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:36:37,932 INFO L290 TraceCheckUtils]: 71: Hoare triple {10876#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} assume !!(#t~post5 < 20);havoc #t~post5; {10876#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:36:37,932 INFO L272 TraceCheckUtils]: 72: Hoare triple {10876#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10656#true} is VALID [2022-04-27 14:36:37,932 INFO L290 TraceCheckUtils]: 73: Hoare triple {10656#true} ~cond := #in~cond; {10656#true} is VALID [2022-04-27 14:36:37,932 INFO L290 TraceCheckUtils]: 74: Hoare triple {10656#true} assume !(0 == ~cond); {10656#true} is VALID [2022-04-27 14:36:37,932 INFO L290 TraceCheckUtils]: 75: Hoare triple {10656#true} assume true; {10656#true} is VALID [2022-04-27 14:36:37,932 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10656#true} {10876#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} #51#return; {10876#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:36:37,933 INFO L290 TraceCheckUtils]: 77: Hoare triple {10876#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10901#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:36:37,933 INFO L290 TraceCheckUtils]: 78: Hoare triple {10901#(and (= main_~y~0 9) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10901#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:36:37,933 INFO L290 TraceCheckUtils]: 79: Hoare triple {10901#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {10901#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:36:37,933 INFO L272 TraceCheckUtils]: 80: Hoare triple {10901#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10656#true} is VALID [2022-04-27 14:36:37,933 INFO L290 TraceCheckUtils]: 81: Hoare triple {10656#true} ~cond := #in~cond; {10656#true} is VALID [2022-04-27 14:36:37,933 INFO L290 TraceCheckUtils]: 82: Hoare triple {10656#true} assume !(0 == ~cond); {10656#true} is VALID [2022-04-27 14:36:37,933 INFO L290 TraceCheckUtils]: 83: Hoare triple {10656#true} assume true; {10656#true} is VALID [2022-04-27 14:36:37,934 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {10656#true} {10901#(and (= main_~y~0 9) (= main_~c~0 9))} #51#return; {10901#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:36:37,934 INFO L290 TraceCheckUtils]: 85: Hoare triple {10901#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10926#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:36:37,934 INFO L290 TraceCheckUtils]: 86: Hoare triple {10926#(and (= main_~y~0 10) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10926#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:36:37,935 INFO L290 TraceCheckUtils]: 87: Hoare triple {10926#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(#t~post5 < 20);havoc #t~post5; {10926#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:36:37,935 INFO L272 TraceCheckUtils]: 88: Hoare triple {10926#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10656#true} is VALID [2022-04-27 14:36:37,935 INFO L290 TraceCheckUtils]: 89: Hoare triple {10656#true} ~cond := #in~cond; {10656#true} is VALID [2022-04-27 14:36:37,935 INFO L290 TraceCheckUtils]: 90: Hoare triple {10656#true} assume !(0 == ~cond); {10656#true} is VALID [2022-04-27 14:36:37,935 INFO L290 TraceCheckUtils]: 91: Hoare triple {10656#true} assume true; {10656#true} is VALID [2022-04-27 14:36:37,935 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {10656#true} {10926#(and (= main_~y~0 10) (= main_~c~0 10))} #51#return; {10926#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:36:37,936 INFO L290 TraceCheckUtils]: 93: Hoare triple {10926#(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 + ~x~0; {10951#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:36:37,936 INFO L290 TraceCheckUtils]: 94: Hoare triple {10951#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10951#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:36:37,936 INFO L290 TraceCheckUtils]: 95: Hoare triple {10951#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} assume !!(#t~post5 < 20);havoc #t~post5; {10951#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:36:37,936 INFO L272 TraceCheckUtils]: 96: Hoare triple {10951#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10656#true} is VALID [2022-04-27 14:36:37,936 INFO L290 TraceCheckUtils]: 97: Hoare triple {10656#true} ~cond := #in~cond; {10656#true} is VALID [2022-04-27 14:36:37,936 INFO L290 TraceCheckUtils]: 98: Hoare triple {10656#true} assume !(0 == ~cond); {10656#true} is VALID [2022-04-27 14:36:37,936 INFO L290 TraceCheckUtils]: 99: Hoare triple {10656#true} assume true; {10656#true} is VALID [2022-04-27 14:36:37,939 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {10656#true} {10951#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} #51#return; {10951#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:36:37,940 INFO L290 TraceCheckUtils]: 101: Hoare triple {10951#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} assume !(~c~0 < ~k~0); {10976#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:36:37,941 INFO L272 TraceCheckUtils]: 102: Hoare triple {10976#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10980#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:37,941 INFO L290 TraceCheckUtils]: 103: Hoare triple {10980#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10984#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:37,941 INFO L290 TraceCheckUtils]: 104: Hoare triple {10984#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10657#false} is VALID [2022-04-27 14:36:37,941 INFO L290 TraceCheckUtils]: 105: Hoare triple {10657#false} assume !false; {10657#false} is VALID [2022-04-27 14:36:37,942 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 24 proven. 264 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-27 14:36:37,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:38,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:38,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109397049] [2022-04-27 14:36:38,236 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:38,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26582650] [2022-04-27 14:36:38,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26582650] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:38,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:38,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-27 14:36:38,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104495508] [2022-04-27 14:36:38,237 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:38,237 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 106 [2022-04-27 14:36:38,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:38,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:36:38,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:38,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 14:36:38,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:38,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 14:36:38,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-27 14:36:38,294 INFO L87 Difference]: Start difference. First operand 173 states and 182 transitions. Second operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:36:39,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:39,609 INFO L93 Difference]: Finished difference Result 178 states and 186 transitions. [2022-04-27 14:36:39,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 14:36:39,610 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 106 [2022-04-27 14:36:39,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:39,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:36:39,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 84 transitions. [2022-04-27 14:36:39,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:36:39,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 84 transitions. [2022-04-27 14:36:39,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 84 transitions. [2022-04-27 14:36:39,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:39,681 INFO L225 Difference]: With dead ends: 178 [2022-04-27 14:36:39,681 INFO L226 Difference]: Without dead ends: 173 [2022-04-27 14:36:39,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 100 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-27 14:36:39,682 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:39,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 600 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 14:36:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-27 14:36:39,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-04-27 14:36:39,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:39,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0703125) internal successors, (137), 128 states have internal predecessors, (137), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:36:39,759 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0703125) internal successors, (137), 128 states have internal predecessors, (137), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:36:39,759 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0703125) internal successors, (137), 128 states have internal predecessors, (137), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:36:39,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:39,761 INFO L93 Difference]: Finished difference Result 173 states and 181 transitions. [2022-04-27 14:36:39,761 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 181 transitions. [2022-04-27 14:36:39,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:39,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:39,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 128 states have (on average 1.0703125) internal successors, (137), 128 states have internal predecessors, (137), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-27 14:36:39,762 INFO L87 Difference]: Start difference. First operand has 173 states, 128 states have (on average 1.0703125) internal successors, (137), 128 states have internal predecessors, (137), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-27 14:36:39,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:39,764 INFO L93 Difference]: Finished difference Result 173 states and 181 transitions. [2022-04-27 14:36:39,764 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 181 transitions. [2022-04-27 14:36:39,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:39,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:39,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:39,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:39,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.0703125) internal successors, (137), 128 states have internal predecessors, (137), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:36:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 181 transitions. [2022-04-27 14:36:39,767 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 181 transitions. Word has length 106 [2022-04-27 14:36:39,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:39,767 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 181 transitions. [2022-04-27 14:36:39,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:36:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 181 transitions. [2022-04-27 14:36:39,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-27 14:36:39,768 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:39,768 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:39,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-27 14:36:39,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 14:36:39,973 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:39,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:39,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1170284597, now seen corresponding path program 12 times [2022-04-27 14:36:39,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:39,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088949472] [2022-04-27 14:36:39,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:39,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:39,987 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:39,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1985287781] [2022-04-27 14:36:39,988 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:36:39,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:39,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:39,989 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:39,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-27 14:36:40,492 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-27 14:36:40,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:40,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-27 14:36:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:40,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:41,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {11872#true} call ULTIMATE.init(); {11872#true} is VALID [2022-04-27 14:36:41,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {11872#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11872#true} is VALID [2022-04-27 14:36:41,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {11872#true} assume true; {11872#true} is VALID [2022-04-27 14:36:41,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11872#true} {11872#true} #57#return; {11872#true} is VALID [2022-04-27 14:36:41,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {11872#true} call #t~ret6 := main(); {11872#true} is VALID [2022-04-27 14:36:41,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {11872#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {11892#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:41,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {11892#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11892#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:41,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {11892#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {11892#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:41,055 INFO L272 TraceCheckUtils]: 8: Hoare triple {11892#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11872#true} is VALID [2022-04-27 14:36:41,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {11872#true} ~cond := #in~cond; {11872#true} is VALID [2022-04-27 14:36:41,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {11872#true} assume !(0 == ~cond); {11872#true} is VALID [2022-04-27 14:36:41,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {11872#true} assume true; {11872#true} is VALID [2022-04-27 14:36:41,056 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11872#true} {11892#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {11892#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:41,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {11892#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11917#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:41,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {11917#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11917#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:41,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {11917#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {11917#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:41,057 INFO L272 TraceCheckUtils]: 16: Hoare triple {11917#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11872#true} is VALID [2022-04-27 14:36:41,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {11872#true} ~cond := #in~cond; {11872#true} is VALID [2022-04-27 14:36:41,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {11872#true} assume !(0 == ~cond); {11872#true} is VALID [2022-04-27 14:36:41,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {11872#true} assume true; {11872#true} is VALID [2022-04-27 14:36:41,057 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {11872#true} {11917#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {11917#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:41,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {11917#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11942#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:36:41,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {11942#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11942#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:36:41,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {11942#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {11942#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:36:41,058 INFO L272 TraceCheckUtils]: 24: Hoare triple {11942#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11872#true} is VALID [2022-04-27 14:36:41,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {11872#true} ~cond := #in~cond; {11872#true} is VALID [2022-04-27 14:36:41,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {11872#true} assume !(0 == ~cond); {11872#true} is VALID [2022-04-27 14:36:41,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {11872#true} assume true; {11872#true} is VALID [2022-04-27 14:36:41,059 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {11872#true} {11942#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #51#return; {11942#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:36:41,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {11942#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11967#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-27 14:36:41,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {11967#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11967#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-27 14:36:41,060 INFO L290 TraceCheckUtils]: 31: Hoare triple {11967#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {11967#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-27 14:36:41,060 INFO L272 TraceCheckUtils]: 32: Hoare triple {11967#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11872#true} is VALID [2022-04-27 14:36:41,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {11872#true} ~cond := #in~cond; {11872#true} is VALID [2022-04-27 14:36:41,060 INFO L290 TraceCheckUtils]: 34: Hoare triple {11872#true} assume !(0 == ~cond); {11872#true} is VALID [2022-04-27 14:36:41,060 INFO L290 TraceCheckUtils]: 35: Hoare triple {11872#true} assume true; {11872#true} is VALID [2022-04-27 14:36:41,060 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11872#true} {11967#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} #51#return; {11967#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-27 14:36:41,061 INFO L290 TraceCheckUtils]: 37: Hoare triple {11967#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11992#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-27 14:36:41,061 INFO L290 TraceCheckUtils]: 38: Hoare triple {11992#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11992#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-27 14:36:41,061 INFO L290 TraceCheckUtils]: 39: Hoare triple {11992#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {11992#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-27 14:36:41,061 INFO L272 TraceCheckUtils]: 40: Hoare triple {11992#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11872#true} is VALID [2022-04-27 14:36:41,061 INFO L290 TraceCheckUtils]: 41: Hoare triple {11872#true} ~cond := #in~cond; {11872#true} is VALID [2022-04-27 14:36:41,061 INFO L290 TraceCheckUtils]: 42: Hoare triple {11872#true} assume !(0 == ~cond); {11872#true} is VALID [2022-04-27 14:36:41,061 INFO L290 TraceCheckUtils]: 43: Hoare triple {11872#true} assume true; {11872#true} is VALID [2022-04-27 14:36:41,062 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {11872#true} {11992#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #51#return; {11992#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-27 14:36:41,062 INFO L290 TraceCheckUtils]: 45: Hoare triple {11992#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12017#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:36:41,062 INFO L290 TraceCheckUtils]: 46: Hoare triple {12017#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12017#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:36:41,063 INFO L290 TraceCheckUtils]: 47: Hoare triple {12017#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {12017#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:36:41,063 INFO L272 TraceCheckUtils]: 48: Hoare triple {12017#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11872#true} is VALID [2022-04-27 14:36:41,063 INFO L290 TraceCheckUtils]: 49: Hoare triple {11872#true} ~cond := #in~cond; {11872#true} is VALID [2022-04-27 14:36:41,063 INFO L290 TraceCheckUtils]: 50: Hoare triple {11872#true} assume !(0 == ~cond); {11872#true} is VALID [2022-04-27 14:36:41,063 INFO L290 TraceCheckUtils]: 51: Hoare triple {11872#true} assume true; {11872#true} is VALID [2022-04-27 14:36:41,063 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11872#true} {12017#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #51#return; {12017#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:36:41,064 INFO L290 TraceCheckUtils]: 53: Hoare triple {12017#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12042#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:36:41,064 INFO L290 TraceCheckUtils]: 54: Hoare triple {12042#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12042#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:36:41,064 INFO L290 TraceCheckUtils]: 55: Hoare triple {12042#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(#t~post5 < 20);havoc #t~post5; {12042#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:36:41,064 INFO L272 TraceCheckUtils]: 56: Hoare triple {12042#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11872#true} is VALID [2022-04-27 14:36:41,064 INFO L290 TraceCheckUtils]: 57: Hoare triple {11872#true} ~cond := #in~cond; {11872#true} is VALID [2022-04-27 14:36:41,064 INFO L290 TraceCheckUtils]: 58: Hoare triple {11872#true} assume !(0 == ~cond); {11872#true} is VALID [2022-04-27 14:36:41,064 INFO L290 TraceCheckUtils]: 59: Hoare triple {11872#true} assume true; {11872#true} is VALID [2022-04-27 14:36:41,065 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11872#true} {12042#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #51#return; {12042#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:36:41,065 INFO L290 TraceCheckUtils]: 61: Hoare triple {12042#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:41,065 INFO L290 TraceCheckUtils]: 62: Hoare triple {12067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:41,066 INFO L290 TraceCheckUtils]: 63: Hoare triple {12067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {12067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:41,066 INFO L272 TraceCheckUtils]: 64: Hoare triple {12067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11872#true} is VALID [2022-04-27 14:36:41,066 INFO L290 TraceCheckUtils]: 65: Hoare triple {11872#true} ~cond := #in~cond; {11872#true} is VALID [2022-04-27 14:36:41,066 INFO L290 TraceCheckUtils]: 66: Hoare triple {11872#true} assume !(0 == ~cond); {11872#true} is VALID [2022-04-27 14:36:41,066 INFO L290 TraceCheckUtils]: 67: Hoare triple {11872#true} assume true; {11872#true} is VALID [2022-04-27 14:36:41,066 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11872#true} {12067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #51#return; {12067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:41,067 INFO L290 TraceCheckUtils]: 69: Hoare triple {12067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12092#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:36:41,067 INFO L290 TraceCheckUtils]: 70: Hoare triple {12092#(and (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12092#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:36:41,067 INFO L290 TraceCheckUtils]: 71: Hoare triple {12092#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {12092#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:36:41,067 INFO L272 TraceCheckUtils]: 72: Hoare triple {12092#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11872#true} is VALID [2022-04-27 14:36:41,067 INFO L290 TraceCheckUtils]: 73: Hoare triple {11872#true} ~cond := #in~cond; {11872#true} is VALID [2022-04-27 14:36:41,067 INFO L290 TraceCheckUtils]: 74: Hoare triple {11872#true} assume !(0 == ~cond); {11872#true} is VALID [2022-04-27 14:36:41,067 INFO L290 TraceCheckUtils]: 75: Hoare triple {11872#true} assume true; {11872#true} is VALID [2022-04-27 14:36:41,068 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {11872#true} {12092#(and (= main_~y~0 8) (= main_~c~0 8))} #51#return; {12092#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:36:41,068 INFO L290 TraceCheckUtils]: 77: Hoare triple {12092#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12117#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:36:41,068 INFO L290 TraceCheckUtils]: 78: Hoare triple {12117#(and (= main_~y~0 9) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12117#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:36:41,069 INFO L290 TraceCheckUtils]: 79: Hoare triple {12117#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {12117#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:36:41,069 INFO L272 TraceCheckUtils]: 80: Hoare triple {12117#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11872#true} is VALID [2022-04-27 14:36:41,069 INFO L290 TraceCheckUtils]: 81: Hoare triple {11872#true} ~cond := #in~cond; {11872#true} is VALID [2022-04-27 14:36:41,069 INFO L290 TraceCheckUtils]: 82: Hoare triple {11872#true} assume !(0 == ~cond); {11872#true} is VALID [2022-04-27 14:36:41,069 INFO L290 TraceCheckUtils]: 83: Hoare triple {11872#true} assume true; {11872#true} is VALID [2022-04-27 14:36:41,069 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {11872#true} {12117#(and (= main_~y~0 9) (= main_~c~0 9))} #51#return; {12117#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:36:41,070 INFO L290 TraceCheckUtils]: 85: Hoare triple {12117#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12142#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:36:41,070 INFO L290 TraceCheckUtils]: 86: Hoare triple {12142#(and (= main_~y~0 10) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12142#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:36:41,070 INFO L290 TraceCheckUtils]: 87: Hoare triple {12142#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(#t~post5 < 20);havoc #t~post5; {12142#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:36:41,070 INFO L272 TraceCheckUtils]: 88: Hoare triple {12142#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11872#true} is VALID [2022-04-27 14:36:41,070 INFO L290 TraceCheckUtils]: 89: Hoare triple {11872#true} ~cond := #in~cond; {11872#true} is VALID [2022-04-27 14:36:41,070 INFO L290 TraceCheckUtils]: 90: Hoare triple {11872#true} assume !(0 == ~cond); {11872#true} is VALID [2022-04-27 14:36:41,070 INFO L290 TraceCheckUtils]: 91: Hoare triple {11872#true} assume true; {11872#true} is VALID [2022-04-27 14:36:41,071 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {11872#true} {12142#(and (= main_~y~0 10) (= main_~c~0 10))} #51#return; {12142#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:36:41,071 INFO L290 TraceCheckUtils]: 93: Hoare triple {12142#(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 + ~x~0; {12167#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 14:36:41,071 INFO L290 TraceCheckUtils]: 94: Hoare triple {12167#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12167#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 14:36:41,072 INFO L290 TraceCheckUtils]: 95: Hoare triple {12167#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !!(#t~post5 < 20);havoc #t~post5; {12167#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 14:36:41,072 INFO L272 TraceCheckUtils]: 96: Hoare triple {12167#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11872#true} is VALID [2022-04-27 14:36:41,072 INFO L290 TraceCheckUtils]: 97: Hoare triple {11872#true} ~cond := #in~cond; {11872#true} is VALID [2022-04-27 14:36:41,072 INFO L290 TraceCheckUtils]: 98: Hoare triple {11872#true} assume !(0 == ~cond); {11872#true} is VALID [2022-04-27 14:36:41,072 INFO L290 TraceCheckUtils]: 99: Hoare triple {11872#true} assume true; {11872#true} is VALID [2022-04-27 14:36:41,072 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {11872#true} {12167#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #51#return; {12167#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 14:36:41,073 INFO L290 TraceCheckUtils]: 101: Hoare triple {12167#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12192#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-27 14:36:41,073 INFO L290 TraceCheckUtils]: 102: Hoare triple {12192#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12192#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-27 14:36:41,073 INFO L290 TraceCheckUtils]: 103: Hoare triple {12192#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {12192#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-27 14:36:41,073 INFO L272 TraceCheckUtils]: 104: Hoare triple {12192#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11872#true} is VALID [2022-04-27 14:36:41,073 INFO L290 TraceCheckUtils]: 105: Hoare triple {11872#true} ~cond := #in~cond; {11872#true} is VALID [2022-04-27 14:36:41,073 INFO L290 TraceCheckUtils]: 106: Hoare triple {11872#true} assume !(0 == ~cond); {11872#true} is VALID [2022-04-27 14:36:41,073 INFO L290 TraceCheckUtils]: 107: Hoare triple {11872#true} assume true; {11872#true} is VALID [2022-04-27 14:36:41,074 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {11872#true} {12192#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} #51#return; {12192#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-27 14:36:41,074 INFO L290 TraceCheckUtils]: 109: Hoare triple {12192#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !(~c~0 < ~k~0); {12217#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-27 14:36:41,075 INFO L272 TraceCheckUtils]: 110: Hoare triple {12217#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12221#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:41,075 INFO L290 TraceCheckUtils]: 111: Hoare triple {12221#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12225#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:41,075 INFO L290 TraceCheckUtils]: 112: Hoare triple {12225#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11873#false} is VALID [2022-04-27 14:36:41,075 INFO L290 TraceCheckUtils]: 113: Hoare triple {11873#false} assume !false; {11873#false} is VALID [2022-04-27 14:36:41,076 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 26 proven. 312 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-27 14:36:41,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:41,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:41,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088949472] [2022-04-27 14:36:41,351 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:41,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985287781] [2022-04-27 14:36:41,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985287781] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:41,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:41,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-27 14:36:41,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047457941] [2022-04-27 14:36:41,352 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:41,352 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 114 [2022-04-27 14:36:41,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:41,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:36:41,408 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-27 14:36:41,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 14:36:41,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:41,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 14:36:41,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-27 14:36:41,409 INFO L87 Difference]: Start difference. First operand 173 states and 181 transitions. Second operand has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:36:42,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:42,935 INFO L93 Difference]: Finished difference Result 178 states and 185 transitions. [2022-04-27 14:36:42,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 14:36:42,935 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 114 [2022-04-27 14:36:42,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:42,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:36:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2022-04-27 14:36:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:36:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2022-04-27 14:36:42,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 89 transitions. [2022-04-27 14:36:43,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:43,016 INFO L225 Difference]: With dead ends: 178 [2022-04-27 14:36:43,016 INFO L226 Difference]: Without dead ends: 173 [2022-04-27 14:36:43,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2022-04-27 14:36:43,017 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 2 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:43,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 672 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 14:36:43,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-27 14:36:43,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-04-27 14:36:43,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:43,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0625) internal successors, (136), 128 states have internal predecessors, (136), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:36:43,100 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0625) internal successors, (136), 128 states have internal predecessors, (136), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:36:43,100 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0625) internal successors, (136), 128 states have internal predecessors, (136), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:36:43,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:43,102 INFO L93 Difference]: Finished difference Result 173 states and 180 transitions. [2022-04-27 14:36:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 180 transitions. [2022-04-27 14:36:43,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:43,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:43,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 128 states have (on average 1.0625) internal successors, (136), 128 states have internal predecessors, (136), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-27 14:36:43,102 INFO L87 Difference]: Start difference. First operand has 173 states, 128 states have (on average 1.0625) internal successors, (136), 128 states have internal predecessors, (136), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-27 14:36:43,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:43,105 INFO L93 Difference]: Finished difference Result 173 states and 180 transitions. [2022-04-27 14:36:43,105 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 180 transitions. [2022-04-27 14:36:43,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:43,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:43,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:43,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.0625) internal successors, (136), 128 states have internal predecessors, (136), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:36:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 180 transitions. [2022-04-27 14:36:43,109 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 180 transitions. Word has length 114 [2022-04-27 14:36:43,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:43,109 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 180 transitions. [2022-04-27 14:36:43,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:36:43,109 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 180 transitions. [2022-04-27 14:36:43,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-27 14:36:43,110 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:43,110 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:43,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-27 14:36:43,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:43,315 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:43,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:43,315 INFO L85 PathProgramCache]: Analyzing trace with hash -966570034, now seen corresponding path program 13 times [2022-04-27 14:36:43,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:43,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605709942] [2022-04-27 14:36:43,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:43,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:43,327 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:43,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1663730525] [2022-04-27 14:36:43,328 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:36:43,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:43,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:43,335 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:43,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-27 14:36:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:44,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-27 14:36:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:44,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:45,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {13113#true} call ULTIMATE.init(); {13113#true} is VALID [2022-04-27 14:36:45,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {13113#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13113#true} is VALID [2022-04-27 14:36:45,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {13113#true} assume true; {13113#true} is VALID [2022-04-27 14:36:45,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13113#true} {13113#true} #57#return; {13113#true} is VALID [2022-04-27 14:36:45,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {13113#true} call #t~ret6 := main(); {13113#true} is VALID [2022-04-27 14:36:45,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {13113#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {13133#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:45,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {13133#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13133#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:45,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {13133#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {13133#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:45,010 INFO L272 TraceCheckUtils]: 8: Hoare triple {13133#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13113#true} is VALID [2022-04-27 14:36:45,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {13113#true} ~cond := #in~cond; {13113#true} is VALID [2022-04-27 14:36:45,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {13113#true} assume !(0 == ~cond); {13113#true} is VALID [2022-04-27 14:36:45,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {13113#true} assume true; {13113#true} is VALID [2022-04-27 14:36:45,011 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13113#true} {13133#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {13133#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:45,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {13133#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13158#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:45,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {13158#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13158#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:45,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {13158#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {13158#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:45,012 INFO L272 TraceCheckUtils]: 16: Hoare triple {13158#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13113#true} is VALID [2022-04-27 14:36:45,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {13113#true} ~cond := #in~cond; {13113#true} is VALID [2022-04-27 14:36:45,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {13113#true} assume !(0 == ~cond); {13113#true} is VALID [2022-04-27 14:36:45,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {13113#true} assume true; {13113#true} is VALID [2022-04-27 14:36:45,012 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13113#true} {13158#(and (= main_~y~0 1) (= main_~c~0 1))} #51#return; {13158#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:45,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {13158#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13183#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:36:45,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {13183#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13183#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:36:45,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {13183#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {13183#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:36:45,013 INFO L272 TraceCheckUtils]: 24: Hoare triple {13183#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13113#true} is VALID [2022-04-27 14:36:45,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {13113#true} ~cond := #in~cond; {13113#true} is VALID [2022-04-27 14:36:45,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {13113#true} assume !(0 == ~cond); {13113#true} is VALID [2022-04-27 14:36:45,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {13113#true} assume true; {13113#true} is VALID [2022-04-27 14:36:45,014 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {13113#true} {13183#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #51#return; {13183#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:36:45,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {13183#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13208#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:36:45,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {13208#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13208#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:36:45,015 INFO L290 TraceCheckUtils]: 31: Hoare triple {13208#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {13208#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:36:45,015 INFO L272 TraceCheckUtils]: 32: Hoare triple {13208#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13113#true} is VALID [2022-04-27 14:36:45,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {13113#true} ~cond := #in~cond; {13113#true} is VALID [2022-04-27 14:36:45,015 INFO L290 TraceCheckUtils]: 34: Hoare triple {13113#true} assume !(0 == ~cond); {13113#true} is VALID [2022-04-27 14:36:45,015 INFO L290 TraceCheckUtils]: 35: Hoare triple {13113#true} assume true; {13113#true} is VALID [2022-04-27 14:36:45,015 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13113#true} {13208#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} #51#return; {13208#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:36:45,016 INFO L290 TraceCheckUtils]: 37: Hoare triple {13208#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13233#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:36:45,016 INFO L290 TraceCheckUtils]: 38: Hoare triple {13233#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13233#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:36:45,016 INFO L290 TraceCheckUtils]: 39: Hoare triple {13233#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {13233#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:36:45,016 INFO L272 TraceCheckUtils]: 40: Hoare triple {13233#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13113#true} is VALID [2022-04-27 14:36:45,016 INFO L290 TraceCheckUtils]: 41: Hoare triple {13113#true} ~cond := #in~cond; {13113#true} is VALID [2022-04-27 14:36:45,016 INFO L290 TraceCheckUtils]: 42: Hoare triple {13113#true} assume !(0 == ~cond); {13113#true} is VALID [2022-04-27 14:36:45,017 INFO L290 TraceCheckUtils]: 43: Hoare triple {13113#true} assume true; {13113#true} is VALID [2022-04-27 14:36:45,019 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13113#true} {13233#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #51#return; {13233#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:36:45,020 INFO L290 TraceCheckUtils]: 45: Hoare triple {13233#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13258#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:45,020 INFO L290 TraceCheckUtils]: 46: Hoare triple {13258#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13258#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:45,021 INFO L290 TraceCheckUtils]: 47: Hoare triple {13258#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {13258#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:45,021 INFO L272 TraceCheckUtils]: 48: Hoare triple {13258#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13113#true} is VALID [2022-04-27 14:36:45,021 INFO L290 TraceCheckUtils]: 49: Hoare triple {13113#true} ~cond := #in~cond; {13113#true} is VALID [2022-04-27 14:36:45,021 INFO L290 TraceCheckUtils]: 50: Hoare triple {13113#true} assume !(0 == ~cond); {13113#true} is VALID [2022-04-27 14:36:45,021 INFO L290 TraceCheckUtils]: 51: Hoare triple {13113#true} assume true; {13113#true} is VALID [2022-04-27 14:36:45,024 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13113#true} {13258#(and (= 5 main_~c~0) (= 5 main_~y~0))} #51#return; {13258#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:45,024 INFO L290 TraceCheckUtils]: 53: Hoare triple {13258#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13283#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:36:45,025 INFO L290 TraceCheckUtils]: 54: Hoare triple {13283#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13283#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:36:45,025 INFO L290 TraceCheckUtils]: 55: Hoare triple {13283#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {13283#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:36:45,025 INFO L272 TraceCheckUtils]: 56: Hoare triple {13283#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13113#true} is VALID [2022-04-27 14:36:45,025 INFO L290 TraceCheckUtils]: 57: Hoare triple {13113#true} ~cond := #in~cond; {13113#true} is VALID [2022-04-27 14:36:45,025 INFO L290 TraceCheckUtils]: 58: Hoare triple {13113#true} assume !(0 == ~cond); {13113#true} is VALID [2022-04-27 14:36:45,025 INFO L290 TraceCheckUtils]: 59: Hoare triple {13113#true} assume true; {13113#true} is VALID [2022-04-27 14:36:45,026 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13113#true} {13283#(and (= main_~y~0 6) (= main_~c~0 6))} #51#return; {13283#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:36:45,026 INFO L290 TraceCheckUtils]: 61: Hoare triple {13283#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13308#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:36:45,026 INFO L290 TraceCheckUtils]: 62: Hoare triple {13308#(and (= 7 main_~y~0) (= 7 main_~c~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13308#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:36:45,027 INFO L290 TraceCheckUtils]: 63: Hoare triple {13308#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(#t~post5 < 20);havoc #t~post5; {13308#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:36:45,027 INFO L272 TraceCheckUtils]: 64: Hoare triple {13308#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13113#true} is VALID [2022-04-27 14:36:45,027 INFO L290 TraceCheckUtils]: 65: Hoare triple {13113#true} ~cond := #in~cond; {13113#true} is VALID [2022-04-27 14:36:45,027 INFO L290 TraceCheckUtils]: 66: Hoare triple {13113#true} assume !(0 == ~cond); {13113#true} is VALID [2022-04-27 14:36:45,027 INFO L290 TraceCheckUtils]: 67: Hoare triple {13113#true} assume true; {13113#true} is VALID [2022-04-27 14:36:45,027 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13113#true} {13308#(and (= 7 main_~y~0) (= 7 main_~c~0))} #51#return; {13308#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:36:45,028 INFO L290 TraceCheckUtils]: 69: Hoare triple {13308#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13333#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:36:45,028 INFO L290 TraceCheckUtils]: 70: Hoare triple {13333#(and (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13333#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:36:45,028 INFO L290 TraceCheckUtils]: 71: Hoare triple {13333#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {13333#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:36:45,028 INFO L272 TraceCheckUtils]: 72: Hoare triple {13333#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13113#true} is VALID [2022-04-27 14:36:45,028 INFO L290 TraceCheckUtils]: 73: Hoare triple {13113#true} ~cond := #in~cond; {13113#true} is VALID [2022-04-27 14:36:45,028 INFO L290 TraceCheckUtils]: 74: Hoare triple {13113#true} assume !(0 == ~cond); {13113#true} is VALID [2022-04-27 14:36:45,028 INFO L290 TraceCheckUtils]: 75: Hoare triple {13113#true} assume true; {13113#true} is VALID [2022-04-27 14:36:45,029 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {13113#true} {13333#(and (= main_~y~0 8) (= main_~c~0 8))} #51#return; {13333#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:36:45,029 INFO L290 TraceCheckUtils]: 77: Hoare triple {13333#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13358#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:36:45,029 INFO L290 TraceCheckUtils]: 78: Hoare triple {13358#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13358#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:36:45,030 INFO L290 TraceCheckUtils]: 79: Hoare triple {13358#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {13358#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:36:45,030 INFO L272 TraceCheckUtils]: 80: Hoare triple {13358#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13113#true} is VALID [2022-04-27 14:36:45,030 INFO L290 TraceCheckUtils]: 81: Hoare triple {13113#true} ~cond := #in~cond; {13113#true} is VALID [2022-04-27 14:36:45,030 INFO L290 TraceCheckUtils]: 82: Hoare triple {13113#true} assume !(0 == ~cond); {13113#true} is VALID [2022-04-27 14:36:45,030 INFO L290 TraceCheckUtils]: 83: Hoare triple {13113#true} assume true; {13113#true} is VALID [2022-04-27 14:36:45,030 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {13113#true} {13358#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #51#return; {13358#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:36:45,031 INFO L290 TraceCheckUtils]: 85: Hoare triple {13358#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13383#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:36:45,031 INFO L290 TraceCheckUtils]: 86: Hoare triple {13383#(and (= main_~y~0 10) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13383#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:36:45,031 INFO L290 TraceCheckUtils]: 87: Hoare triple {13383#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(#t~post5 < 20);havoc #t~post5; {13383#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:36:45,031 INFO L272 TraceCheckUtils]: 88: Hoare triple {13383#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13113#true} is VALID [2022-04-27 14:36:45,031 INFO L290 TraceCheckUtils]: 89: Hoare triple {13113#true} ~cond := #in~cond; {13113#true} is VALID [2022-04-27 14:36:45,031 INFO L290 TraceCheckUtils]: 90: Hoare triple {13113#true} assume !(0 == ~cond); {13113#true} is VALID [2022-04-27 14:36:45,031 INFO L290 TraceCheckUtils]: 91: Hoare triple {13113#true} assume true; {13113#true} is VALID [2022-04-27 14:36:45,032 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {13113#true} {13383#(and (= main_~y~0 10) (= main_~c~0 10))} #51#return; {13383#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:36:45,032 INFO L290 TraceCheckUtils]: 93: Hoare triple {13383#(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 + ~x~0; {13408#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:36:45,032 INFO L290 TraceCheckUtils]: 94: Hoare triple {13408#(and (= main_~c~0 11) (= main_~y~0 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13408#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:36:45,033 INFO L290 TraceCheckUtils]: 95: Hoare triple {13408#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(#t~post5 < 20);havoc #t~post5; {13408#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:36:45,033 INFO L272 TraceCheckUtils]: 96: Hoare triple {13408#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13113#true} is VALID [2022-04-27 14:36:45,033 INFO L290 TraceCheckUtils]: 97: Hoare triple {13113#true} ~cond := #in~cond; {13113#true} is VALID [2022-04-27 14:36:45,033 INFO L290 TraceCheckUtils]: 98: Hoare triple {13113#true} assume !(0 == ~cond); {13113#true} is VALID [2022-04-27 14:36:45,033 INFO L290 TraceCheckUtils]: 99: Hoare triple {13113#true} assume true; {13113#true} is VALID [2022-04-27 14:36:45,033 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {13113#true} {13408#(and (= main_~c~0 11) (= main_~y~0 11))} #51#return; {13408#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:36:45,034 INFO L290 TraceCheckUtils]: 101: Hoare triple {13408#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13433#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 14:36:45,034 INFO L290 TraceCheckUtils]: 102: Hoare triple {13433#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13433#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 14:36:45,034 INFO L290 TraceCheckUtils]: 103: Hoare triple {13433#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !!(#t~post5 < 20);havoc #t~post5; {13433#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 14:36:45,034 INFO L272 TraceCheckUtils]: 104: Hoare triple {13433#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13113#true} is VALID [2022-04-27 14:36:45,034 INFO L290 TraceCheckUtils]: 105: Hoare triple {13113#true} ~cond := #in~cond; {13113#true} is VALID [2022-04-27 14:36:45,034 INFO L290 TraceCheckUtils]: 106: Hoare triple {13113#true} assume !(0 == ~cond); {13113#true} is VALID [2022-04-27 14:36:45,034 INFO L290 TraceCheckUtils]: 107: Hoare triple {13113#true} assume true; {13113#true} is VALID [2022-04-27 14:36:45,035 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {13113#true} {13433#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #51#return; {13433#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 14:36:45,036 INFO L290 TraceCheckUtils]: 109: Hoare triple {13433#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13458#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:36:45,036 INFO L290 TraceCheckUtils]: 110: Hoare triple {13458#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13458#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:36:45,036 INFO L290 TraceCheckUtils]: 111: Hoare triple {13458#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !!(#t~post5 < 20);havoc #t~post5; {13458#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:36:45,036 INFO L272 TraceCheckUtils]: 112: Hoare triple {13458#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13113#true} is VALID [2022-04-27 14:36:45,037 INFO L290 TraceCheckUtils]: 113: Hoare triple {13113#true} ~cond := #in~cond; {13471#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:45,037 INFO L290 TraceCheckUtils]: 114: Hoare triple {13471#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13475#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:36:45,037 INFO L290 TraceCheckUtils]: 115: Hoare triple {13475#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13475#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:36:45,038 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {13475#(not (= |__VERIFIER_assert_#in~cond| 0))} {13458#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} #51#return; {13458#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:36:45,039 INFO L290 TraceCheckUtils]: 117: Hoare triple {13458#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !(~c~0 < ~k~0); {13485#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:36:45,039 INFO L272 TraceCheckUtils]: 118: Hoare triple {13485#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13489#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:45,040 INFO L290 TraceCheckUtils]: 119: Hoare triple {13489#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13493#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:45,040 INFO L290 TraceCheckUtils]: 120: Hoare triple {13493#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13114#false} is VALID [2022-04-27 14:36:45,040 INFO L290 TraceCheckUtils]: 121: Hoare triple {13114#false} assume !false; {13114#false} is VALID [2022-04-27 14:36:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 66 proven. 365 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-04-27 14:36:45,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:03,424 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0))))) (not (= (mod (+ (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* c_main_~y~0 c_main_~y~0) (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) is different from false [2022-04-27 14:37:05,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:05,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605709942] [2022-04-27 14:37:05,485 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:05,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663730525] [2022-04-27 14:37:05,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663730525] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:05,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:05,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-27 14:37:05,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47708374] [2022-04-27 14:37:05,486 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:05,486 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 122 [2022-04-27 14:37:05,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:05,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:37:05,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:05,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 14:37:05,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:05,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 14:37:05,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=539, Unknown=1, NotChecked=46, Total=650 [2022-04-27 14:37:05,556 INFO L87 Difference]: Start difference. First operand 173 states and 180 transitions. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:37:07,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:07,719 INFO L93 Difference]: Finished difference Result 178 states and 184 transitions. [2022-04-27 14:37:07,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 14:37:07,720 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 122 [2022-04-27 14:37:07,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:07,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:37:07,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 94 transitions. [2022-04-27 14:37:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:37:07,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 94 transitions. [2022-04-27 14:37:07,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 94 transitions. [2022-04-27 14:37:07,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:07,804 INFO L225 Difference]: With dead ends: 178 [2022-04-27 14:37:07,804 INFO L226 Difference]: Without dead ends: 173 [2022-04-27 14:37:07,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=84, Invalid=675, Unknown=1, NotChecked=52, Total=812 [2022-04-27 14:37:07,804 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:07,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 725 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 14:37:07,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-27 14:37:07,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-04-27 14:37:07,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:07,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0546875) internal successors, (135), 128 states have internal predecessors, (135), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:37:07,887 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0546875) internal successors, (135), 128 states have internal predecessors, (135), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:37:07,888 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0546875) internal successors, (135), 128 states have internal predecessors, (135), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:37:07,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:07,889 INFO L93 Difference]: Finished difference Result 173 states and 179 transitions. [2022-04-27 14:37:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 179 transitions. [2022-04-27 14:37:07,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:07,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:07,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 128 states have (on average 1.0546875) internal successors, (135), 128 states have internal predecessors, (135), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-27 14:37:07,890 INFO L87 Difference]: Start difference. First operand has 173 states, 128 states have (on average 1.0546875) internal successors, (135), 128 states have internal predecessors, (135), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-27 14:37:07,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:07,892 INFO L93 Difference]: Finished difference Result 173 states and 179 transitions. [2022-04-27 14:37:07,892 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 179 transitions. [2022-04-27 14:37:07,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:07,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:07,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:07,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:07,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.0546875) internal successors, (135), 128 states have internal predecessors, (135), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:37:07,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 179 transitions. [2022-04-27 14:37:07,896 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 179 transitions. Word has length 122 [2022-04-27 14:37:07,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:07,896 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 179 transitions. [2022-04-27 14:37:07,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:37:07,897 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 179 transitions. [2022-04-27 14:37:07,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-27 14:37:07,897 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:07,897 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:37:07,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-27 14:37:08,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:08,103 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:08,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:08,104 INFO L85 PathProgramCache]: Analyzing trace with hash 467995857, now seen corresponding path program 14 times [2022-04-27 14:37:08,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:08,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484917163] [2022-04-27 14:37:08,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:08,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:08,132 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:08,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1225151849] [2022-04-27 14:37:08,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:37:08,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:08,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:08,136 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:37:08,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-27 14:37:09,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:37:09,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:09,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-27 14:37:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:09,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:09,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {14385#true} call ULTIMATE.init(); {14385#true} is VALID [2022-04-27 14:37:09,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {14385#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14385#true} is VALID [2022-04-27 14:37:09,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {14385#true} assume true; {14385#true} is VALID [2022-04-27 14:37:09,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14385#true} {14385#true} #57#return; {14385#true} is VALID [2022-04-27 14:37:09,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {14385#true} call #t~ret6 := main(); {14385#true} is VALID [2022-04-27 14:37:09,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {14385#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {14405#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:09,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {14405#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14405#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:09,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {14405#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {14405#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:09,662 INFO L272 TraceCheckUtils]: 8: Hoare triple {14405#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14385#true} is VALID [2022-04-27 14:37:09,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {14385#true} ~cond := #in~cond; {14385#true} is VALID [2022-04-27 14:37:09,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {14385#true} assume !(0 == ~cond); {14385#true} is VALID [2022-04-27 14:37:09,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {14385#true} assume true; {14385#true} is VALID [2022-04-27 14:37:09,662 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {14385#true} {14405#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {14405#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:09,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {14405#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14430#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:09,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {14430#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14430#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:09,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {14430#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {14430#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:09,663 INFO L272 TraceCheckUtils]: 16: Hoare triple {14430#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14385#true} is VALID [2022-04-27 14:37:09,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {14385#true} ~cond := #in~cond; {14385#true} is VALID [2022-04-27 14:37:09,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {14385#true} assume !(0 == ~cond); {14385#true} is VALID [2022-04-27 14:37:09,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {14385#true} assume true; {14385#true} is VALID [2022-04-27 14:37:09,664 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {14385#true} {14430#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {14430#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:09,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {14430#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14455#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:37:09,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {14455#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14455#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:37:09,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {14455#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {14455#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:37:09,665 INFO L272 TraceCheckUtils]: 24: Hoare triple {14455#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14385#true} is VALID [2022-04-27 14:37:09,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {14385#true} ~cond := #in~cond; {14385#true} is VALID [2022-04-27 14:37:09,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {14385#true} assume !(0 == ~cond); {14385#true} is VALID [2022-04-27 14:37:09,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {14385#true} assume true; {14385#true} is VALID [2022-04-27 14:37:09,665 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {14385#true} {14455#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #51#return; {14455#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:37:09,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {14455#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14480#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:37:09,666 INFO L290 TraceCheckUtils]: 30: Hoare triple {14480#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14480#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:37:09,666 INFO L290 TraceCheckUtils]: 31: Hoare triple {14480#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {14480#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:37:09,666 INFO L272 TraceCheckUtils]: 32: Hoare triple {14480#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14385#true} is VALID [2022-04-27 14:37:09,666 INFO L290 TraceCheckUtils]: 33: Hoare triple {14385#true} ~cond := #in~cond; {14385#true} is VALID [2022-04-27 14:37:09,666 INFO L290 TraceCheckUtils]: 34: Hoare triple {14385#true} assume !(0 == ~cond); {14385#true} is VALID [2022-04-27 14:37:09,666 INFO L290 TraceCheckUtils]: 35: Hoare triple {14385#true} assume true; {14385#true} is VALID [2022-04-27 14:37:09,667 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14385#true} {14480#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #51#return; {14480#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:37:09,667 INFO L290 TraceCheckUtils]: 37: Hoare triple {14480#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14505#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:09,667 INFO L290 TraceCheckUtils]: 38: Hoare triple {14505#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14505#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:09,668 INFO L290 TraceCheckUtils]: 39: Hoare triple {14505#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {14505#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:09,668 INFO L272 TraceCheckUtils]: 40: Hoare triple {14505#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14385#true} is VALID [2022-04-27 14:37:09,668 INFO L290 TraceCheckUtils]: 41: Hoare triple {14385#true} ~cond := #in~cond; {14385#true} is VALID [2022-04-27 14:37:09,668 INFO L290 TraceCheckUtils]: 42: Hoare triple {14385#true} assume !(0 == ~cond); {14385#true} is VALID [2022-04-27 14:37:09,668 INFO L290 TraceCheckUtils]: 43: Hoare triple {14385#true} assume true; {14385#true} is VALID [2022-04-27 14:37:09,668 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14385#true} {14505#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #51#return; {14505#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:09,668 INFO L290 TraceCheckUtils]: 45: Hoare triple {14505#(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 + ~x~0; {14530#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-27 14:37:09,669 INFO L290 TraceCheckUtils]: 46: Hoare triple {14530#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14530#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-27 14:37:09,669 INFO L290 TraceCheckUtils]: 47: Hoare triple {14530#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} assume !!(#t~post5 < 20);havoc #t~post5; {14530#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-27 14:37:09,669 INFO L272 TraceCheckUtils]: 48: Hoare triple {14530#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14385#true} is VALID [2022-04-27 14:37:09,669 INFO L290 TraceCheckUtils]: 49: Hoare triple {14385#true} ~cond := #in~cond; {14385#true} is VALID [2022-04-27 14:37:09,669 INFO L290 TraceCheckUtils]: 50: Hoare triple {14385#true} assume !(0 == ~cond); {14385#true} is VALID [2022-04-27 14:37:09,669 INFO L290 TraceCheckUtils]: 51: Hoare triple {14385#true} assume true; {14385#true} is VALID [2022-04-27 14:37:09,670 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14385#true} {14530#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} #51#return; {14530#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-27 14:37:09,670 INFO L290 TraceCheckUtils]: 53: Hoare triple {14530#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14555#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:37:09,670 INFO L290 TraceCheckUtils]: 54: Hoare triple {14555#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14555#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:37:09,671 INFO L290 TraceCheckUtils]: 55: Hoare triple {14555#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {14555#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:37:09,671 INFO L272 TraceCheckUtils]: 56: Hoare triple {14555#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14385#true} is VALID [2022-04-27 14:37:09,671 INFO L290 TraceCheckUtils]: 57: Hoare triple {14385#true} ~cond := #in~cond; {14385#true} is VALID [2022-04-27 14:37:09,671 INFO L290 TraceCheckUtils]: 58: Hoare triple {14385#true} assume !(0 == ~cond); {14385#true} is VALID [2022-04-27 14:37:09,671 INFO L290 TraceCheckUtils]: 59: Hoare triple {14385#true} assume true; {14385#true} is VALID [2022-04-27 14:37:09,671 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14385#true} {14555#(and (= main_~y~0 6) (= main_~c~0 6))} #51#return; {14555#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:37:09,671 INFO L290 TraceCheckUtils]: 61: Hoare triple {14555#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14580#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:09,672 INFO L290 TraceCheckUtils]: 62: Hoare triple {14580#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14580#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:09,672 INFO L290 TraceCheckUtils]: 63: Hoare triple {14580#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {14580#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:09,672 INFO L272 TraceCheckUtils]: 64: Hoare triple {14580#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14385#true} is VALID [2022-04-27 14:37:09,672 INFO L290 TraceCheckUtils]: 65: Hoare triple {14385#true} ~cond := #in~cond; {14385#true} is VALID [2022-04-27 14:37:09,672 INFO L290 TraceCheckUtils]: 66: Hoare triple {14385#true} assume !(0 == ~cond); {14385#true} is VALID [2022-04-27 14:37:09,672 INFO L290 TraceCheckUtils]: 67: Hoare triple {14385#true} assume true; {14385#true} is VALID [2022-04-27 14:37:09,673 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {14385#true} {14580#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #51#return; {14580#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:09,673 INFO L290 TraceCheckUtils]: 69: Hoare triple {14580#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14605#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-27 14:37:09,673 INFO L290 TraceCheckUtils]: 70: Hoare triple {14605#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14605#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-27 14:37:09,674 INFO L290 TraceCheckUtils]: 71: Hoare triple {14605#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {14605#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-27 14:37:09,674 INFO L272 TraceCheckUtils]: 72: Hoare triple {14605#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14385#true} is VALID [2022-04-27 14:37:09,674 INFO L290 TraceCheckUtils]: 73: Hoare triple {14385#true} ~cond := #in~cond; {14385#true} is VALID [2022-04-27 14:37:09,674 INFO L290 TraceCheckUtils]: 74: Hoare triple {14385#true} assume !(0 == ~cond); {14385#true} is VALID [2022-04-27 14:37:09,674 INFO L290 TraceCheckUtils]: 75: Hoare triple {14385#true} assume true; {14385#true} is VALID [2022-04-27 14:37:09,674 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {14385#true} {14605#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #51#return; {14605#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-27 14:37:09,674 INFO L290 TraceCheckUtils]: 77: Hoare triple {14605#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14630#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:37:09,675 INFO L290 TraceCheckUtils]: 78: Hoare triple {14630#(and (= main_~y~0 9) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14630#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:37:09,675 INFO L290 TraceCheckUtils]: 79: Hoare triple {14630#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {14630#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:37:09,675 INFO L272 TraceCheckUtils]: 80: Hoare triple {14630#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14385#true} is VALID [2022-04-27 14:37:09,675 INFO L290 TraceCheckUtils]: 81: Hoare triple {14385#true} ~cond := #in~cond; {14385#true} is VALID [2022-04-27 14:37:09,675 INFO L290 TraceCheckUtils]: 82: Hoare triple {14385#true} assume !(0 == ~cond); {14385#true} is VALID [2022-04-27 14:37:09,675 INFO L290 TraceCheckUtils]: 83: Hoare triple {14385#true} assume true; {14385#true} is VALID [2022-04-27 14:37:09,676 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {14385#true} {14630#(and (= main_~y~0 9) (= main_~c~0 9))} #51#return; {14630#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:37:09,676 INFO L290 TraceCheckUtils]: 85: Hoare triple {14630#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14655#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:37:09,676 INFO L290 TraceCheckUtils]: 86: Hoare triple {14655#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14655#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:37:09,677 INFO L290 TraceCheckUtils]: 87: Hoare triple {14655#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !!(#t~post5 < 20);havoc #t~post5; {14655#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:37:09,677 INFO L272 TraceCheckUtils]: 88: Hoare triple {14655#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14385#true} is VALID [2022-04-27 14:37:09,677 INFO L290 TraceCheckUtils]: 89: Hoare triple {14385#true} ~cond := #in~cond; {14385#true} is VALID [2022-04-27 14:37:09,677 INFO L290 TraceCheckUtils]: 90: Hoare triple {14385#true} assume !(0 == ~cond); {14385#true} is VALID [2022-04-27 14:37:09,677 INFO L290 TraceCheckUtils]: 91: Hoare triple {14385#true} assume true; {14385#true} is VALID [2022-04-27 14:37:09,689 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {14385#true} {14655#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #51#return; {14655#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:37:09,689 INFO L290 TraceCheckUtils]: 93: Hoare triple {14655#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14680#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:37:09,690 INFO L290 TraceCheckUtils]: 94: Hoare triple {14680#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14680#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:37:09,690 INFO L290 TraceCheckUtils]: 95: Hoare triple {14680#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !!(#t~post5 < 20);havoc #t~post5; {14680#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:37:09,690 INFO L272 TraceCheckUtils]: 96: Hoare triple {14680#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14385#true} is VALID [2022-04-27 14:37:09,690 INFO L290 TraceCheckUtils]: 97: Hoare triple {14385#true} ~cond := #in~cond; {14385#true} is VALID [2022-04-27 14:37:09,690 INFO L290 TraceCheckUtils]: 98: Hoare triple {14385#true} assume !(0 == ~cond); {14385#true} is VALID [2022-04-27 14:37:09,690 INFO L290 TraceCheckUtils]: 99: Hoare triple {14385#true} assume true; {14385#true} is VALID [2022-04-27 14:37:09,691 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {14385#true} {14680#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #51#return; {14680#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:37:09,691 INFO L290 TraceCheckUtils]: 101: Hoare triple {14680#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14705#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-27 14:37:09,691 INFO L290 TraceCheckUtils]: 102: Hoare triple {14705#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14705#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-27 14:37:09,692 INFO L290 TraceCheckUtils]: 103: Hoare triple {14705#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} assume !!(#t~post5 < 20);havoc #t~post5; {14705#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-27 14:37:09,692 INFO L272 TraceCheckUtils]: 104: Hoare triple {14705#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14385#true} is VALID [2022-04-27 14:37:09,692 INFO L290 TraceCheckUtils]: 105: Hoare triple {14385#true} ~cond := #in~cond; {14385#true} is VALID [2022-04-27 14:37:09,692 INFO L290 TraceCheckUtils]: 106: Hoare triple {14385#true} assume !(0 == ~cond); {14385#true} is VALID [2022-04-27 14:37:09,692 INFO L290 TraceCheckUtils]: 107: Hoare triple {14385#true} assume true; {14385#true} is VALID [2022-04-27 14:37:09,692 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {14385#true} {14705#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} #51#return; {14705#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-27 14:37:09,693 INFO L290 TraceCheckUtils]: 109: Hoare triple {14705#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14730#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:37:09,693 INFO L290 TraceCheckUtils]: 110: Hoare triple {14730#(and (= main_~c~0 13) (= main_~y~0 13))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14730#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:37:09,693 INFO L290 TraceCheckUtils]: 111: Hoare triple {14730#(and (= main_~c~0 13) (= main_~y~0 13))} assume !!(#t~post5 < 20);havoc #t~post5; {14730#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:37:09,693 INFO L272 TraceCheckUtils]: 112: Hoare triple {14730#(and (= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14385#true} is VALID [2022-04-27 14:37:09,693 INFO L290 TraceCheckUtils]: 113: Hoare triple {14385#true} ~cond := #in~cond; {14385#true} is VALID [2022-04-27 14:37:09,693 INFO L290 TraceCheckUtils]: 114: Hoare triple {14385#true} assume !(0 == ~cond); {14385#true} is VALID [2022-04-27 14:37:09,693 INFO L290 TraceCheckUtils]: 115: Hoare triple {14385#true} assume true; {14385#true} is VALID [2022-04-27 14:37:09,694 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {14385#true} {14730#(and (= main_~c~0 13) (= main_~y~0 13))} #51#return; {14730#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:37:09,694 INFO L290 TraceCheckUtils]: 117: Hoare triple {14730#(and (= main_~c~0 13) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14755#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:37:09,694 INFO L290 TraceCheckUtils]: 118: Hoare triple {14755#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14755#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:37:09,695 INFO L290 TraceCheckUtils]: 119: Hoare triple {14755#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !!(#t~post5 < 20);havoc #t~post5; {14755#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:37:09,695 INFO L272 TraceCheckUtils]: 120: Hoare triple {14755#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14385#true} is VALID [2022-04-27 14:37:09,695 INFO L290 TraceCheckUtils]: 121: Hoare triple {14385#true} ~cond := #in~cond; {14385#true} is VALID [2022-04-27 14:37:09,695 INFO L290 TraceCheckUtils]: 122: Hoare triple {14385#true} assume !(0 == ~cond); {14385#true} is VALID [2022-04-27 14:37:09,695 INFO L290 TraceCheckUtils]: 123: Hoare triple {14385#true} assume true; {14385#true} is VALID [2022-04-27 14:37:09,695 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {14385#true} {14755#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #51#return; {14755#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:37:09,696 INFO L290 TraceCheckUtils]: 125: Hoare triple {14755#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !(~c~0 < ~k~0); {14780#(and (< 13 main_~k~0) (<= main_~k~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:37:09,697 INFO L272 TraceCheckUtils]: 126: Hoare triple {14780#(and (< 13 main_~k~0) (<= main_~k~0 14) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14784#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:37:09,697 INFO L290 TraceCheckUtils]: 127: Hoare triple {14784#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14788#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:37:09,698 INFO L290 TraceCheckUtils]: 128: Hoare triple {14788#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14386#false} is VALID [2022-04-27 14:37:09,698 INFO L290 TraceCheckUtils]: 129: Hoare triple {14386#false} assume !false; {14386#false} is VALID [2022-04-27 14:37:09,698 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 30 proven. 420 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-27 14:37:09,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:10,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:10,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484917163] [2022-04-27 14:37:10,002 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:10,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225151849] [2022-04-27 14:37:10,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225151849] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:10,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:10,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-27 14:37:10,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950522014] [2022-04-27 14:37:10,002 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:10,003 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 130 [2022-04-27 14:37:10,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:10,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:37:10,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:10,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 14:37:10,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:10,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 14:37:10,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-27 14:37:10,070 INFO L87 Difference]: Start difference. First operand 173 states and 179 transitions. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:37:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:12,057 INFO L93 Difference]: Finished difference Result 178 states and 183 transitions. [2022-04-27 14:37:12,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 14:37:12,057 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 130 [2022-04-27 14:37:12,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:37:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 99 transitions. [2022-04-27 14:37:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:37:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 99 transitions. [2022-04-27 14:37:12,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 99 transitions. [2022-04-27 14:37:12,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:12,162 INFO L225 Difference]: With dead ends: 178 [2022-04-27 14:37:12,162 INFO L226 Difference]: Without dead ends: 173 [2022-04-27 14:37:12,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-04-27 14:37:12,163 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 2 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:12,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 828 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 14:37:12,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-27 14:37:12,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-04-27 14:37:12,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:12,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.046875) internal successors, (134), 128 states have internal predecessors, (134), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:37:12,251 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.046875) internal successors, (134), 128 states have internal predecessors, (134), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:37:12,251 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.046875) internal successors, (134), 128 states have internal predecessors, (134), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:37:12,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:12,253 INFO L93 Difference]: Finished difference Result 173 states and 178 transitions. [2022-04-27 14:37:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 178 transitions. [2022-04-27 14:37:12,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:12,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:12,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 128 states have (on average 1.046875) internal successors, (134), 128 states have internal predecessors, (134), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-27 14:37:12,253 INFO L87 Difference]: Start difference. First operand has 173 states, 128 states have (on average 1.046875) internal successors, (134), 128 states have internal predecessors, (134), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-27 14:37:12,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:12,255 INFO L93 Difference]: Finished difference Result 173 states and 178 transitions. [2022-04-27 14:37:12,255 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 178 transitions. [2022-04-27 14:37:12,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:12,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:12,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:12,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:12,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.046875) internal successors, (134), 128 states have internal predecessors, (134), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:37:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 178 transitions. [2022-04-27 14:37:12,257 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 178 transitions. Word has length 130 [2022-04-27 14:37:12,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:12,258 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 178 transitions. [2022-04-27 14:37:12,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:37:12,258 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 178 transitions. [2022-04-27 14:37:12,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-27 14:37:12,259 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:12,259 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:37:12,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-27 14:37:12,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-27 14:37:12,463 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:12,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:12,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1557719340, now seen corresponding path program 15 times [2022-04-27 14:37:12,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:12,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868717679] [2022-04-27 14:37:12,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:12,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:12,478 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:12,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [439385683] [2022-04-27 14:37:12,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:37:12,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:12,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:12,479 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:37:12,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-27 14:37:12,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-04-27 14:37:12,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:12,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-27 14:37:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:13,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:13,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {15676#true} call ULTIMATE.init(); {15676#true} is VALID [2022-04-27 14:37:13,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {15676#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15676#true} is VALID [2022-04-27 14:37:13,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {15676#true} assume true; {15676#true} is VALID [2022-04-27 14:37:13,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15676#true} {15676#true} #57#return; {15676#true} is VALID [2022-04-27 14:37:13,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {15676#true} call #t~ret6 := main(); {15676#true} is VALID [2022-04-27 14:37:13,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {15676#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {15696#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:13,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {15696#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15696#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:13,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {15696#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {15696#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:13,668 INFO L272 TraceCheckUtils]: 8: Hoare triple {15696#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15676#true} is VALID [2022-04-27 14:37:13,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {15676#true} ~cond := #in~cond; {15676#true} is VALID [2022-04-27 14:37:13,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {15676#true} assume !(0 == ~cond); {15676#true} is VALID [2022-04-27 14:37:13,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {15676#true} assume true; {15676#true} is VALID [2022-04-27 14:37:13,669 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15676#true} {15696#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {15696#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:13,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {15696#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15721#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:13,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {15721#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15721#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:13,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {15721#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {15721#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:13,670 INFO L272 TraceCheckUtils]: 16: Hoare triple {15721#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15676#true} is VALID [2022-04-27 14:37:13,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {15676#true} ~cond := #in~cond; {15676#true} is VALID [2022-04-27 14:37:13,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {15676#true} assume !(0 == ~cond); {15676#true} is VALID [2022-04-27 14:37:13,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {15676#true} assume true; {15676#true} is VALID [2022-04-27 14:37:13,670 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {15676#true} {15721#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {15721#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:13,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {15721#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15746#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:37:13,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {15746#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15746#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:37:13,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {15746#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {15746#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:37:13,671 INFO L272 TraceCheckUtils]: 24: Hoare triple {15746#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15676#true} is VALID [2022-04-27 14:37:13,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {15676#true} ~cond := #in~cond; {15676#true} is VALID [2022-04-27 14:37:13,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {15676#true} assume !(0 == ~cond); {15676#true} is VALID [2022-04-27 14:37:13,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {15676#true} assume true; {15676#true} is VALID [2022-04-27 14:37:13,672 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {15676#true} {15746#(and (= main_~y~0 2) (= main_~c~0 2))} #51#return; {15746#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:37:13,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {15746#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15771#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:37:13,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {15771#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15771#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:37:13,673 INFO L290 TraceCheckUtils]: 31: Hoare triple {15771#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {15771#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:37:13,673 INFO L272 TraceCheckUtils]: 32: Hoare triple {15771#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15676#true} is VALID [2022-04-27 14:37:13,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {15676#true} ~cond := #in~cond; {15676#true} is VALID [2022-04-27 14:37:13,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {15676#true} assume !(0 == ~cond); {15676#true} is VALID [2022-04-27 14:37:13,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {15676#true} assume true; {15676#true} is VALID [2022-04-27 14:37:13,673 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {15676#true} {15771#(and (= main_~y~0 3) (= main_~c~0 3))} #51#return; {15771#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:37:13,674 INFO L290 TraceCheckUtils]: 37: Hoare triple {15771#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15796#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:37:13,674 INFO L290 TraceCheckUtils]: 38: Hoare triple {15796#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15796#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:37:13,674 INFO L290 TraceCheckUtils]: 39: Hoare triple {15796#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {15796#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:37:13,674 INFO L272 TraceCheckUtils]: 40: Hoare triple {15796#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15676#true} is VALID [2022-04-27 14:37:13,674 INFO L290 TraceCheckUtils]: 41: Hoare triple {15676#true} ~cond := #in~cond; {15676#true} is VALID [2022-04-27 14:37:13,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {15676#true} assume !(0 == ~cond); {15676#true} is VALID [2022-04-27 14:37:13,674 INFO L290 TraceCheckUtils]: 43: Hoare triple {15676#true} assume true; {15676#true} is VALID [2022-04-27 14:37:13,675 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {15676#true} {15796#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #51#return; {15796#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:37:13,675 INFO L290 TraceCheckUtils]: 45: Hoare triple {15796#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15821#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:13,675 INFO L290 TraceCheckUtils]: 46: Hoare triple {15821#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15821#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:13,676 INFO L290 TraceCheckUtils]: 47: Hoare triple {15821#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {15821#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:13,676 INFO L272 TraceCheckUtils]: 48: Hoare triple {15821#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15676#true} is VALID [2022-04-27 14:37:13,676 INFO L290 TraceCheckUtils]: 49: Hoare triple {15676#true} ~cond := #in~cond; {15676#true} is VALID [2022-04-27 14:37:13,676 INFO L290 TraceCheckUtils]: 50: Hoare triple {15676#true} assume !(0 == ~cond); {15676#true} is VALID [2022-04-27 14:37:13,676 INFO L290 TraceCheckUtils]: 51: Hoare triple {15676#true} assume true; {15676#true} is VALID [2022-04-27 14:37:13,676 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15676#true} {15821#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #51#return; {15821#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:13,677 INFO L290 TraceCheckUtils]: 53: Hoare triple {15821#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15846#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:13,677 INFO L290 TraceCheckUtils]: 54: Hoare triple {15846#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15846#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:13,677 INFO L290 TraceCheckUtils]: 55: Hoare triple {15846#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {15846#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:13,677 INFO L272 TraceCheckUtils]: 56: Hoare triple {15846#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15676#true} is VALID [2022-04-27 14:37:13,677 INFO L290 TraceCheckUtils]: 57: Hoare triple {15676#true} ~cond := #in~cond; {15676#true} is VALID [2022-04-27 14:37:13,677 INFO L290 TraceCheckUtils]: 58: Hoare triple {15676#true} assume !(0 == ~cond); {15676#true} is VALID [2022-04-27 14:37:13,677 INFO L290 TraceCheckUtils]: 59: Hoare triple {15676#true} assume true; {15676#true} is VALID [2022-04-27 14:37:13,678 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {15676#true} {15846#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} #51#return; {15846#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:13,678 INFO L290 TraceCheckUtils]: 61: Hoare triple {15846#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15871#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-27 14:37:13,678 INFO L290 TraceCheckUtils]: 62: Hoare triple {15871#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15871#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-27 14:37:13,679 INFO L290 TraceCheckUtils]: 63: Hoare triple {15871#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {15871#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-27 14:37:13,679 INFO L272 TraceCheckUtils]: 64: Hoare triple {15871#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15676#true} is VALID [2022-04-27 14:37:13,679 INFO L290 TraceCheckUtils]: 65: Hoare triple {15676#true} ~cond := #in~cond; {15676#true} is VALID [2022-04-27 14:37:13,679 INFO L290 TraceCheckUtils]: 66: Hoare triple {15676#true} assume !(0 == ~cond); {15676#true} is VALID [2022-04-27 14:37:13,679 INFO L290 TraceCheckUtils]: 67: Hoare triple {15676#true} assume true; {15676#true} is VALID [2022-04-27 14:37:13,679 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15676#true} {15871#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} #51#return; {15871#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-27 14:37:13,680 INFO L290 TraceCheckUtils]: 69: Hoare triple {15871#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15896#(and (= 3 (+ main_~c~0 (- 5))) (= main_~y~0 8))} is VALID [2022-04-27 14:37:13,680 INFO L290 TraceCheckUtils]: 70: Hoare triple {15896#(and (= 3 (+ main_~c~0 (- 5))) (= main_~y~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15896#(and (= 3 (+ main_~c~0 (- 5))) (= main_~y~0 8))} is VALID [2022-04-27 14:37:13,680 INFO L290 TraceCheckUtils]: 71: Hoare triple {15896#(and (= 3 (+ main_~c~0 (- 5))) (= main_~y~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {15896#(and (= 3 (+ main_~c~0 (- 5))) (= main_~y~0 8))} is VALID [2022-04-27 14:37:13,680 INFO L272 TraceCheckUtils]: 72: Hoare triple {15896#(and (= 3 (+ main_~c~0 (- 5))) (= main_~y~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15676#true} is VALID [2022-04-27 14:37:13,680 INFO L290 TraceCheckUtils]: 73: Hoare triple {15676#true} ~cond := #in~cond; {15676#true} is VALID [2022-04-27 14:37:13,680 INFO L290 TraceCheckUtils]: 74: Hoare triple {15676#true} assume !(0 == ~cond); {15676#true} is VALID [2022-04-27 14:37:13,681 INFO L290 TraceCheckUtils]: 75: Hoare triple {15676#true} assume true; {15676#true} is VALID [2022-04-27 14:37:13,681 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {15676#true} {15896#(and (= 3 (+ main_~c~0 (- 5))) (= main_~y~0 8))} #51#return; {15896#(and (= 3 (+ main_~c~0 (- 5))) (= main_~y~0 8))} is VALID [2022-04-27 14:37:13,681 INFO L290 TraceCheckUtils]: 77: Hoare triple {15896#(and (= 3 (+ main_~c~0 (- 5))) (= main_~y~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15921#(and (= main_~y~0 9) (= 3 (+ main_~c~0 (- 6))))} is VALID [2022-04-27 14:37:13,682 INFO L290 TraceCheckUtils]: 78: Hoare triple {15921#(and (= main_~y~0 9) (= 3 (+ main_~c~0 (- 6))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15921#(and (= main_~y~0 9) (= 3 (+ main_~c~0 (- 6))))} is VALID [2022-04-27 14:37:13,682 INFO L290 TraceCheckUtils]: 79: Hoare triple {15921#(and (= main_~y~0 9) (= 3 (+ main_~c~0 (- 6))))} assume !!(#t~post5 < 20);havoc #t~post5; {15921#(and (= main_~y~0 9) (= 3 (+ main_~c~0 (- 6))))} is VALID [2022-04-27 14:37:13,682 INFO L272 TraceCheckUtils]: 80: Hoare triple {15921#(and (= main_~y~0 9) (= 3 (+ main_~c~0 (- 6))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15676#true} is VALID [2022-04-27 14:37:13,682 INFO L290 TraceCheckUtils]: 81: Hoare triple {15676#true} ~cond := #in~cond; {15676#true} is VALID [2022-04-27 14:37:13,682 INFO L290 TraceCheckUtils]: 82: Hoare triple {15676#true} assume !(0 == ~cond); {15676#true} is VALID [2022-04-27 14:37:13,682 INFO L290 TraceCheckUtils]: 83: Hoare triple {15676#true} assume true; {15676#true} is VALID [2022-04-27 14:37:13,682 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {15676#true} {15921#(and (= main_~y~0 9) (= 3 (+ main_~c~0 (- 6))))} #51#return; {15921#(and (= main_~y~0 9) (= 3 (+ main_~c~0 (- 6))))} is VALID [2022-04-27 14:37:13,683 INFO L290 TraceCheckUtils]: 85: Hoare triple {15921#(and (= main_~y~0 9) (= 3 (+ main_~c~0 (- 6))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15946#(and (= (+ main_~c~0 (- 7)) 3) (= main_~y~0 10))} is VALID [2022-04-27 14:37:13,683 INFO L290 TraceCheckUtils]: 86: Hoare triple {15946#(and (= (+ main_~c~0 (- 7)) 3) (= main_~y~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15946#(and (= (+ main_~c~0 (- 7)) 3) (= main_~y~0 10))} is VALID [2022-04-27 14:37:13,683 INFO L290 TraceCheckUtils]: 87: Hoare triple {15946#(and (= (+ main_~c~0 (- 7)) 3) (= main_~y~0 10))} assume !!(#t~post5 < 20);havoc #t~post5; {15946#(and (= (+ main_~c~0 (- 7)) 3) (= main_~y~0 10))} is VALID [2022-04-27 14:37:13,683 INFO L272 TraceCheckUtils]: 88: Hoare triple {15946#(and (= (+ main_~c~0 (- 7)) 3) (= main_~y~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15676#true} is VALID [2022-04-27 14:37:13,684 INFO L290 TraceCheckUtils]: 89: Hoare triple {15676#true} ~cond := #in~cond; {15676#true} is VALID [2022-04-27 14:37:13,684 INFO L290 TraceCheckUtils]: 90: Hoare triple {15676#true} assume !(0 == ~cond); {15676#true} is VALID [2022-04-27 14:37:13,684 INFO L290 TraceCheckUtils]: 91: Hoare triple {15676#true} assume true; {15676#true} is VALID [2022-04-27 14:37:13,684 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {15676#true} {15946#(and (= (+ main_~c~0 (- 7)) 3) (= main_~y~0 10))} #51#return; {15946#(and (= (+ main_~c~0 (- 7)) 3) (= main_~y~0 10))} is VALID [2022-04-27 14:37:13,684 INFO L290 TraceCheckUtils]: 93: Hoare triple {15946#(and (= (+ main_~c~0 (- 7)) 3) (= main_~y~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15971#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:37:13,685 INFO L290 TraceCheckUtils]: 94: Hoare triple {15971#(and (= main_~c~0 11) (= main_~y~0 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15971#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:37:13,685 INFO L290 TraceCheckUtils]: 95: Hoare triple {15971#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(#t~post5 < 20);havoc #t~post5; {15971#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:37:13,685 INFO L272 TraceCheckUtils]: 96: Hoare triple {15971#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15676#true} is VALID [2022-04-27 14:37:13,685 INFO L290 TraceCheckUtils]: 97: Hoare triple {15676#true} ~cond := #in~cond; {15676#true} is VALID [2022-04-27 14:37:13,685 INFO L290 TraceCheckUtils]: 98: Hoare triple {15676#true} assume !(0 == ~cond); {15676#true} is VALID [2022-04-27 14:37:13,685 INFO L290 TraceCheckUtils]: 99: Hoare triple {15676#true} assume true; {15676#true} is VALID [2022-04-27 14:37:13,685 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {15676#true} {15971#(and (= main_~c~0 11) (= main_~y~0 11))} #51#return; {15971#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:37:13,686 INFO L290 TraceCheckUtils]: 101: Hoare triple {15971#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15996#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:37:13,686 INFO L290 TraceCheckUtils]: 102: Hoare triple {15996#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15996#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:37:13,686 INFO L290 TraceCheckUtils]: 103: Hoare triple {15996#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !!(#t~post5 < 20);havoc #t~post5; {15996#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:37:13,687 INFO L272 TraceCheckUtils]: 104: Hoare triple {15996#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15676#true} is VALID [2022-04-27 14:37:13,687 INFO L290 TraceCheckUtils]: 105: Hoare triple {15676#true} ~cond := #in~cond; {15676#true} is VALID [2022-04-27 14:37:13,687 INFO L290 TraceCheckUtils]: 106: Hoare triple {15676#true} assume !(0 == ~cond); {15676#true} is VALID [2022-04-27 14:37:13,687 INFO L290 TraceCheckUtils]: 107: Hoare triple {15676#true} assume true; {15676#true} is VALID [2022-04-27 14:37:13,687 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {15676#true} {15996#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} #51#return; {15996#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:37:13,687 INFO L290 TraceCheckUtils]: 109: Hoare triple {15996#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16021#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-27 14:37:13,688 INFO L290 TraceCheckUtils]: 110: Hoare triple {16021#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16021#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-27 14:37:13,688 INFO L290 TraceCheckUtils]: 111: Hoare triple {16021#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !!(#t~post5 < 20);havoc #t~post5; {16021#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-27 14:37:13,688 INFO L272 TraceCheckUtils]: 112: Hoare triple {16021#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15676#true} is VALID [2022-04-27 14:37:13,688 INFO L290 TraceCheckUtils]: 113: Hoare triple {15676#true} ~cond := #in~cond; {15676#true} is VALID [2022-04-27 14:37:13,688 INFO L290 TraceCheckUtils]: 114: Hoare triple {15676#true} assume !(0 == ~cond); {15676#true} is VALID [2022-04-27 14:37:13,688 INFO L290 TraceCheckUtils]: 115: Hoare triple {15676#true} assume true; {15676#true} is VALID [2022-04-27 14:37:13,689 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {15676#true} {16021#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} #51#return; {16021#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-27 14:37:13,689 INFO L290 TraceCheckUtils]: 117: Hoare triple {16021#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16046#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 14:37:13,689 INFO L290 TraceCheckUtils]: 118: Hoare triple {16046#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16046#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 14:37:13,690 INFO L290 TraceCheckUtils]: 119: Hoare triple {16046#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} assume !!(#t~post5 < 20);havoc #t~post5; {16046#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 14:37:13,690 INFO L272 TraceCheckUtils]: 120: Hoare triple {16046#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15676#true} is VALID [2022-04-27 14:37:13,690 INFO L290 TraceCheckUtils]: 121: Hoare triple {15676#true} ~cond := #in~cond; {15676#true} is VALID [2022-04-27 14:37:13,690 INFO L290 TraceCheckUtils]: 122: Hoare triple {15676#true} assume !(0 == ~cond); {15676#true} is VALID [2022-04-27 14:37:13,690 INFO L290 TraceCheckUtils]: 123: Hoare triple {15676#true} assume true; {15676#true} is VALID [2022-04-27 14:37:13,690 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {15676#true} {16046#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} #51#return; {16046#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 14:37:13,691 INFO L290 TraceCheckUtils]: 125: Hoare triple {16046#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16071#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-27 14:37:13,691 INFO L290 TraceCheckUtils]: 126: Hoare triple {16071#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16071#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-27 14:37:13,691 INFO L290 TraceCheckUtils]: 127: Hoare triple {16071#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} assume !!(#t~post5 < 20);havoc #t~post5; {16071#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-27 14:37:13,691 INFO L272 TraceCheckUtils]: 128: Hoare triple {16071#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15676#true} is VALID [2022-04-27 14:37:13,691 INFO L290 TraceCheckUtils]: 129: Hoare triple {15676#true} ~cond := #in~cond; {15676#true} is VALID [2022-04-27 14:37:13,691 INFO L290 TraceCheckUtils]: 130: Hoare triple {15676#true} assume !(0 == ~cond); {15676#true} is VALID [2022-04-27 14:37:13,691 INFO L290 TraceCheckUtils]: 131: Hoare triple {15676#true} assume true; {15676#true} is VALID [2022-04-27 14:37:13,692 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {15676#true} {16071#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} #51#return; {16071#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-27 14:37:13,693 INFO L290 TraceCheckUtils]: 133: Hoare triple {16071#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} assume !(~c~0 < ~k~0); {16096#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-27 14:37:13,693 INFO L272 TraceCheckUtils]: 134: Hoare triple {16096#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~k~0 15))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16100#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:37:13,693 INFO L290 TraceCheckUtils]: 135: Hoare triple {16100#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16104#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:37:13,694 INFO L290 TraceCheckUtils]: 136: Hoare triple {16104#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15677#false} is VALID [2022-04-27 14:37:13,694 INFO L290 TraceCheckUtils]: 137: Hoare triple {15677#false} assume !false; {15677#false} is VALID [2022-04-27 14:37:13,694 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 32 proven. 480 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-27 14:37:13,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:14,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:14,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868717679] [2022-04-27 14:37:14,010 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:14,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439385683] [2022-04-27 14:37:14,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439385683] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:14,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:14,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-27 14:37:14,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449246725] [2022-04-27 14:37:14,011 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:14,011 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Word has length 138 [2022-04-27 14:37:14,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:14,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:37:14,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:14,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 14:37:14,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:14,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 14:37:14,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-04-27 14:37:14,086 INFO L87 Difference]: Start difference. First operand 173 states and 178 transitions. Second operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:37:16,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:16,447 INFO L93 Difference]: Finished difference Result 178 states and 182 transitions. [2022-04-27 14:37:16,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 14:37:16,447 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Word has length 138 [2022-04-27 14:37:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:16,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:37:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 104 transitions. [2022-04-27 14:37:16,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:37:16,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 104 transitions. [2022-04-27 14:37:16,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 104 transitions. [2022-04-27 14:37:16,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:16,568 INFO L225 Difference]: With dead ends: 178 [2022-04-27 14:37:16,568 INFO L226 Difference]: Without dead ends: 173 [2022-04-27 14:37:16,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2022-04-27 14:37:16,568 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 2 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:16,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 912 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 14:37:16,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-27 14:37:16,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-04-27 14:37:16,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:16,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0390625) internal successors, (133), 128 states have internal predecessors, (133), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:37:16,661 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0390625) internal successors, (133), 128 states have internal predecessors, (133), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:37:16,662 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0390625) internal successors, (133), 128 states have internal predecessors, (133), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:37:16,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:16,664 INFO L93 Difference]: Finished difference Result 173 states and 177 transitions. [2022-04-27 14:37:16,664 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 177 transitions. [2022-04-27 14:37:16,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:16,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:16,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 128 states have (on average 1.0390625) internal successors, (133), 128 states have internal predecessors, (133), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-27 14:37:16,665 INFO L87 Difference]: Start difference. First operand has 173 states, 128 states have (on average 1.0390625) internal successors, (133), 128 states have internal predecessors, (133), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-27 14:37:16,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:16,667 INFO L93 Difference]: Finished difference Result 173 states and 177 transitions. [2022-04-27 14:37:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 177 transitions. [2022-04-27 14:37:16,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:16,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:16,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:16,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:16,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.0390625) internal successors, (133), 128 states have internal predecessors, (133), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:37:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 177 transitions. [2022-04-27 14:37:16,671 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 177 transitions. Word has length 138 [2022-04-27 14:37:16,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:16,671 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 177 transitions. [2022-04-27 14:37:16,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:37:16,671 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 177 transitions. [2022-04-27 14:37:16,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-27 14:37:16,672 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:16,672 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:37:16,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-27 14:37:16,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-27 14:37:16,878 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:16,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:16,878 INFO L85 PathProgramCache]: Analyzing trace with hash 831286743, now seen corresponding path program 16 times [2022-04-27 14:37:16,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:16,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969738842] [2022-04-27 14:37:16,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:16,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:16,892 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:16,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1607942483] [2022-04-27 14:37:16,893 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:37:16,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:16,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:16,894 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:37:16,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-27 14:37:17,797 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:37:17,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:17,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-27 14:37:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:17,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:18,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {16992#true} call ULTIMATE.init(); {16992#true} is VALID [2022-04-27 14:37:18,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {16992#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16992#true} is VALID [2022-04-27 14:37:18,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {16992#true} assume true; {16992#true} is VALID [2022-04-27 14:37:18,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16992#true} {16992#true} #57#return; {16992#true} is VALID [2022-04-27 14:37:18,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {16992#true} call #t~ret6 := main(); {16992#true} is VALID [2022-04-27 14:37:18,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {16992#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {17012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:18,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {17012#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:18,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {17012#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {17012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:18,548 INFO L272 TraceCheckUtils]: 8: Hoare triple {17012#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16992#true} is VALID [2022-04-27 14:37:18,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {16992#true} ~cond := #in~cond; {16992#true} is VALID [2022-04-27 14:37:18,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {16992#true} assume !(0 == ~cond); {16992#true} is VALID [2022-04-27 14:37:18,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {16992#true} assume true; {16992#true} is VALID [2022-04-27 14:37:18,548 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16992#true} {17012#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {17012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:18,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {17012#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17037#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:37:18,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {17037#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17037#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:37:18,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {17037#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {17037#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:37:18,549 INFO L272 TraceCheckUtils]: 16: Hoare triple {17037#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16992#true} is VALID [2022-04-27 14:37:18,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {16992#true} ~cond := #in~cond; {16992#true} is VALID [2022-04-27 14:37:18,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {16992#true} assume !(0 == ~cond); {16992#true} is VALID [2022-04-27 14:37:18,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {16992#true} assume true; {16992#true} is VALID [2022-04-27 14:37:18,550 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16992#true} {17037#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #51#return; {17037#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:37:18,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {17037#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:37:18,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {17062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:37:18,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {17062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {17062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:37:18,551 INFO L272 TraceCheckUtils]: 24: Hoare triple {17062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16992#true} is VALID [2022-04-27 14:37:18,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {16992#true} ~cond := #in~cond; {16992#true} is VALID [2022-04-27 14:37:18,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {16992#true} assume !(0 == ~cond); {16992#true} is VALID [2022-04-27 14:37:18,551 INFO L290 TraceCheckUtils]: 27: Hoare triple {16992#true} assume true; {16992#true} is VALID [2022-04-27 14:37:18,551 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16992#true} {17062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #51#return; {17062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:37:18,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {17062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17087#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:37:18,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {17087#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17087#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:37:18,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {17087#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {17087#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:37:18,552 INFO L272 TraceCheckUtils]: 32: Hoare triple {17087#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16992#true} is VALID [2022-04-27 14:37:18,552 INFO L290 TraceCheckUtils]: 33: Hoare triple {16992#true} ~cond := #in~cond; {16992#true} is VALID [2022-04-27 14:37:18,552 INFO L290 TraceCheckUtils]: 34: Hoare triple {16992#true} assume !(0 == ~cond); {16992#true} is VALID [2022-04-27 14:37:18,552 INFO L290 TraceCheckUtils]: 35: Hoare triple {16992#true} assume true; {16992#true} is VALID [2022-04-27 14:37:18,553 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16992#true} {17087#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} #51#return; {17087#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:37:18,553 INFO L290 TraceCheckUtils]: 37: Hoare triple {17087#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17112#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:37:18,553 INFO L290 TraceCheckUtils]: 38: Hoare triple {17112#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17112#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:37:18,554 INFO L290 TraceCheckUtils]: 39: Hoare triple {17112#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {17112#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:37:18,554 INFO L272 TraceCheckUtils]: 40: Hoare triple {17112#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16992#true} is VALID [2022-04-27 14:37:18,554 INFO L290 TraceCheckUtils]: 41: Hoare triple {16992#true} ~cond := #in~cond; {16992#true} is VALID [2022-04-27 14:37:18,554 INFO L290 TraceCheckUtils]: 42: Hoare triple {16992#true} assume !(0 == ~cond); {16992#true} is VALID [2022-04-27 14:37:18,554 INFO L290 TraceCheckUtils]: 43: Hoare triple {16992#true} assume true; {16992#true} is VALID [2022-04-27 14:37:18,554 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16992#true} {17112#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #51#return; {17112#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:37:18,555 INFO L290 TraceCheckUtils]: 45: Hoare triple {17112#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:37:18,555 INFO L290 TraceCheckUtils]: 46: Hoare triple {17137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:37:18,555 INFO L290 TraceCheckUtils]: 47: Hoare triple {17137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {17137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:37:18,555 INFO L272 TraceCheckUtils]: 48: Hoare triple {17137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16992#true} is VALID [2022-04-27 14:37:18,555 INFO L290 TraceCheckUtils]: 49: Hoare triple {16992#true} ~cond := #in~cond; {16992#true} is VALID [2022-04-27 14:37:18,555 INFO L290 TraceCheckUtils]: 50: Hoare triple {16992#true} assume !(0 == ~cond); {16992#true} is VALID [2022-04-27 14:37:18,555 INFO L290 TraceCheckUtils]: 51: Hoare triple {16992#true} assume true; {16992#true} is VALID [2022-04-27 14:37:18,556 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16992#true} {17137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #51#return; {17137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:37:18,556 INFO L290 TraceCheckUtils]: 53: Hoare triple {17137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17162#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:37:18,556 INFO L290 TraceCheckUtils]: 54: Hoare triple {17162#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17162#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:37:18,557 INFO L290 TraceCheckUtils]: 55: Hoare triple {17162#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {17162#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:37:18,557 INFO L272 TraceCheckUtils]: 56: Hoare triple {17162#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16992#true} is VALID [2022-04-27 14:37:18,557 INFO L290 TraceCheckUtils]: 57: Hoare triple {16992#true} ~cond := #in~cond; {16992#true} is VALID [2022-04-27 14:37:18,557 INFO L290 TraceCheckUtils]: 58: Hoare triple {16992#true} assume !(0 == ~cond); {16992#true} is VALID [2022-04-27 14:37:18,557 INFO L290 TraceCheckUtils]: 59: Hoare triple {16992#true} assume true; {16992#true} is VALID [2022-04-27 14:37:18,557 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16992#true} {17162#(and (= main_~y~0 6) (= main_~c~0 6))} #51#return; {17162#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:37:18,557 INFO L290 TraceCheckUtils]: 61: Hoare triple {17162#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17187#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:37:18,558 INFO L290 TraceCheckUtils]: 62: Hoare triple {17187#(and (= 7 main_~y~0) (= 7 main_~c~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17187#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:37:18,558 INFO L290 TraceCheckUtils]: 63: Hoare triple {17187#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(#t~post5 < 20);havoc #t~post5; {17187#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:37:18,558 INFO L272 TraceCheckUtils]: 64: Hoare triple {17187#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16992#true} is VALID [2022-04-27 14:37:18,558 INFO L290 TraceCheckUtils]: 65: Hoare triple {16992#true} ~cond := #in~cond; {16992#true} is VALID [2022-04-27 14:37:18,558 INFO L290 TraceCheckUtils]: 66: Hoare triple {16992#true} assume !(0 == ~cond); {16992#true} is VALID [2022-04-27 14:37:18,558 INFO L290 TraceCheckUtils]: 67: Hoare triple {16992#true} assume true; {16992#true} is VALID [2022-04-27 14:37:18,559 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {16992#true} {17187#(and (= 7 main_~y~0) (= 7 main_~c~0))} #51#return; {17187#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:37:18,559 INFO L290 TraceCheckUtils]: 69: Hoare triple {17187#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17212#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:37:18,559 INFO L290 TraceCheckUtils]: 70: Hoare triple {17212#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17212#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:37:18,560 INFO L290 TraceCheckUtils]: 71: Hoare triple {17212#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {17212#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:37:18,560 INFO L272 TraceCheckUtils]: 72: Hoare triple {17212#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16992#true} is VALID [2022-04-27 14:37:18,560 INFO L290 TraceCheckUtils]: 73: Hoare triple {16992#true} ~cond := #in~cond; {16992#true} is VALID [2022-04-27 14:37:18,560 INFO L290 TraceCheckUtils]: 74: Hoare triple {16992#true} assume !(0 == ~cond); {16992#true} is VALID [2022-04-27 14:37:18,560 INFO L290 TraceCheckUtils]: 75: Hoare triple {16992#true} assume true; {16992#true} is VALID [2022-04-27 14:37:18,560 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16992#true} {17212#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #51#return; {17212#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:37:18,561 INFO L290 TraceCheckUtils]: 77: Hoare triple {17212#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17237#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:37:18,561 INFO L290 TraceCheckUtils]: 78: Hoare triple {17237#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17237#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:37:18,561 INFO L290 TraceCheckUtils]: 79: Hoare triple {17237#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {17237#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:37:18,561 INFO L272 TraceCheckUtils]: 80: Hoare triple {17237#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16992#true} is VALID [2022-04-27 14:37:18,562 INFO L290 TraceCheckUtils]: 81: Hoare triple {16992#true} ~cond := #in~cond; {16992#true} is VALID [2022-04-27 14:37:18,562 INFO L290 TraceCheckUtils]: 82: Hoare triple {16992#true} assume !(0 == ~cond); {16992#true} is VALID [2022-04-27 14:37:18,562 INFO L290 TraceCheckUtils]: 83: Hoare triple {16992#true} assume true; {16992#true} is VALID [2022-04-27 14:37:18,562 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {16992#true} {17237#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #51#return; {17237#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:37:18,562 INFO L290 TraceCheckUtils]: 85: Hoare triple {17237#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17262#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-27 14:37:18,563 INFO L290 TraceCheckUtils]: 86: Hoare triple {17262#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17262#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-27 14:37:18,563 INFO L290 TraceCheckUtils]: 87: Hoare triple {17262#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} assume !!(#t~post5 < 20);havoc #t~post5; {17262#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-27 14:37:18,563 INFO L272 TraceCheckUtils]: 88: Hoare triple {17262#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16992#true} is VALID [2022-04-27 14:37:18,563 INFO L290 TraceCheckUtils]: 89: Hoare triple {16992#true} ~cond := #in~cond; {16992#true} is VALID [2022-04-27 14:37:18,563 INFO L290 TraceCheckUtils]: 90: Hoare triple {16992#true} assume !(0 == ~cond); {16992#true} is VALID [2022-04-27 14:37:18,563 INFO L290 TraceCheckUtils]: 91: Hoare triple {16992#true} assume true; {16992#true} is VALID [2022-04-27 14:37:18,564 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {16992#true} {17262#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} #51#return; {17262#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-27 14:37:18,564 INFO L290 TraceCheckUtils]: 93: Hoare triple {17262#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17287#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:37:18,564 INFO L290 TraceCheckUtils]: 94: Hoare triple {17287#(and (= main_~c~0 11) (= main_~y~0 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17287#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:37:18,564 INFO L290 TraceCheckUtils]: 95: Hoare triple {17287#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(#t~post5 < 20);havoc #t~post5; {17287#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:37:18,565 INFO L272 TraceCheckUtils]: 96: Hoare triple {17287#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16992#true} is VALID [2022-04-27 14:37:18,565 INFO L290 TraceCheckUtils]: 97: Hoare triple {16992#true} ~cond := #in~cond; {16992#true} is VALID [2022-04-27 14:37:18,565 INFO L290 TraceCheckUtils]: 98: Hoare triple {16992#true} assume !(0 == ~cond); {16992#true} is VALID [2022-04-27 14:37:18,565 INFO L290 TraceCheckUtils]: 99: Hoare triple {16992#true} assume true; {16992#true} is VALID [2022-04-27 14:37:18,565 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {16992#true} {17287#(and (= main_~c~0 11) (= main_~y~0 11))} #51#return; {17287#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:37:18,565 INFO L290 TraceCheckUtils]: 101: Hoare triple {17287#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17312#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:37:18,566 INFO L290 TraceCheckUtils]: 102: Hoare triple {17312#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17312#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:37:18,566 INFO L290 TraceCheckUtils]: 103: Hoare triple {17312#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !!(#t~post5 < 20);havoc #t~post5; {17312#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:37:18,566 INFO L272 TraceCheckUtils]: 104: Hoare triple {17312#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16992#true} is VALID [2022-04-27 14:37:18,566 INFO L290 TraceCheckUtils]: 105: Hoare triple {16992#true} ~cond := #in~cond; {16992#true} is VALID [2022-04-27 14:37:18,566 INFO L290 TraceCheckUtils]: 106: Hoare triple {16992#true} assume !(0 == ~cond); {16992#true} is VALID [2022-04-27 14:37:18,566 INFO L290 TraceCheckUtils]: 107: Hoare triple {16992#true} assume true; {16992#true} is VALID [2022-04-27 14:37:18,567 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {16992#true} {17312#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #51#return; {17312#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:37:18,567 INFO L290 TraceCheckUtils]: 109: Hoare triple {17312#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17337#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 14:37:18,567 INFO L290 TraceCheckUtils]: 110: Hoare triple {17337#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17337#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 14:37:18,568 INFO L290 TraceCheckUtils]: 111: Hoare triple {17337#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} assume !!(#t~post5 < 20);havoc #t~post5; {17337#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 14:37:18,568 INFO L272 TraceCheckUtils]: 112: Hoare triple {17337#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16992#true} is VALID [2022-04-27 14:37:18,568 INFO L290 TraceCheckUtils]: 113: Hoare triple {16992#true} ~cond := #in~cond; {16992#true} is VALID [2022-04-27 14:37:18,568 INFO L290 TraceCheckUtils]: 114: Hoare triple {16992#true} assume !(0 == ~cond); {16992#true} is VALID [2022-04-27 14:37:18,568 INFO L290 TraceCheckUtils]: 115: Hoare triple {16992#true} assume true; {16992#true} is VALID [2022-04-27 14:37:18,573 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {16992#true} {17337#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} #51#return; {17337#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 14:37:18,574 INFO L290 TraceCheckUtils]: 117: Hoare triple {17337#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17362#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11))} is VALID [2022-04-27 14:37:18,574 INFO L290 TraceCheckUtils]: 118: Hoare triple {17362#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17362#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11))} is VALID [2022-04-27 14:37:18,574 INFO L290 TraceCheckUtils]: 119: Hoare triple {17362#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11))} assume !!(#t~post5 < 20);havoc #t~post5; {17362#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11))} is VALID [2022-04-27 14:37:18,574 INFO L272 TraceCheckUtils]: 120: Hoare triple {17362#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16992#true} is VALID [2022-04-27 14:37:18,574 INFO L290 TraceCheckUtils]: 121: Hoare triple {16992#true} ~cond := #in~cond; {16992#true} is VALID [2022-04-27 14:37:18,574 INFO L290 TraceCheckUtils]: 122: Hoare triple {16992#true} assume !(0 == ~cond); {16992#true} is VALID [2022-04-27 14:37:18,574 INFO L290 TraceCheckUtils]: 123: Hoare triple {16992#true} assume true; {16992#true} is VALID [2022-04-27 14:37:18,575 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {16992#true} {17362#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11))} #51#return; {17362#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11))} is VALID [2022-04-27 14:37:18,575 INFO L290 TraceCheckUtils]: 125: Hoare triple {17362#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17387#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:37:18,576 INFO L290 TraceCheckUtils]: 126: Hoare triple {17387#(and (= main_~c~0 15) (= main_~y~0 15))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17387#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:37:18,576 INFO L290 TraceCheckUtils]: 127: Hoare triple {17387#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(#t~post5 < 20);havoc #t~post5; {17387#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:37:18,576 INFO L272 TraceCheckUtils]: 128: Hoare triple {17387#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16992#true} is VALID [2022-04-27 14:37:18,576 INFO L290 TraceCheckUtils]: 129: Hoare triple {16992#true} ~cond := #in~cond; {16992#true} is VALID [2022-04-27 14:37:18,576 INFO L290 TraceCheckUtils]: 130: Hoare triple {16992#true} assume !(0 == ~cond); {16992#true} is VALID [2022-04-27 14:37:18,576 INFO L290 TraceCheckUtils]: 131: Hoare triple {16992#true} assume true; {16992#true} is VALID [2022-04-27 14:37:18,576 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {16992#true} {17387#(and (= main_~c~0 15) (= main_~y~0 15))} #51#return; {17387#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:37:18,577 INFO L290 TraceCheckUtils]: 133: Hoare triple {17387#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17412#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 14:37:18,577 INFO L290 TraceCheckUtils]: 134: Hoare triple {17412#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17412#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 14:37:18,577 INFO L290 TraceCheckUtils]: 135: Hoare triple {17412#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !!(#t~post5 < 20);havoc #t~post5; {17412#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 14:37:18,577 INFO L272 TraceCheckUtils]: 136: Hoare triple {17412#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16992#true} is VALID [2022-04-27 14:37:18,578 INFO L290 TraceCheckUtils]: 137: Hoare triple {16992#true} ~cond := #in~cond; {16992#true} is VALID [2022-04-27 14:37:18,578 INFO L290 TraceCheckUtils]: 138: Hoare triple {16992#true} assume !(0 == ~cond); {16992#true} is VALID [2022-04-27 14:37:18,578 INFO L290 TraceCheckUtils]: 139: Hoare triple {16992#true} assume true; {16992#true} is VALID [2022-04-27 14:37:18,578 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {16992#true} {17412#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} #51#return; {17412#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 14:37:18,579 INFO L290 TraceCheckUtils]: 141: Hoare triple {17412#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !(~c~0 < ~k~0); {17437#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} is VALID [2022-04-27 14:37:18,580 INFO L272 TraceCheckUtils]: 142: Hoare triple {17437#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17441#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:37:18,580 INFO L290 TraceCheckUtils]: 143: Hoare triple {17441#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17445#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:37:18,580 INFO L290 TraceCheckUtils]: 144: Hoare triple {17445#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16993#false} is VALID [2022-04-27 14:37:18,580 INFO L290 TraceCheckUtils]: 145: Hoare triple {16993#false} assume !false; {16993#false} is VALID [2022-04-27 14:37:18,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 34 proven. 544 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-27 14:37:18,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:18,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:18,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969738842] [2022-04-27 14:37:18,883 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:18,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607942483] [2022-04-27 14:37:18,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607942483] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:18,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:18,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-04-27 14:37:18,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525329618] [2022-04-27 14:37:18,883 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:18,883 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 146 [2022-04-27 14:37:18,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:18,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:37:18,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:18,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 14:37:18,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:18,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 14:37:18,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-04-27 14:37:18,962 INFO L87 Difference]: Start difference. First operand 173 states and 177 transitions. Second operand has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:37:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:21,498 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2022-04-27 14:37:21,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 14:37:21,498 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 146 [2022-04-27 14:37:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:21,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:37:21,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 109 transitions. [2022-04-27 14:37:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:37:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 109 transitions. [2022-04-27 14:37:21,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 109 transitions. [2022-04-27 14:37:21,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:21,614 INFO L225 Difference]: With dead ends: 178 [2022-04-27 14:37:21,614 INFO L226 Difference]: Without dead ends: 173 [2022-04-27 14:37:21,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2022-04-27 14:37:21,615 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:21,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1000 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-27 14:37:21,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-27 14:37:21,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-04-27 14:37:21,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:21,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:37:21,752 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:37:21,752 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:37:21,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:21,754 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2022-04-27 14:37:21,754 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 176 transitions. [2022-04-27 14:37:21,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:21,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:21,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-27 14:37:21,755 INFO L87 Difference]: Start difference. First operand has 173 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-27 14:37:21,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:21,756 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2022-04-27 14:37:21,756 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 176 transitions. [2022-04-27 14:37:21,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:21,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:21,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:21,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:21,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:37:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 176 transitions. [2022-04-27 14:37:21,759 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 176 transitions. Word has length 146 [2022-04-27 14:37:21,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:21,759 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 176 transitions. [2022-04-27 14:37:21,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:37:21,759 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 176 transitions. [2022-04-27 14:37:21,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-27 14:37:21,760 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:21,760 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:37:21,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-27 14:37:21,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:21,966 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:21,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:21,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1988619814, now seen corresponding path program 17 times [2022-04-27 14:37:21,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:21,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900666262] [2022-04-27 14:37:21,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:21,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:21,984 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:21,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1502682866] [2022-04-27 14:37:21,984 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:37:21,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:21,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:21,985 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:37:21,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process