/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/ps6-ll_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:54:14,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:54:14,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:54:14,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:54:14,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:54:14,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:54:14,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:54:14,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:54:14,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:54:14,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:54:14,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:54:14,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:54:14,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:54:14,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:54:14,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:54:14,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:54:14,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:54:14,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:54:14,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:54:14,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:54:14,504 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:54:14,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:54:14,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:54:14,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:54:14,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:54:14,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:54:14,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:54:14,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:54:14,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:54:14,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:54:14,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:54:14,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:54:14,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:54:14,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:54:14,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:54:14,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:54:14,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:54:14,516 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:54:14,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:54:14,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:54:14,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:54:14,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:54:14,524 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:54:14,538 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:54:14,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:54:14,538 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:54:14,538 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:54:14,539 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:54:14,542 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:54:14,543 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:54:14,543 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:54:14,543 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:54:14,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:54:14,544 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:54:14,544 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:54:14,544 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:54:14,544 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:54:14,544 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:54:14,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:54:14,544 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:54:14,544 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:54:14,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:54:14,545 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:54:14,545 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:54:14,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:54:14,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:54:14,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:54:14,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:54:14,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:54:14,545 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:54:14,545 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:54:14,546 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:54:14,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:54:14,546 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:54:14,546 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:54:14,546 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:54:14,546 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:54:14,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:54:14,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:54:14,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:54:14,746 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:54:14,746 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:54:14,747 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound50.c [2022-04-27 14:54:14,797 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df6c447d6/56deb35c3d0643bba6d169edcf4eaf69/FLAGfcd13d139 [2022-04-27 14:54:15,124 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:54:15,125 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound50.c [2022-04-27 14:54:15,130 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df6c447d6/56deb35c3d0643bba6d169edcf4eaf69/FLAGfcd13d139 [2022-04-27 14:54:15,142 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df6c447d6/56deb35c3d0643bba6d169edcf4eaf69 [2022-04-27 14:54:15,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:54:15,146 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:54:15,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:54:15,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:54:15,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:54:15,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:54:15" (1/1) ... [2022-04-27 14:54:15,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2997102a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:15, skipping insertion in model container [2022-04-27 14:54:15,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:54:15" (1/1) ... [2022-04-27 14:54:15,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:54:15,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:54:15,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound50.c[458,471] [2022-04-27 14:54:15,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:54:15,370 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:54:15,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound50.c[458,471] [2022-04-27 14:54:15,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:54:15,407 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:54:15,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:15 WrapperNode [2022-04-27 14:54:15,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:54:15,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:54:15,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:54:15,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:54:15,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:15" (1/1) ... [2022-04-27 14:54:15,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:15" (1/1) ... [2022-04-27 14:54:15,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:15" (1/1) ... [2022-04-27 14:54:15,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:15" (1/1) ... [2022-04-27 14:54:15,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:15" (1/1) ... [2022-04-27 14:54:15,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:15" (1/1) ... [2022-04-27 14:54:15,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:15" (1/1) ... [2022-04-27 14:54:15,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:54:15,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:54:15,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:54:15,440 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:54:15,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:15" (1/1) ... [2022-04-27 14:54:15,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:54:15,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:15,460 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:54:15,475 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:54:15,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:54:15,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:54:15,488 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:54:15,488 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:54:15,490 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:54:15,490 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:54:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:54:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:54:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:54:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:54:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:54:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:54:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:54:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:54:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:54:15,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:54:15,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:54:15,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:54:15,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:54:15,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:54:15,536 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:54:15,537 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:54:15,646 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:54:15,650 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:54:15,651 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:54:15,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:54:15 BoogieIcfgContainer [2022-04-27 14:54:15,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:54:15,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:54:15,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:54:15,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:54:15,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:54:15" (1/3) ... [2022-04-27 14:54:15,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440aefea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:54:15, skipping insertion in model container [2022-04-27 14:54:15,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:15" (2/3) ... [2022-04-27 14:54:15,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440aefea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:54:15, skipping insertion in model container [2022-04-27 14:54:15,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:54:15" (3/3) ... [2022-04-27 14:54:15,671 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound50.c [2022-04-27 14:54:15,694 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:54:15,694 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:54:15,722 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:54:15,727 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@60d857d9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@585db8e2 [2022-04-27 14:54:15,727 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:54:15,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:54:15,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:54:15,737 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:15,737 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:15,738 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:15,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:15,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-27 14:54:15,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:15,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888459551] [2022-04-27 14:54:15,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:15,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:15,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:54:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:15,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-27 14:54:15,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:54:15,934 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-27 14:54:15,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:54:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:15,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:54:15,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:54:15,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:54:15,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:54:15,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 14:54:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:15,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:54:15,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:54:15,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:54:15,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-27 14:54:15,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:54:15,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-27 14:54:15,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:54:15,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-27 14:54:15,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-27 14:54:15,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-27 14:54:15,972 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {32#true} is VALID [2022-04-27 14:54:15,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:54:15,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:54:15,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:54:15,973 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:54:15,973 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-27 14:54:15,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:54:15,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:54:15,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:54:15,974 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-27 14:54:15,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-27 14:54:15,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-27 14:54:15,975 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {33#false} is VALID [2022-04-27 14:54:15,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-27 14:54:15,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-27 14:54:15,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-27 14:54:15,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:54:15,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:15,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888459551] [2022-04-27 14:54:15,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888459551] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:54:15,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:54:15,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:54:15,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979109721] [2022-04-27 14:54:15,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:54:15,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:54:15,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:15,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:54:16,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:16,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:54:16,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:16,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:54:16,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:54:16,035 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:54:16,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:16,290 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 14:54:16,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:54:16,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:54:16,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:16,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:54:16,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-27 14:54:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:54:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-27 14:54:16,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-27 14:54:16,375 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:54:16,381 INFO L225 Difference]: With dead ends: 51 [2022-04-27 14:54:16,381 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 14:54:16,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:54:16,386 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:16,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:54:16,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 14:54:16,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-27 14:54:16,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:16,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:54:16,427 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:54:16,430 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:54:16,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:16,438 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 14:54:16,439 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:54:16,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:16,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:16,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-27 14:54:16,440 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-27 14:54:16,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:16,443 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 14:54:16,443 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:54:16,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:16,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:16,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:16,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:16,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:54:16,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-27 14:54:16,447 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-27 14:54:16,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:16,447 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-27 14:54:16,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:54:16,447 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:54:16,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:54:16,448 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:16,448 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:16,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:54:16,448 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:16,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:16,449 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-27 14:54:16,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:16,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301667865] [2022-04-27 14:54:16,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:16,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:16,479 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:16,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [118175171] [2022-04-27 14:54:16,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:16,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:16,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:16,487 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:54:16,488 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:54:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:16,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:54:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:16,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:16,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {202#true} call ULTIMATE.init(); {202#true} is VALID [2022-04-27 14:54:16,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#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); {202#true} is VALID [2022-04-27 14:54:16,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-27 14:54:16,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} #63#return; {202#true} is VALID [2022-04-27 14:54:16,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {202#true} call #t~ret5 := main(); {202#true} is VALID [2022-04-27 14:54:16,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {202#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; {202#true} is VALID [2022-04-27 14:54:16,684 INFO L272 TraceCheckUtils]: 6: Hoare triple {202#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {202#true} is VALID [2022-04-27 14:54:16,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#true} ~cond := #in~cond; {202#true} is VALID [2022-04-27 14:54:16,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#true} assume !(0 == ~cond); {202#true} is VALID [2022-04-27 14:54:16,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-27 14:54:16,685 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {202#true} {202#true} #53#return; {202#true} is VALID [2022-04-27 14:54:16,685 INFO L272 TraceCheckUtils]: 11: Hoare triple {202#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {202#true} is VALID [2022-04-27 14:54:16,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {202#true} ~cond := #in~cond; {202#true} is VALID [2022-04-27 14:54:16,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {202#true} assume !(0 == ~cond); {202#true} is VALID [2022-04-27 14:54:16,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-27 14:54:16,688 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {202#true} {202#true} #55#return; {202#true} is VALID [2022-04-27 14:54:16,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {202#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:16,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {255#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:16,690 INFO L272 TraceCheckUtils]: 18: Hoare triple {255#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {262#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:16,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {262#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {266#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:16,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {266#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {203#false} is VALID [2022-04-27 14:54:16,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {203#false} assume !false; {203#false} is VALID [2022-04-27 14:54:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:54:16,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:54:16,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:16,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301667865] [2022-04-27 14:54:16,694 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:16,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118175171] [2022-04-27 14:54:16,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118175171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:54:16,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:54:16,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:54:16,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685380932] [2022-04-27 14:54:16,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:54:16,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 14:54:16,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:16,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:54:16,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:16,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:54:16,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:16,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:54:16,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:54:16,716 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:54:39,892 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 23.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:54:39,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:39,976 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-27 14:54:39,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:54:39,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 14:54:39,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:39,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:54:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 14:54:39,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:54:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 14:54:39,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-27 14:54:40,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:40,042 INFO L225 Difference]: With dead ends: 35 [2022-04-27 14:54:40,042 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 14:54:40,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:54:40,044 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:40,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 1 Unknown, 0 Unchecked, 23.1s Time] [2022-04-27 14:54:40,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 14:54:40,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 14:54:40,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:40,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:54:40,049 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:54:40,050 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:54:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:40,052 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-27 14:54:40,052 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 14:54:40,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:40,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:40,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-27 14:54:40,053 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-27 14:54:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:40,055 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-27 14:54:40,055 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 14:54:40,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:40,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:40,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:40,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:54:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-27 14:54:40,058 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-27 14:54:40,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:40,058 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-27 14:54:40,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:54:40,059 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 14:54:40,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 14:54:40,059 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:40,059 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:40,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 14:54:40,271 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:54:40,271 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:40,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:40,272 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-27 14:54:40,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:40,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115015195] [2022-04-27 14:54:40,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:40,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:40,286 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:40,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2000389702] [2022-04-27 14:54:40,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:40,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:40,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:40,288 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:54:40,289 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:54:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:40,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:54:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:40,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:40,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2022-04-27 14:54:40,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#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); {434#true} is VALID [2022-04-27 14:54:40,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:54:40,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #63#return; {434#true} is VALID [2022-04-27 14:54:40,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret5 := main(); {434#true} is VALID [2022-04-27 14:54:40,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#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; {434#true} is VALID [2022-04-27 14:54:40,538 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {434#true} is VALID [2022-04-27 14:54:40,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:54:40,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:54:40,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:54:40,538 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} #53#return; {434#true} is VALID [2022-04-27 14:54:40,539 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {434#true} is VALID [2022-04-27 14:54:40,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:54:40,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:54:40,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:54:40,540 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} #55#return; {434#true} is VALID [2022-04-27 14:54:40,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:40,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:40,541 INFO L272 TraceCheckUtils]: 18: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {434#true} is VALID [2022-04-27 14:54:40,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:54:40,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:54:40,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:54:40,542 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {487#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:40,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-27 14:54:40,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} assume !false; {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-27 14:54:40,544 INFO L272 TraceCheckUtils]: 25: Hoare triple {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:40,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:40,545 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {435#false} is VALID [2022-04-27 14:54:40,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-27 14:54:40,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:54:40,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:40,728 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-27 14:54:40,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {435#false} is VALID [2022-04-27 14:54:40,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:40,730 INFO L272 TraceCheckUtils]: 25: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:40,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:54:40,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:54:40,776 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #57#return; {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:54:40,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:54:40,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:54:40,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:54:40,777 INFO L272 TraceCheckUtils]: 18: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {434#true} is VALID [2022-04-27 14:54:40,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:54:40,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:54:40,779 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} #55#return; {434#true} is VALID [2022-04-27 14:54:40,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:54:40,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:54:40,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:54:40,779 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {434#true} is VALID [2022-04-27 14:54:40,779 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} #53#return; {434#true} is VALID [2022-04-27 14:54:40,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:54:40,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:54:40,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:54:40,780 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {434#true} is VALID [2022-04-27 14:54:40,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#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; {434#true} is VALID [2022-04-27 14:54:40,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret5 := main(); {434#true} is VALID [2022-04-27 14:54:40,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #63#return; {434#true} is VALID [2022-04-27 14:54:40,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:54:40,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#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); {434#true} is VALID [2022-04-27 14:54:40,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2022-04-27 14:54:40,781 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:54:40,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:40,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115015195] [2022-04-27 14:54:40,782 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:40,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000389702] [2022-04-27 14:54:40,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000389702] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:40,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:40,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:54:40,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277028816] [2022-04-27 14:54:40,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:54:40,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 14:54:40,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:40,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:54:40,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:40,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:54:40,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:40,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:54:40,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:54:40,849 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:54:40,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:40,963 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-27 14:54:40,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:54:40,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 14:54:40,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:40,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:54:40,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:54:40,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:54:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:54:40,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-27 14:54:41,042 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:54:41,043 INFO L225 Difference]: With dead ends: 37 [2022-04-27 14:54:41,043 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 14:54:41,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:54:41,044 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:41,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:54:41,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 14:54:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 14:54:41,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:41,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:54:41,051 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:54:41,051 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:54:41,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:41,053 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-27 14:54:41,053 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 14:54:41,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:41,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:41,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-27 14:54:41,054 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-27 14:54:41,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:41,058 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-27 14:54:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 14:54:41,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:41,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:41,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:41,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:41,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:54:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-27 14:54:41,060 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-27 14:54:41,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:41,061 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-27 14:54:41,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:54:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 14:54:41,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 14:54:41,062 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:41,062 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:41,069 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:54:41,266 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:54:41,266 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:41,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:41,267 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-27 14:54:41,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:41,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082174985] [2022-04-27 14:54:41,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:41,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:41,279 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:41,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1200954523] [2022-04-27 14:54:41,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:41,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:41,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:41,280 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:54:41,301 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:54:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:41,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 14:54:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:41,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:41,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {784#true} is VALID [2022-04-27 14:54:41,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#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); {784#true} is VALID [2022-04-27 14:54:41,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:54:41,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} #63#return; {784#true} is VALID [2022-04-27 14:54:41,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {784#true} call #t~ret5 := main(); {784#true} is VALID [2022-04-27 14:54:41,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {784#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; {784#true} is VALID [2022-04-27 14:54:41,618 INFO L272 TraceCheckUtils]: 6: Hoare triple {784#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {784#true} is VALID [2022-04-27 14:54:41,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:54:41,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:54:41,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:54:41,619 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {784#true} {784#true} #53#return; {784#true} is VALID [2022-04-27 14:54:41,619 INFO L272 TraceCheckUtils]: 11: Hoare triple {784#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {784#true} is VALID [2022-04-27 14:54:41,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:54:41,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:54:41,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:54:41,619 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {784#true} {784#true} #55#return; {784#true} is VALID [2022-04-27 14:54:41,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {784#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:41,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:41,636 INFO L272 TraceCheckUtils]: 18: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {784#true} is VALID [2022-04-27 14:54:41,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:54:41,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:54:41,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:54:41,637 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {784#true} {837#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:41,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:54:41,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:54:41,638 INFO L272 TraceCheckUtils]: 25: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {784#true} is VALID [2022-04-27 14:54:41,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:54:41,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:54:41,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:54:41,640 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {784#true} {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #57#return; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:54:41,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:41,641 INFO L272 TraceCheckUtils]: 31: Hoare triple {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {784#true} is VALID [2022-04-27 14:54:41,641 INFO L290 TraceCheckUtils]: 32: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:54:41,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:54:41,641 INFO L290 TraceCheckUtils]: 34: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:54:41,641 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {784#true} {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #59#return; {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:41,642 INFO L272 TraceCheckUtils]: 36: Hoare triple {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {900#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:41,642 INFO L290 TraceCheckUtils]: 37: Hoare triple {900#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:41,643 INFO L290 TraceCheckUtils]: 38: Hoare triple {904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {785#false} is VALID [2022-04-27 14:54:41,643 INFO L290 TraceCheckUtils]: 39: Hoare triple {785#false} assume !false; {785#false} is VALID [2022-04-27 14:54:41,644 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 14:54:41,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:41,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:41,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082174985] [2022-04-27 14:54:41,914 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:41,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200954523] [2022-04-27 14:54:41,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200954523] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:41,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:41,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 14:54:41,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35004644] [2022-04-27 14:54:41,915 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:54:41,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-27 14:54:41,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:41,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:54:41,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:41,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 14:54:41,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:41,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 14:54:41,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:54:41,937 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:54:42,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:42,122 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-27 14:54:42,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:54:42,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-27 14:54:42,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:54:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-27 14:54:42,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:54:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-27 14:54:42,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-27 14:54:42,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:42,158 INFO L225 Difference]: With dead ends: 42 [2022-04-27 14:54:42,158 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 14:54:42,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:54:42,161 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:42,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:54:42,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 14:54:42,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 14:54:42,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:42,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:54:42,174 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:54:42,175 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:54:42,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:42,179 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-27 14:54:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 14:54:42,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:42,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:42,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 14:54:42,181 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 14:54:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:42,182 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-27 14:54:42,182 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 14:54:42,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:42,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:42,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:42,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:42,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:54:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-27 14:54:42,184 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-27 14:54:42,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:42,185 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-27 14:54:42,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:54:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 14:54:42,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 14:54:42,186 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:42,186 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:42,206 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:54:42,399 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:54:42,402 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:42,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:42,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 2 times [2022-04-27 14:54:42,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:42,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087235172] [2022-04-27 14:54:42,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:42,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:42,432 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:42,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1187846438] [2022-04-27 14:54:42,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:54:42,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:42,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:42,438 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:54:42,440 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:54:42,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:54:42,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:54:42,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 14:54:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:42,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:42,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {1160#true} call ULTIMATE.init(); {1160#true} is VALID [2022-04-27 14:54:42,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {1160#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); {1160#true} is VALID [2022-04-27 14:54:42,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:54:42,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1160#true} {1160#true} #63#return; {1160#true} is VALID [2022-04-27 14:54:42,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {1160#true} call #t~ret5 := main(); {1160#true} is VALID [2022-04-27 14:54:42,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {1160#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; {1160#true} is VALID [2022-04-27 14:54:42,767 INFO L272 TraceCheckUtils]: 6: Hoare triple {1160#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:54:42,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:54:42,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:54:42,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:54:42,767 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1160#true} {1160#true} #53#return; {1160#true} is VALID [2022-04-27 14:54:42,767 INFO L272 TraceCheckUtils]: 11: Hoare triple {1160#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:54:42,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:54:42,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:54:42,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:54:42,768 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1160#true} {1160#true} #55#return; {1160#true} is VALID [2022-04-27 14:54:42,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {1160#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:42,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:42,769 INFO L272 TraceCheckUtils]: 18: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:54:42,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:54:42,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:54:42,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:54:42,770 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1160#true} {1213#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:42,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:54:42,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:54:42,773 INFO L272 TraceCheckUtils]: 25: Hoare triple {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:54:42,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:54:42,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:54:42,773 INFO L290 TraceCheckUtils]: 28: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:54:42,774 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1160#true} {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #57#return; {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:54:42,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {1235#(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 * ~y~0 * ~y~0 + ~x~0; {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-27 14:54:42,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !false; {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-27 14:54:42,775 INFO L272 TraceCheckUtils]: 32: Hoare triple {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:54:42,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:54:42,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:54:42,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:54:42,776 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1160#true} {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #57#return; {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-27 14:54:42,776 INFO L290 TraceCheckUtils]: 37: Hoare triple {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-27 14:54:42,776 INFO L272 TraceCheckUtils]: 38: Hoare triple {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:54:42,776 INFO L290 TraceCheckUtils]: 39: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:54:42,776 INFO L290 TraceCheckUtils]: 40: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:54:42,776 INFO L290 TraceCheckUtils]: 41: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:54:42,777 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1160#true} {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} #59#return; {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-27 14:54:42,777 INFO L272 TraceCheckUtils]: 43: Hoare triple {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1298#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:42,778 INFO L290 TraceCheckUtils]: 44: Hoare triple {1298#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:42,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {1302#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1161#false} is VALID [2022-04-27 14:54:42,781 INFO L290 TraceCheckUtils]: 46: Hoare triple {1161#false} assume !false; {1161#false} is VALID [2022-04-27 14:54:42,781 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 14:54:42,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:43,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:43,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087235172] [2022-04-27 14:54:43,170 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:43,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187846438] [2022-04-27 14:54:43,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187846438] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:43,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:43,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 14:54:43,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654432649] [2022-04-27 14:54:43,171 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:54:43,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-27 14:54:43,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:43,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:54:43,208 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:54:43,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:54:43,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:43,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:54:43,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:54:43,209 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:54:43,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:43,452 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-27 14:54:43,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:54:43,452 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-27 14:54:43,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:54:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-27 14:54:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:54:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-27 14:54:43,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-27 14:54:43,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:43,491 INFO L225 Difference]: With dead ends: 45 [2022-04-27 14:54:43,491 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 14:54:43,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:54:43,492 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:43,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 164 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:54:43,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 14:54:43,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-27 14:54:43,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:43,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:54:43,503 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:54:43,503 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:54:43,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:43,505 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-27 14:54:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 14:54:43,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:43,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:43,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-27 14:54:43,506 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-27 14:54:43,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:43,507 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-27 14:54:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 14:54:43,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:43,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:43,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:43,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:43,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:54:43,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-27 14:54:43,509 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-27 14:54:43,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:43,509 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-27 14:54:43,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:54:43,510 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 14:54:43,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-27 14:54:43,510 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:43,510 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:43,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 14:54:43,730 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:54:43,731 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:43,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:43,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 3 times [2022-04-27 14:54:43,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:43,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792521495] [2022-04-27 14:54:43,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:43,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:43,757 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:43,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [75631236] [2022-04-27 14:54:43,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:54:43,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:43,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:43,759 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:54:43,760 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:54:43,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:54:43,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:54:43,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 14:54:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:43,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:44,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {1596#true} call ULTIMATE.init(); {1596#true} is VALID [2022-04-27 14:54:44,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {1596#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); {1596#true} is VALID [2022-04-27 14:54:44,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:54:44,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1596#true} {1596#true} #63#return; {1596#true} is VALID [2022-04-27 14:54:44,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {1596#true} call #t~ret5 := main(); {1596#true} is VALID [2022-04-27 14:54:44,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {1596#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; {1596#true} is VALID [2022-04-27 14:54:44,158 INFO L272 TraceCheckUtils]: 6: Hoare triple {1596#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {1596#true} is VALID [2022-04-27 14:54:44,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-27 14:54:44,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-27 14:54:44,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:54:44,159 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1596#true} {1596#true} #53#return; {1596#true} is VALID [2022-04-27 14:54:44,159 INFO L272 TraceCheckUtils]: 11: Hoare triple {1596#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1596#true} is VALID [2022-04-27 14:54:44,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-27 14:54:44,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-27 14:54:44,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:54:44,159 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1596#true} {1596#true} #55#return; {1596#true} is VALID [2022-04-27 14:54:44,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {1596#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1649#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:44,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {1649#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1649#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:44,160 INFO L272 TraceCheckUtils]: 18: Hoare triple {1649#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1596#true} is VALID [2022-04-27 14:54:44,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-27 14:54:44,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-27 14:54:44,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:54:44,161 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1596#true} {1649#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1649#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:44,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {1649#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:54:44,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:54:44,162 INFO L272 TraceCheckUtils]: 25: Hoare triple {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1596#true} is VALID [2022-04-27 14:54:44,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-27 14:54:44,162 INFO L290 TraceCheckUtils]: 27: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-27 14:54:44,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:54:44,163 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1596#true} {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:54:44,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:54:44,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:54:44,164 INFO L272 TraceCheckUtils]: 32: Hoare triple {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1596#true} is VALID [2022-04-27 14:54:44,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-27 14:54:44,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-27 14:54:44,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:54:44,165 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1596#true} {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:54:44,165 INFO L290 TraceCheckUtils]: 37: Hoare triple {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:54:44,165 INFO L290 TraceCheckUtils]: 38: Hoare triple {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:54:44,166 INFO L272 TraceCheckUtils]: 39: Hoare triple {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1596#true} is VALID [2022-04-27 14:54:44,166 INFO L290 TraceCheckUtils]: 40: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-27 14:54:44,166 INFO L290 TraceCheckUtils]: 41: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-27 14:54:44,166 INFO L290 TraceCheckUtils]: 42: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:54:44,170 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1596#true} {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #57#return; {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:54:44,171 INFO L290 TraceCheckUtils]: 44: Hoare triple {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1737#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:54:44,171 INFO L272 TraceCheckUtils]: 45: Hoare triple {1737#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1596#true} is VALID [2022-04-27 14:54:44,171 INFO L290 TraceCheckUtils]: 46: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-27 14:54:44,171 INFO L290 TraceCheckUtils]: 47: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-27 14:54:44,171 INFO L290 TraceCheckUtils]: 48: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:54:44,172 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1596#true} {1737#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} #59#return; {1737#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:54:44,172 INFO L272 TraceCheckUtils]: 50: Hoare triple {1737#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1756#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:44,173 INFO L290 TraceCheckUtils]: 51: Hoare triple {1756#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1760#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:44,173 INFO L290 TraceCheckUtils]: 52: Hoare triple {1760#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1597#false} is VALID [2022-04-27 14:54:44,173 INFO L290 TraceCheckUtils]: 53: Hoare triple {1597#false} assume !false; {1597#false} is VALID [2022-04-27 14:54:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-27 14:54:44,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:44,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:44,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792521495] [2022-04-27 14:54:44,426 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:44,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75631236] [2022-04-27 14:54:44,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75631236] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:44,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:44,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 14:54:44,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680062037] [2022-04-27 14:54:44,427 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:54:44,427 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-27 14:54:44,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:44,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:54:44,458 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:54:44,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 14:54:44,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:44,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 14:54:44,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:54:44,460 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:54:44,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:44,774 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-27 14:54:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:54:44,774 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-27 14:54:44,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:44,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:54:44,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-27 14:54:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:54:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-27 14:54:44,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-27 14:54:44,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:44,837 INFO L225 Difference]: With dead ends: 48 [2022-04-27 14:54:44,837 INFO L226 Difference]: Without dead ends: 42 [2022-04-27 14:54:44,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:54:44,837 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:44,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:54:44,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-27 14:54:44,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-27 14:54:44,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:44,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:54:44,848 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:54:44,848 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:54:44,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:44,849 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-27 14:54:44,849 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 14:54:44,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:44,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:44,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-27 14:54:44,850 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-27 14:54:44,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:44,851 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-27 14:54:44,851 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 14:54:44,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:44,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:44,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:44,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:44,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:54:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-27 14:54:44,856 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-27 14:54:44,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:44,857 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-27 14:54:44,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:54:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 14:54:44,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 14:54:44,859 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:44,859 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:44,865 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:54:45,063 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:54:45,063 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:45,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:45,064 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 4 times [2022-04-27 14:54:45,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:45,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587574865] [2022-04-27 14:54:45,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:45,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:45,083 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:45,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1023191744] [2022-04-27 14:54:45,083 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:54:45,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:45,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:45,086 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:54:45,086 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:54:45,118 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:54:45,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:54:45,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 14:54:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:45,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:45,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {2048#true} call ULTIMATE.init(); {2048#true} is VALID [2022-04-27 14:54:45,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {2048#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); {2048#true} is VALID [2022-04-27 14:54:45,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:54:45,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2048#true} {2048#true} #63#return; {2048#true} is VALID [2022-04-27 14:54:45,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {2048#true} call #t~ret5 := main(); {2048#true} is VALID [2022-04-27 14:54:45,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {2048#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; {2048#true} is VALID [2022-04-27 14:54:45,434 INFO L272 TraceCheckUtils]: 6: Hoare triple {2048#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:54:45,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:54:45,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:54:45,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:54:45,435 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2048#true} {2048#true} #53#return; {2048#true} is VALID [2022-04-27 14:54:45,435 INFO L272 TraceCheckUtils]: 11: Hoare triple {2048#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:54:45,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:54:45,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:54:45,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:54:45,435 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2048#true} {2048#true} #55#return; {2048#true} is VALID [2022-04-27 14:54:45,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {2048#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:45,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {2101#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:45,439 INFO L272 TraceCheckUtils]: 18: Hoare triple {2101#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:54:45,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:54:45,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:54:45,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:54:45,439 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2048#true} {2101#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:45,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {2101#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:54:45,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:54:45,440 INFO L272 TraceCheckUtils]: 25: Hoare triple {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:54:45,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:54:45,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:54:45,441 INFO L290 TraceCheckUtils]: 28: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:54:45,441 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2048#true} {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:54:45,442 INFO L290 TraceCheckUtils]: 30: Hoare triple {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:54:45,442 INFO L290 TraceCheckUtils]: 31: Hoare triple {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:54:45,442 INFO L272 TraceCheckUtils]: 32: Hoare triple {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:54:45,442 INFO L290 TraceCheckUtils]: 33: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:54:45,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:54:45,443 INFO L290 TraceCheckUtils]: 35: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:54:45,443 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2048#true} {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #57#return; {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:54:45,443 INFO L290 TraceCheckUtils]: 37: Hoare triple {2145#(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 * ~y~0 * ~y~0 + ~x~0; {2167#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:54:45,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {2167#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {2167#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:54:45,444 INFO L272 TraceCheckUtils]: 39: Hoare triple {2167#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:54:45,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:54:45,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:54:45,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:54:45,445 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2048#true} {2167#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {2167#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:54:45,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {2167#(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 * ~y~0 * ~y~0 + ~x~0; {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:54:45,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:54:45,446 INFO L272 TraceCheckUtils]: 46: Hoare triple {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:54:45,446 INFO L290 TraceCheckUtils]: 47: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:54:45,446 INFO L290 TraceCheckUtils]: 48: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:54:45,446 INFO L290 TraceCheckUtils]: 49: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:54:45,447 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2048#true} {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #57#return; {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:54:45,448 INFO L290 TraceCheckUtils]: 51: Hoare triple {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2211#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:54:45,448 INFO L272 TraceCheckUtils]: 52: Hoare triple {2211#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:54:45,448 INFO L290 TraceCheckUtils]: 53: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:54:45,448 INFO L290 TraceCheckUtils]: 54: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:54:45,448 INFO L290 TraceCheckUtils]: 55: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:54:45,448 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2048#true} {2211#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} #59#return; {2211#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:54:45,449 INFO L272 TraceCheckUtils]: 57: Hoare triple {2211#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2230#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:45,449 INFO L290 TraceCheckUtils]: 58: Hoare triple {2230#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2234#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:45,450 INFO L290 TraceCheckUtils]: 59: Hoare triple {2234#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2049#false} is VALID [2022-04-27 14:54:45,450 INFO L290 TraceCheckUtils]: 60: Hoare triple {2049#false} assume !false; {2049#false} is VALID [2022-04-27 14:54:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-27 14:54:45,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:45,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:45,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587574865] [2022-04-27 14:54:45,684 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:45,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023191744] [2022-04-27 14:54:45,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023191744] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:45,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:45,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:54:45,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989633153] [2022-04-27 14:54:45,684 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:54:45,685 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-27 14:54:45,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:45,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:54:45,718 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:54:45,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:54:45,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:45,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:54:45,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:54:45,719 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:54:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:46,103 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-27 14:54:46,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:54:46,104 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-27 14:54:46,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:46,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:54:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-27 14:54:46,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:54:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-27 14:54:46,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-27 14:54:46,153 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:54:46,155 INFO L225 Difference]: With dead ends: 51 [2022-04-27 14:54:46,155 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 14:54:46,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:54:46,157 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:46,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:54:46,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 14:54:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 14:54:46,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:46,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:54:46,175 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:54:46,175 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:54:46,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:46,177 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 14:54:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 14:54:46,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:46,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:46,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-27 14:54:46,178 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-27 14:54:46,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:46,181 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 14:54:46,181 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 14:54:46,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:46,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:46,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:46,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:46,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:54:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-27 14:54:46,183 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-27 14:54:46,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:46,183 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-27 14:54:46,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:54:46,183 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 14:54:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-27 14:54:46,184 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:46,184 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:46,207 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:54:46,407 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:54:46,408 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:46,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:46,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 5 times [2022-04-27 14:54:46,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:46,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870283253] [2022-04-27 14:54:46,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:46,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:46,422 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:46,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1270546913] [2022-04-27 14:54:46,422 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:54:46,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:46,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:46,424 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:54:46,424 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:54:46,908 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 14:54:46,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:54:46,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:54:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:46,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:47,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {2538#true} call ULTIMATE.init(); {2538#true} is VALID [2022-04-27 14:54:47,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {2538#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); {2538#true} is VALID [2022-04-27 14:54:47,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:54:47,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2538#true} {2538#true} #63#return; {2538#true} is VALID [2022-04-27 14:54:47,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {2538#true} call #t~ret5 := main(); {2538#true} is VALID [2022-04-27 14:54:47,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {2538#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; {2538#true} is VALID [2022-04-27 14:54:47,265 INFO L272 TraceCheckUtils]: 6: Hoare triple {2538#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:54:47,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:54:47,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:54:47,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:54:47,266 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2538#true} {2538#true} #53#return; {2538#true} is VALID [2022-04-27 14:54:47,266 INFO L272 TraceCheckUtils]: 11: Hoare triple {2538#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:54:47,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:54:47,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:54:47,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:54:47,266 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2538#true} {2538#true} #55#return; {2538#true} is VALID [2022-04-27 14:54:47,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {2538#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2591#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:47,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {2591#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2591#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:47,272 INFO L272 TraceCheckUtils]: 18: Hoare triple {2591#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:54:47,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:54:47,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:54:47,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:54:47,276 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2538#true} {2591#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2591#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:47,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {2591#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:54:47,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:54:47,277 INFO L272 TraceCheckUtils]: 25: Hoare triple {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:54:47,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:54:47,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:54:47,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:54:47,278 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2538#true} {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:54:47,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:54:47,279 INFO L290 TraceCheckUtils]: 31: Hoare triple {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:54:47,279 INFO L272 TraceCheckUtils]: 32: Hoare triple {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:54:47,279 INFO L290 TraceCheckUtils]: 33: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:54:47,279 INFO L290 TraceCheckUtils]: 34: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:54:47,279 INFO L290 TraceCheckUtils]: 35: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:54:47,280 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2538#true} {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #57#return; {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:54:47,280 INFO L290 TraceCheckUtils]: 37: Hoare triple {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:54:47,281 INFO L290 TraceCheckUtils]: 38: Hoare triple {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:54:47,281 INFO L272 TraceCheckUtils]: 39: Hoare triple {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:54:47,281 INFO L290 TraceCheckUtils]: 40: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:54:47,281 INFO L290 TraceCheckUtils]: 41: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:54:47,281 INFO L290 TraceCheckUtils]: 42: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:54:47,282 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2538#true} {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #57#return; {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:54:47,282 INFO L290 TraceCheckUtils]: 44: Hoare triple {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:54:47,283 INFO L290 TraceCheckUtils]: 45: Hoare triple {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:54:47,283 INFO L272 TraceCheckUtils]: 46: Hoare triple {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:54:47,283 INFO L290 TraceCheckUtils]: 47: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:54:47,283 INFO L290 TraceCheckUtils]: 48: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:54:47,283 INFO L290 TraceCheckUtils]: 49: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:54:47,283 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2538#true} {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #57#return; {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:54:47,284 INFO L290 TraceCheckUtils]: 51: Hoare triple {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:54:47,284 INFO L290 TraceCheckUtils]: 52: Hoare triple {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !false; {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:54:47,284 INFO L272 TraceCheckUtils]: 53: Hoare triple {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:54:47,284 INFO L290 TraceCheckUtils]: 54: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:54:47,285 INFO L290 TraceCheckUtils]: 55: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:54:47,285 INFO L290 TraceCheckUtils]: 56: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:54:47,288 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2538#true} {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #57#return; {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:54:47,288 INFO L290 TraceCheckUtils]: 58: Hoare triple {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2723#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:54:47,288 INFO L272 TraceCheckUtils]: 59: Hoare triple {2723#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:54:47,288 INFO L290 TraceCheckUtils]: 60: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:54:47,289 INFO L290 TraceCheckUtils]: 61: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:54:47,289 INFO L290 TraceCheckUtils]: 62: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:54:47,290 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2538#true} {2723#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #59#return; {2723#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:54:47,293 INFO L272 TraceCheckUtils]: 64: Hoare triple {2723#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2742#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:47,293 INFO L290 TraceCheckUtils]: 65: Hoare triple {2742#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2746#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:47,293 INFO L290 TraceCheckUtils]: 66: Hoare triple {2746#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2539#false} is VALID [2022-04-27 14:54:47,293 INFO L290 TraceCheckUtils]: 67: Hoare triple {2539#false} assume !false; {2539#false} is VALID [2022-04-27 14:54:47,294 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-27 14:54:47,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:47,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:47,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870283253] [2022-04-27 14:54:47,550 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:47,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270546913] [2022-04-27 14:54:47,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270546913] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:47,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:47,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 14:54:47,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484306419] [2022-04-27 14:54:47,551 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:54:47,551 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-27 14:54:47,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:47,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:54:47,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:47,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:54:47,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:47,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:54:47,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:54:47,588 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:54:48,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:48,062 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-27 14:54:48,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 14:54:48,062 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-27 14:54:48,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:48,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:54:48,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-27 14:54:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:54:48,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-27 14:54:48,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-27 14:54:48,104 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:54:48,105 INFO L225 Difference]: With dead ends: 54 [2022-04-27 14:54:48,106 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 14:54:48,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:54:48,106 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:48,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:54:48,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 14:54:48,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-27 14:54:48,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:48,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:54:48,121 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:54:48,121 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:54:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:48,122 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-27 14:54:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 14:54:48,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:48,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:48,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-27 14:54:48,123 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-27 14:54:48,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:48,124 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-27 14:54:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 14:54:48,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:48,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:48,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:48,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:48,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:54:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-27 14:54:48,126 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-27 14:54:48,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:48,126 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-27 14:54:48,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:54:48,127 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 14:54:48,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-27 14:54:48,128 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:48,128 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:48,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-27 14:54:48,332 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:54:48,333 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:48,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:48,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 6 times [2022-04-27 14:54:48,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:48,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640003539] [2022-04-27 14:54:48,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:48,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:48,343 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:48,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1520311242] [2022-04-27 14:54:48,343 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:54:48,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:48,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:48,346 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:54:48,347 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:54:48,658 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 14:54:48,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:54:48,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-27 14:54:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:48,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:49,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {3066#true} call ULTIMATE.init(); {3066#true} is VALID [2022-04-27 14:54:49,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {3066#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); {3066#true} is VALID [2022-04-27 14:54:49,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:54:49,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3066#true} {3066#true} #63#return; {3066#true} is VALID [2022-04-27 14:54:49,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {3066#true} call #t~ret5 := main(); {3066#true} is VALID [2022-04-27 14:54:49,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {3066#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; {3066#true} is VALID [2022-04-27 14:54:49,190 INFO L272 TraceCheckUtils]: 6: Hoare triple {3066#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:54:49,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:54:49,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:54:49,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:54:49,190 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3066#true} {3066#true} #53#return; {3066#true} is VALID [2022-04-27 14:54:49,191 INFO L272 TraceCheckUtils]: 11: Hoare triple {3066#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:54:49,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:54:49,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:54:49,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:54:49,191 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3066#true} {3066#true} #55#return; {3066#true} is VALID [2022-04-27 14:54:49,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {3066#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3119#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:49,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {3119#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3119#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:49,192 INFO L272 TraceCheckUtils]: 18: Hoare triple {3119#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:54:49,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:54:49,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:54:49,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:54:49,192 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3066#true} {3119#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3119#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:49,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {3119#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:54:49,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:54:49,193 INFO L272 TraceCheckUtils]: 25: Hoare triple {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:54:49,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:54:49,194 INFO L290 TraceCheckUtils]: 27: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:54:49,194 INFO L290 TraceCheckUtils]: 28: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:54:49,194 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3066#true} {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:54:49,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:54:49,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:54:49,195 INFO L272 TraceCheckUtils]: 32: Hoare triple {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:54:49,195 INFO L290 TraceCheckUtils]: 33: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:54:49,195 INFO L290 TraceCheckUtils]: 34: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:54:49,195 INFO L290 TraceCheckUtils]: 35: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:54:49,196 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3066#true} {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #57#return; {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:54:49,196 INFO L290 TraceCheckUtils]: 37: Hoare triple {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:54:49,197 INFO L290 TraceCheckUtils]: 38: Hoare triple {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:54:49,197 INFO L272 TraceCheckUtils]: 39: Hoare triple {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:54:49,197 INFO L290 TraceCheckUtils]: 40: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:54:49,197 INFO L290 TraceCheckUtils]: 41: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:54:49,197 INFO L290 TraceCheckUtils]: 42: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:54:49,197 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3066#true} {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #57#return; {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:54:49,198 INFO L290 TraceCheckUtils]: 44: Hoare triple {3185#(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 * ~y~0 * ~y~0 + ~x~0; {3207#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:54:49,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {3207#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} assume !false; {3207#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:54:49,198 INFO L272 TraceCheckUtils]: 46: Hoare triple {3207#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:54:49,198 INFO L290 TraceCheckUtils]: 47: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:54:49,198 INFO L290 TraceCheckUtils]: 48: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:54:49,199 INFO L290 TraceCheckUtils]: 49: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:54:49,199 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3066#true} {3207#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} #57#return; {3207#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:54:49,199 INFO L290 TraceCheckUtils]: 51: Hoare triple {3207#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3229#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:54:49,202 INFO L290 TraceCheckUtils]: 52: Hoare triple {3229#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {3229#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:54:49,203 INFO L272 TraceCheckUtils]: 53: Hoare triple {3229#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:54:49,204 INFO L290 TraceCheckUtils]: 54: Hoare triple {3066#true} ~cond := #in~cond; {3239#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:49,204 INFO L290 TraceCheckUtils]: 55: Hoare triple {3239#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3243#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:54:49,204 INFO L290 TraceCheckUtils]: 56: Hoare triple {3243#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3243#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:54:49,205 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3243#(not (= |__VERIFIER_assert_#in~cond| 0))} {3229#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #57#return; {3250#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))} is VALID [2022-04-27 14:54:49,206 INFO L290 TraceCheckUtils]: 58: Hoare triple {3250#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3254#(and (= main_~y~0 6) (<= (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:54:49,206 INFO L290 TraceCheckUtils]: 59: Hoare triple {3254#(and (= main_~y~0 6) (<= (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {3254#(and (= main_~y~0 6) (<= (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:54:49,206 INFO L272 TraceCheckUtils]: 60: Hoare triple {3254#(and (= main_~y~0 6) (<= (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:54:49,206 INFO L290 TraceCheckUtils]: 61: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:54:49,206 INFO L290 TraceCheckUtils]: 62: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:54:49,206 INFO L290 TraceCheckUtils]: 63: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:54:49,207 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3066#true} {3254#(and (= main_~y~0 6) (<= (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (< 5 main_~k~0) (<= main_~c~0 6))} #57#return; {3254#(and (= main_~y~0 6) (<= (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:54:49,207 INFO L290 TraceCheckUtils]: 65: Hoare triple {3254#(and (= main_~y~0 6) (<= (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {3276#(and (= main_~y~0 6) (<= main_~k~0 6) (<= (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (< 5 main_~k~0))} is VALID [2022-04-27 14:54:49,208 INFO L272 TraceCheckUtils]: 66: Hoare triple {3276#(and (= main_~y~0 6) (<= main_~k~0 6) (<= (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:54:49,208 INFO L290 TraceCheckUtils]: 67: Hoare triple {3066#true} ~cond := #in~cond; {3239#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:49,208 INFO L290 TraceCheckUtils]: 68: Hoare triple {3239#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3243#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:54:49,208 INFO L290 TraceCheckUtils]: 69: Hoare triple {3243#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3243#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:54:49,209 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3243#(not (= |__VERIFIER_assert_#in~cond| 0))} {3276#(and (= main_~y~0 6) (<= main_~k~0 6) (<= (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (< 5 main_~k~0))} #59#return; {3292#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:54:49,210 INFO L272 TraceCheckUtils]: 71: Hoare triple {3292#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3296#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:49,210 INFO L290 TraceCheckUtils]: 72: Hoare triple {3296#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3300#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:49,210 INFO L290 TraceCheckUtils]: 73: Hoare triple {3300#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3067#false} is VALID [2022-04-27 14:54:49,210 INFO L290 TraceCheckUtils]: 74: Hoare triple {3067#false} assume !false; {3067#false} is VALID [2022-04-27 14:54:49,211 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 47 proven. 68 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-04-27 14:54:49,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:55:20,736 WARN L833 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* (- 2) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* (- 5) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* (- 6) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* c_main_~y~0 c_main_~y~0)) 12) 0)) (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0)))))) is different from false [2022-04-27 14:55:20,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:20,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640003539] [2022-04-27 14:55:20,739 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:20,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520311242] [2022-04-27 14:55:20,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520311242] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:55:20,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:55:20,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-27 14:55:20,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744707831] [2022-04-27 14:55:20,740 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:55:20,740 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-27 14:55:20,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:20,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 14:55:20,777 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:55:20,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 14:55:20,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:20,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 14:55:20,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=4, NotChecked=38, Total=462 [2022-04-27 14:55:20,778 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 14:55:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:21,697 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-27 14:55:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 14:55:21,697 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-27 14:55:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 14:55:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-27 14:55:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 14:55:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-27 14:55:21,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 62 transitions. [2022-04-27 14:55:21,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:21,745 INFO L225 Difference]: With dead ends: 57 [2022-04-27 14:55:21,746 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 14:55:21,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=4, NotChecked=44, Total=600 [2022-04-27 14:55:21,746 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:21,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 287 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 14:55:21,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 14:55:21,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-27 14:55:21,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:21,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:55:21,769 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:55:21,769 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:55:21,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:21,771 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-27 14:55:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-27 14:55:21,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:21,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:21,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-27 14:55:21,771 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-27 14:55:21,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:21,773 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-27 14:55:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-27 14:55:21,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:21,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:21,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:21,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:55:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-04-27 14:55:21,775 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 75 [2022-04-27 14:55:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:21,775 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-04-27 14:55:21,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 14:55:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-27 14:55:21,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-27 14:55:21,776 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:21,776 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:21,781 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:55:21,981 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:55:21,981 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:21,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:21,982 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 7 times [2022-04-27 14:55:21,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:21,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610767798] [2022-04-27 14:55:21,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:21,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:21,995 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:21,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1599818746] [2022-04-27 14:55:21,995 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:55:21,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:21,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:21,996 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:55:21,997 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:56:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:26,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 14:56:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:26,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:56:27,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {3641#true} call ULTIMATE.init(); {3641#true} is VALID [2022-04-27 14:56:27,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {3641#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); {3641#true} is VALID [2022-04-27 14:56:27,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {3641#true} assume true; {3641#true} is VALID [2022-04-27 14:56:27,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3641#true} {3641#true} #63#return; {3641#true} is VALID [2022-04-27 14:56:27,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {3641#true} call #t~ret5 := main(); {3641#true} is VALID [2022-04-27 14:56:27,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {3641#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; {3641#true} is VALID [2022-04-27 14:56:27,025 INFO L272 TraceCheckUtils]: 6: Hoare triple {3641#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {3641#true} is VALID [2022-04-27 14:56:27,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {3641#true} ~cond := #in~cond; {3641#true} is VALID [2022-04-27 14:56:27,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {3641#true} assume !(0 == ~cond); {3641#true} is VALID [2022-04-27 14:56:27,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {3641#true} assume true; {3641#true} is VALID [2022-04-27 14:56:27,026 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3641#true} {3641#true} #53#return; {3641#true} is VALID [2022-04-27 14:56:27,026 INFO L272 TraceCheckUtils]: 11: Hoare triple {3641#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3641#true} is VALID [2022-04-27 14:56:27,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {3641#true} ~cond := #in~cond; {3641#true} is VALID [2022-04-27 14:56:27,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {3641#true} assume !(0 == ~cond); {3641#true} is VALID [2022-04-27 14:56:27,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {3641#true} assume true; {3641#true} is VALID [2022-04-27 14:56:27,026 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3641#true} {3641#true} #55#return; {3641#true} is VALID [2022-04-27 14:56:27,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {3641#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3694#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:56:27,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {3694#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3694#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:56:27,027 INFO L272 TraceCheckUtils]: 18: Hoare triple {3694#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3641#true} is VALID [2022-04-27 14:56:27,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {3641#true} ~cond := #in~cond; {3641#true} is VALID [2022-04-27 14:56:27,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {3641#true} assume !(0 == ~cond); {3641#true} is VALID [2022-04-27 14:56:27,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {3641#true} assume true; {3641#true} is VALID [2022-04-27 14:56:27,029 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3641#true} {3694#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3694#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:56:27,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {3694#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3716#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:56:27,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {3716#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {3716#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:56:27,030 INFO L272 TraceCheckUtils]: 25: Hoare triple {3716#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3641#true} is VALID [2022-04-27 14:56:27,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {3641#true} ~cond := #in~cond; {3641#true} is VALID [2022-04-27 14:56:27,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {3641#true} assume !(0 == ~cond); {3641#true} is VALID [2022-04-27 14:56:27,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {3641#true} assume true; {3641#true} is VALID [2022-04-27 14:56:27,031 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3641#true} {3716#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {3716#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:56:27,031 INFO L290 TraceCheckUtils]: 30: Hoare triple {3716#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3738#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:56:27,031 INFO L290 TraceCheckUtils]: 31: Hoare triple {3738#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {3738#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:56:27,032 INFO L272 TraceCheckUtils]: 32: Hoare triple {3738#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3641#true} is VALID [2022-04-27 14:56:27,032 INFO L290 TraceCheckUtils]: 33: Hoare triple {3641#true} ~cond := #in~cond; {3641#true} is VALID [2022-04-27 14:56:27,032 INFO L290 TraceCheckUtils]: 34: Hoare triple {3641#true} assume !(0 == ~cond); {3641#true} is VALID [2022-04-27 14:56:27,032 INFO L290 TraceCheckUtils]: 35: Hoare triple {3641#true} assume true; {3641#true} is VALID [2022-04-27 14:56:27,032 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3641#true} {3738#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #57#return; {3738#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:56:27,033 INFO L290 TraceCheckUtils]: 37: Hoare triple {3738#(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 * ~y~0 * ~y~0 + ~x~0; {3760#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:56:27,033 INFO L290 TraceCheckUtils]: 38: Hoare triple {3760#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {3760#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:56:27,033 INFO L272 TraceCheckUtils]: 39: Hoare triple {3760#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3641#true} is VALID [2022-04-27 14:56:27,033 INFO L290 TraceCheckUtils]: 40: Hoare triple {3641#true} ~cond := #in~cond; {3641#true} is VALID [2022-04-27 14:56:27,033 INFO L290 TraceCheckUtils]: 41: Hoare triple {3641#true} assume !(0 == ~cond); {3641#true} is VALID [2022-04-27 14:56:27,033 INFO L290 TraceCheckUtils]: 42: Hoare triple {3641#true} assume true; {3641#true} is VALID [2022-04-27 14:56:27,035 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3641#true} {3760#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {3760#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:56:27,036 INFO L290 TraceCheckUtils]: 44: Hoare triple {3760#(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 * ~y~0 * ~y~0 + ~x~0; {3782#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:56:27,036 INFO L290 TraceCheckUtils]: 45: Hoare triple {3782#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {3782#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:56:27,036 INFO L272 TraceCheckUtils]: 46: Hoare triple {3782#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3641#true} is VALID [2022-04-27 14:56:27,037 INFO L290 TraceCheckUtils]: 47: Hoare triple {3641#true} ~cond := #in~cond; {3641#true} is VALID [2022-04-27 14:56:27,037 INFO L290 TraceCheckUtils]: 48: Hoare triple {3641#true} assume !(0 == ~cond); {3641#true} is VALID [2022-04-27 14:56:27,037 INFO L290 TraceCheckUtils]: 49: Hoare triple {3641#true} assume true; {3641#true} is VALID [2022-04-27 14:56:27,037 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3641#true} {3782#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #57#return; {3782#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:56:27,038 INFO L290 TraceCheckUtils]: 51: Hoare triple {3782#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3804#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:56:27,038 INFO L290 TraceCheckUtils]: 52: Hoare triple {3804#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3804#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:56:27,038 INFO L272 TraceCheckUtils]: 53: Hoare triple {3804#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3641#true} is VALID [2022-04-27 14:56:27,038 INFO L290 TraceCheckUtils]: 54: Hoare triple {3641#true} ~cond := #in~cond; {3641#true} is VALID [2022-04-27 14:56:27,038 INFO L290 TraceCheckUtils]: 55: Hoare triple {3641#true} assume !(0 == ~cond); {3641#true} is VALID [2022-04-27 14:56:27,038 INFO L290 TraceCheckUtils]: 56: Hoare triple {3641#true} assume true; {3641#true} is VALID [2022-04-27 14:56:27,039 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3641#true} {3804#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {3804#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:56:27,040 INFO L290 TraceCheckUtils]: 58: Hoare triple {3804#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:56:27,040 INFO L290 TraceCheckUtils]: 59: Hoare triple {3826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {3826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:56:27,040 INFO L272 TraceCheckUtils]: 60: Hoare triple {3826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3641#true} is VALID [2022-04-27 14:56:27,040 INFO L290 TraceCheckUtils]: 61: Hoare triple {3641#true} ~cond := #in~cond; {3641#true} is VALID [2022-04-27 14:56:27,040 INFO L290 TraceCheckUtils]: 62: Hoare triple {3641#true} assume !(0 == ~cond); {3641#true} is VALID [2022-04-27 14:56:27,040 INFO L290 TraceCheckUtils]: 63: Hoare triple {3641#true} assume true; {3641#true} is VALID [2022-04-27 14:56:27,041 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3641#true} {3826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #57#return; {3826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:56:27,041 INFO L290 TraceCheckUtils]: 65: Hoare triple {3826#(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 * ~y~0 * ~y~0 + ~x~0; {3848#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:56:27,042 INFO L290 TraceCheckUtils]: 66: Hoare triple {3848#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !false; {3848#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:56:27,042 INFO L272 TraceCheckUtils]: 67: Hoare triple {3848#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3641#true} is VALID [2022-04-27 14:56:27,042 INFO L290 TraceCheckUtils]: 68: Hoare triple {3641#true} ~cond := #in~cond; {3641#true} is VALID [2022-04-27 14:56:27,042 INFO L290 TraceCheckUtils]: 69: Hoare triple {3641#true} assume !(0 == ~cond); {3641#true} is VALID [2022-04-27 14:56:27,042 INFO L290 TraceCheckUtils]: 70: Hoare triple {3641#true} assume true; {3641#true} is VALID [2022-04-27 14:56:27,043 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3641#true} {3848#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #57#return; {3848#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:56:27,043 INFO L290 TraceCheckUtils]: 72: Hoare triple {3848#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3870#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:56:27,043 INFO L272 TraceCheckUtils]: 73: Hoare triple {3870#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3641#true} is VALID [2022-04-27 14:56:27,043 INFO L290 TraceCheckUtils]: 74: Hoare triple {3641#true} ~cond := #in~cond; {3641#true} is VALID [2022-04-27 14:56:27,043 INFO L290 TraceCheckUtils]: 75: Hoare triple {3641#true} assume !(0 == ~cond); {3641#true} is VALID [2022-04-27 14:56:27,044 INFO L290 TraceCheckUtils]: 76: Hoare triple {3641#true} assume true; {3641#true} is VALID [2022-04-27 14:56:27,044 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {3641#true} {3870#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #59#return; {3870#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:56:27,045 INFO L272 TraceCheckUtils]: 78: Hoare triple {3870#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3889#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:27,045 INFO L290 TraceCheckUtils]: 79: Hoare triple {3889#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3893#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:27,045 INFO L290 TraceCheckUtils]: 80: Hoare triple {3893#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3642#false} is VALID [2022-04-27 14:56:27,045 INFO L290 TraceCheckUtils]: 81: Hoare triple {3642#false} assume !false; {3642#false} is VALID [2022-04-27 14:56:27,046 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 84 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-27 14:56:27,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:56:27,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:56:27,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610767798] [2022-04-27 14:56:27,293 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:56:27,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599818746] [2022-04-27 14:56:27,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599818746] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:56:27,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:56:27,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 14:56:27,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332501699] [2022-04-27 14:56:27,293 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:56:27,294 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-27 14:56:27,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:56:27,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 14:56:27,331 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:56:27,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 14:56:27,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:56:27,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 14:56:27,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:56:27,331 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 14:56:28,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:28,098 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-27 14:56:28,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:56:28,098 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-27 14:56:28,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:56:28,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 14:56:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-27 14:56:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 14:56:28,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-27 14:56:28,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-04-27 14:56:28,151 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:56:28,152 INFO L225 Difference]: With dead ends: 60 [2022-04-27 14:56:28,152 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 14:56:28,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:56:28,152 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:56:28,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 351 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:56:28,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 14:56:28,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-27 14:56:28,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:56:28,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:56:28,178 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:56:28,178 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:56:28,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:28,179 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-27 14:56:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 14:56:28,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:28,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:28,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-27 14:56:28,180 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-27 14:56:28,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:28,181 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-27 14:56:28,181 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 14:56:28,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:28,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:28,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:56:28,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:56:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:56:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-27 14:56:28,183 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 82 [2022-04-27 14:56:28,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:56:28,183 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-27 14:56:28,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 14:56:28,183 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 14:56:28,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-27 14:56:28,184 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:56:28,184 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:56:28,229 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:56:28,396 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:56:28,397 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:56:28,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:56:28,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 8 times [2022-04-27 14:56:28,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:56:28,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600653594] [2022-04-27 14:56:28,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:28,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:56:28,407 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:56:28,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1864476664] [2022-04-27 14:56:28,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:56:28,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:28,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:56:28,409 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:56:28,410 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:56:28,931 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:56:28,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:56:28,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-27 14:56:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:28,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:56:29,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {4245#true} call ULTIMATE.init(); {4245#true} is VALID [2022-04-27 14:56:29,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {4245#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); {4245#true} is VALID [2022-04-27 14:56:29,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 14:56:29,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4245#true} {4245#true} #63#return; {4245#true} is VALID [2022-04-27 14:56:29,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {4245#true} call #t~ret5 := main(); {4245#true} is VALID [2022-04-27 14:56:29,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {4245#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; {4245#true} is VALID [2022-04-27 14:56:29,525 INFO L272 TraceCheckUtils]: 6: Hoare triple {4245#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {4245#true} is VALID [2022-04-27 14:56:29,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 14:56:29,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 14:56:29,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 14:56:29,525 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4245#true} {4245#true} #53#return; {4245#true} is VALID [2022-04-27 14:56:29,525 INFO L272 TraceCheckUtils]: 11: Hoare triple {4245#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4245#true} is VALID [2022-04-27 14:56:29,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 14:56:29,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 14:56:29,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 14:56:29,525 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4245#true} {4245#true} #55#return; {4245#true} is VALID [2022-04-27 14:56:29,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {4245#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4298#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:56:29,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {4298#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4298#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:56:29,526 INFO L272 TraceCheckUtils]: 18: Hoare triple {4298#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4245#true} is VALID [2022-04-27 14:56:29,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 14:56:29,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 14:56:29,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 14:56:29,527 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4245#true} {4298#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4298#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:56:29,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {4298#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4320#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:56:29,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {4320#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {4320#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:56:29,528 INFO L272 TraceCheckUtils]: 25: Hoare triple {4320#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4245#true} is VALID [2022-04-27 14:56:29,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 14:56:29,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 14:56:29,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 14:56:29,529 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4245#true} {4320#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #57#return; {4320#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:56:29,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {4320#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4342#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:56:29,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {4342#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !false; {4342#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:56:29,530 INFO L272 TraceCheckUtils]: 32: Hoare triple {4342#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4245#true} is VALID [2022-04-27 14:56:29,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 14:56:29,530 INFO L290 TraceCheckUtils]: 34: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 14:56:29,530 INFO L290 TraceCheckUtils]: 35: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 14:56:29,532 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4245#true} {4342#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #57#return; {4342#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:56:29,532 INFO L290 TraceCheckUtils]: 37: Hoare triple {4342#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4364#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:56:29,533 INFO L290 TraceCheckUtils]: 38: Hoare triple {4364#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {4364#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:56:29,533 INFO L272 TraceCheckUtils]: 39: Hoare triple {4364#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4245#true} is VALID [2022-04-27 14:56:29,533 INFO L290 TraceCheckUtils]: 40: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 14:56:29,533 INFO L290 TraceCheckUtils]: 41: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 14:56:29,533 INFO L290 TraceCheckUtils]: 42: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 14:56:29,534 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4245#true} {4364#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #57#return; {4364#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:56:29,534 INFO L290 TraceCheckUtils]: 44: Hoare triple {4364#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ 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 * ~y~0 * ~y~0 + ~x~0; {4386#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:56:29,535 INFO L290 TraceCheckUtils]: 45: Hoare triple {4386#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} assume !false; {4386#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:56:29,535 INFO L272 TraceCheckUtils]: 46: Hoare triple {4386#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4245#true} is VALID [2022-04-27 14:56:29,535 INFO L290 TraceCheckUtils]: 47: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 14:56:29,535 INFO L290 TraceCheckUtils]: 48: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 14:56:29,535 INFO L290 TraceCheckUtils]: 49: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 14:56:29,536 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4245#true} {4386#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} #57#return; {4386#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:56:29,537 INFO L290 TraceCheckUtils]: 51: Hoare triple {4386#(and (= main_~y~0 4) (= 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 * ~y~0 * ~y~0 + ~x~0; {4408#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:56:29,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {4408#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4) (< 0 main_~k~0))} assume !false; {4408#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:56:29,537 INFO L272 TraceCheckUtils]: 53: Hoare triple {4408#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4245#true} is VALID [2022-04-27 14:56:29,537 INFO L290 TraceCheckUtils]: 54: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 14:56:29,537 INFO L290 TraceCheckUtils]: 55: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 14:56:29,537 INFO L290 TraceCheckUtils]: 56: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 14:56:29,540 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4245#true} {4408#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4) (< 0 main_~k~0))} #57#return; {4408#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:56:29,540 INFO L290 TraceCheckUtils]: 58: Hoare triple {4408#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) 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 * ~y~0 * ~y~0 + ~x~0; {4430#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:56:29,540 INFO L290 TraceCheckUtils]: 59: Hoare triple {4430#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !false; {4430#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:56:29,540 INFO L272 TraceCheckUtils]: 60: Hoare triple {4430#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4245#true} is VALID [2022-04-27 14:56:29,541 INFO L290 TraceCheckUtils]: 61: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 14:56:29,541 INFO L290 TraceCheckUtils]: 62: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 14:56:29,541 INFO L290 TraceCheckUtils]: 63: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 14:56:29,541 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4245#true} {4430#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} #57#return; {4430#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:56:29,542 INFO L290 TraceCheckUtils]: 65: Hoare triple {4430#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4452#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:56:29,542 INFO L290 TraceCheckUtils]: 66: Hoare triple {4452#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} assume !false; {4452#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:56:29,542 INFO L272 TraceCheckUtils]: 67: Hoare triple {4452#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4245#true} is VALID [2022-04-27 14:56:29,542 INFO L290 TraceCheckUtils]: 68: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 14:56:29,542 INFO L290 TraceCheckUtils]: 69: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 14:56:29,542 INFO L290 TraceCheckUtils]: 70: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 14:56:29,543 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4245#true} {4452#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} #57#return; {4452#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:56:29,544 INFO L290 TraceCheckUtils]: 72: Hoare triple {4452#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4474#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:56:29,544 INFO L290 TraceCheckUtils]: 73: Hoare triple {4474#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !false; {4474#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:56:29,544 INFO L272 TraceCheckUtils]: 74: Hoare triple {4474#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4245#true} is VALID [2022-04-27 14:56:29,544 INFO L290 TraceCheckUtils]: 75: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 14:56:29,544 INFO L290 TraceCheckUtils]: 76: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 14:56:29,544 INFO L290 TraceCheckUtils]: 77: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 14:56:29,545 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4245#true} {4474#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #57#return; {4474#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:56:29,545 INFO L290 TraceCheckUtils]: 79: Hoare triple {4474#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {4496#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 14:56:29,545 INFO L272 TraceCheckUtils]: 80: Hoare triple {4496#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4245#true} is VALID [2022-04-27 14:56:29,545 INFO L290 TraceCheckUtils]: 81: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 14:56:29,545 INFO L290 TraceCheckUtils]: 82: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 14:56:29,546 INFO L290 TraceCheckUtils]: 83: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 14:56:29,546 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {4245#true} {4496#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #59#return; {4496#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 14:56:29,547 INFO L272 TraceCheckUtils]: 85: Hoare triple {4496#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4515#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:29,547 INFO L290 TraceCheckUtils]: 86: Hoare triple {4515#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4519#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:29,548 INFO L290 TraceCheckUtils]: 87: Hoare triple {4519#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4246#false} is VALID [2022-04-27 14:56:29,548 INFO L290 TraceCheckUtils]: 88: Hoare triple {4246#false} assume !false; {4246#false} is VALID [2022-04-27 14:56:29,548 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-27 14:56:29,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:56:30,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:56:30,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600653594] [2022-04-27 14:56:30,372 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:56:30,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864476664] [2022-04-27 14:56:30,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864476664] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:56:30,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:56:30,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 14:56:30,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339746658] [2022-04-27 14:56:30,373 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:56:30,373 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-27 14:56:30,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:56:30,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 14:56:30,413 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:56:30,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:56:30,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:56:30,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:56:30,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2022-04-27 14:56:30,414 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 14:56:31,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:31,341 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-27 14:56:31,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 14:56:31,342 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-27 14:56:31,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:56:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 14:56:31,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-27 14:56:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 14:56:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-27 14:56:31,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-27 14:56:31,403 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:56:31,404 INFO L225 Difference]: With dead ends: 63 [2022-04-27 14:56:31,404 INFO L226 Difference]: Without dead ends: 57 [2022-04-27 14:56:31,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2022-04-27 14:56:31,405 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:56:31,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 380 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 14:56:31,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-27 14:56:31,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-27 14:56:31,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:56:31,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:56:31,430 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:56:31,430 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:56:31,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:31,431 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-27 14:56:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-27 14:56:31,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:31,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:31,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-27 14:56:31,432 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-27 14:56:31,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:31,433 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-27 14:56:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-27 14:56:31,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:31,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:31,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:56:31,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:56:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:56:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-04-27 14:56:31,435 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 89 [2022-04-27 14:56:31,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:56:31,435 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-04-27 14:56:31,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 14:56:31,435 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-27 14:56:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-27 14:56:31,436 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:56:31,436 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:56:31,443 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:56:31,643 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:56:31,643 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:56:31,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:56:31,644 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 9 times [2022-04-27 14:56:31,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:56:31,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776386670] [2022-04-27 14:56:31,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:31,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:56:31,656 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:56:31,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2001876533] [2022-04-27 14:56:31,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:56:31,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:31,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:56:31,657 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:56:31,664 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:56:37,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-04-27 14:56:37,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:56:37,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-27 14:56:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:37,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:56:37,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {5041#true} call ULTIMATE.init(); {5041#true} is VALID [2022-04-27 14:56:37,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {5041#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); {5041#true} is VALID [2022-04-27 14:56:37,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {5041#true} assume true; {5041#true} is VALID [2022-04-27 14:56:37,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5041#true} {5041#true} #63#return; {5041#true} is VALID [2022-04-27 14:56:37,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {5041#true} call #t~ret5 := main(); {5041#true} is VALID [2022-04-27 14:56:37,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {5041#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; {5041#true} is VALID [2022-04-27 14:56:37,965 INFO L272 TraceCheckUtils]: 6: Hoare triple {5041#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {5041#true} is VALID [2022-04-27 14:56:37,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {5041#true} ~cond := #in~cond; {5041#true} is VALID [2022-04-27 14:56:37,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {5041#true} assume !(0 == ~cond); {5041#true} is VALID [2022-04-27 14:56:37,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {5041#true} assume true; {5041#true} is VALID [2022-04-27 14:56:37,965 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5041#true} {5041#true} #53#return; {5041#true} is VALID [2022-04-27 14:56:37,966 INFO L272 TraceCheckUtils]: 11: Hoare triple {5041#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5041#true} is VALID [2022-04-27 14:56:37,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {5041#true} ~cond := #in~cond; {5041#true} is VALID [2022-04-27 14:56:37,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {5041#true} assume !(0 == ~cond); {5041#true} is VALID [2022-04-27 14:56:37,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {5041#true} assume true; {5041#true} is VALID [2022-04-27 14:56:37,966 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5041#true} {5041#true} #55#return; {5041#true} is VALID [2022-04-27 14:56:37,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {5041#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5094#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:56:37,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {5094#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5094#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:56:37,967 INFO L272 TraceCheckUtils]: 18: Hoare triple {5094#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5041#true} is VALID [2022-04-27 14:56:37,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {5041#true} ~cond := #in~cond; {5041#true} is VALID [2022-04-27 14:56:37,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {5041#true} assume !(0 == ~cond); {5041#true} is VALID [2022-04-27 14:56:37,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {5041#true} assume true; {5041#true} is VALID [2022-04-27 14:56:37,968 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5041#true} {5094#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {5094#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:56:37,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {5094#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5116#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:56:37,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {5116#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {5116#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:56:37,969 INFO L272 TraceCheckUtils]: 25: Hoare triple {5116#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5041#true} is VALID [2022-04-27 14:56:37,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {5041#true} ~cond := #in~cond; {5041#true} is VALID [2022-04-27 14:56:37,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {5041#true} assume !(0 == ~cond); {5041#true} is VALID [2022-04-27 14:56:37,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {5041#true} assume true; {5041#true} is VALID [2022-04-27 14:56:37,975 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5041#true} {5116#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {5116#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:56:37,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {5116#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5138#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:56:37,977 INFO L290 TraceCheckUtils]: 31: Hoare triple {5138#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {5138#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:56:37,977 INFO L272 TraceCheckUtils]: 32: Hoare triple {5138#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5041#true} is VALID [2022-04-27 14:56:37,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {5041#true} ~cond := #in~cond; {5041#true} is VALID [2022-04-27 14:56:37,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {5041#true} assume !(0 == ~cond); {5041#true} is VALID [2022-04-27 14:56:37,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {5041#true} assume true; {5041#true} is VALID [2022-04-27 14:56:37,977 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5041#true} {5138#(and (= main_~y~0 2) (= main_~c~0 2))} #57#return; {5138#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:56:37,978 INFO L290 TraceCheckUtils]: 37: Hoare triple {5138#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5160#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:56:37,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {5160#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {5160#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:56:37,978 INFO L272 TraceCheckUtils]: 39: Hoare triple {5160#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5041#true} is VALID [2022-04-27 14:56:37,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {5041#true} ~cond := #in~cond; {5041#true} is VALID [2022-04-27 14:56:37,979 INFO L290 TraceCheckUtils]: 41: Hoare triple {5041#true} assume !(0 == ~cond); {5041#true} is VALID [2022-04-27 14:56:37,979 INFO L290 TraceCheckUtils]: 42: Hoare triple {5041#true} assume true; {5041#true} is VALID [2022-04-27 14:56:37,979 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5041#true} {5160#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {5160#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:56:37,980 INFO L290 TraceCheckUtils]: 44: Hoare triple {5160#(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 * ~y~0 * ~y~0 + ~x~0; {5182#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:56:37,980 INFO L290 TraceCheckUtils]: 45: Hoare triple {5182#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {5182#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:56:37,980 INFO L272 TraceCheckUtils]: 46: Hoare triple {5182#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5041#true} is VALID [2022-04-27 14:56:37,980 INFO L290 TraceCheckUtils]: 47: Hoare triple {5041#true} ~cond := #in~cond; {5041#true} is VALID [2022-04-27 14:56:37,981 INFO L290 TraceCheckUtils]: 48: Hoare triple {5041#true} assume !(0 == ~cond); {5041#true} is VALID [2022-04-27 14:56:37,981 INFO L290 TraceCheckUtils]: 49: Hoare triple {5041#true} assume true; {5041#true} is VALID [2022-04-27 14:56:37,981 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5041#true} {5182#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #57#return; {5182#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:56:37,982 INFO L290 TraceCheckUtils]: 51: Hoare triple {5182#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5204#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:56:37,982 INFO L290 TraceCheckUtils]: 52: Hoare triple {5204#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !false; {5204#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:56:37,982 INFO L272 TraceCheckUtils]: 53: Hoare triple {5204#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5041#true} is VALID [2022-04-27 14:56:37,982 INFO L290 TraceCheckUtils]: 54: Hoare triple {5041#true} ~cond := #in~cond; {5041#true} is VALID [2022-04-27 14:56:37,982 INFO L290 TraceCheckUtils]: 55: Hoare triple {5041#true} assume !(0 == ~cond); {5041#true} is VALID [2022-04-27 14:56:37,983 INFO L290 TraceCheckUtils]: 56: Hoare triple {5041#true} assume true; {5041#true} is VALID [2022-04-27 14:56:37,983 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {5041#true} {5204#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #57#return; {5204#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:56:37,984 INFO L290 TraceCheckUtils]: 58: Hoare triple {5204#(and (= 3 (+ (- 2) 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 * ~y~0 * ~y~0 + ~x~0; {5226#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:56:37,984 INFO L290 TraceCheckUtils]: 59: Hoare triple {5226#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !false; {5226#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:56:37,984 INFO L272 TraceCheckUtils]: 60: Hoare triple {5226#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5041#true} is VALID [2022-04-27 14:56:37,984 INFO L290 TraceCheckUtils]: 61: Hoare triple {5041#true} ~cond := #in~cond; {5041#true} is VALID [2022-04-27 14:56:37,984 INFO L290 TraceCheckUtils]: 62: Hoare triple {5041#true} assume !(0 == ~cond); {5041#true} is VALID [2022-04-27 14:56:37,985 INFO L290 TraceCheckUtils]: 63: Hoare triple {5041#true} assume true; {5041#true} is VALID [2022-04-27 14:56:37,985 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5041#true} {5226#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} #57#return; {5226#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:56:37,986 INFO L290 TraceCheckUtils]: 65: Hoare triple {5226#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5248#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-27 14:56:37,986 INFO L290 TraceCheckUtils]: 66: Hoare triple {5248#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} assume !false; {5248#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-27 14:56:37,986 INFO L272 TraceCheckUtils]: 67: Hoare triple {5248#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5041#true} is VALID [2022-04-27 14:56:37,986 INFO L290 TraceCheckUtils]: 68: Hoare triple {5041#true} ~cond := #in~cond; {5041#true} is VALID [2022-04-27 14:56:37,986 INFO L290 TraceCheckUtils]: 69: Hoare triple {5041#true} assume !(0 == ~cond); {5041#true} is VALID [2022-04-27 14:56:37,986 INFO L290 TraceCheckUtils]: 70: Hoare triple {5041#true} assume true; {5041#true} is VALID [2022-04-27 14:56:37,987 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5041#true} {5248#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} #57#return; {5248#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-27 14:56:37,988 INFO L290 TraceCheckUtils]: 72: Hoare triple {5248#(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 * ~y~0 * ~y~0 + ~x~0; {5270#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:56:37,988 INFO L290 TraceCheckUtils]: 73: Hoare triple {5270#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} assume !false; {5270#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:56:37,988 INFO L272 TraceCheckUtils]: 74: Hoare triple {5270#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5041#true} is VALID [2022-04-27 14:56:37,988 INFO L290 TraceCheckUtils]: 75: Hoare triple {5041#true} ~cond := #in~cond; {5041#true} is VALID [2022-04-27 14:56:37,988 INFO L290 TraceCheckUtils]: 76: Hoare triple {5041#true} assume !(0 == ~cond); {5041#true} is VALID [2022-04-27 14:56:37,988 INFO L290 TraceCheckUtils]: 77: Hoare triple {5041#true} assume true; {5041#true} is VALID [2022-04-27 14:56:37,989 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {5041#true} {5270#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} #57#return; {5270#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:56:37,989 INFO L290 TraceCheckUtils]: 79: Hoare triple {5270#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5292#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:56:37,990 INFO L290 TraceCheckUtils]: 80: Hoare triple {5292#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {5292#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:56:38,001 INFO L272 TraceCheckUtils]: 81: Hoare triple {5292#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5041#true} is VALID [2022-04-27 14:56:38,001 INFO L290 TraceCheckUtils]: 82: Hoare triple {5041#true} ~cond := #in~cond; {5041#true} is VALID [2022-04-27 14:56:38,001 INFO L290 TraceCheckUtils]: 83: Hoare triple {5041#true} assume !(0 == ~cond); {5041#true} is VALID [2022-04-27 14:56:38,001 INFO L290 TraceCheckUtils]: 84: Hoare triple {5041#true} assume true; {5041#true} is VALID [2022-04-27 14:56:38,003 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {5041#true} {5292#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #57#return; {5292#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:56:38,004 INFO L290 TraceCheckUtils]: 86: Hoare triple {5292#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {5314#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-27 14:56:38,004 INFO L272 TraceCheckUtils]: 87: Hoare triple {5314#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5041#true} is VALID [2022-04-27 14:56:38,004 INFO L290 TraceCheckUtils]: 88: Hoare triple {5041#true} ~cond := #in~cond; {5041#true} is VALID [2022-04-27 14:56:38,005 INFO L290 TraceCheckUtils]: 89: Hoare triple {5041#true} assume !(0 == ~cond); {5041#true} is VALID [2022-04-27 14:56:38,005 INFO L290 TraceCheckUtils]: 90: Hoare triple {5041#true} assume true; {5041#true} is VALID [2022-04-27 14:56:38,005 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {5041#true} {5314#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} #59#return; {5314#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-27 14:56:38,006 INFO L272 TraceCheckUtils]: 92: Hoare triple {5314#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5333#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:38,006 INFO L290 TraceCheckUtils]: 93: Hoare triple {5333#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5337#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:38,007 INFO L290 TraceCheckUtils]: 94: Hoare triple {5337#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5042#false} is VALID [2022-04-27 14:56:38,007 INFO L290 TraceCheckUtils]: 95: Hoare triple {5042#false} assume !false; {5042#false} is VALID [2022-04-27 14:56:38,007 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 22 proven. 135 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-27 14:56:38,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:56:38,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:56:38,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776386670] [2022-04-27 14:56:38,266 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:56:38,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001876533] [2022-04-27 14:56:38,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001876533] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:56:38,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:56:38,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-27 14:56:38,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981206362] [2022-04-27 14:56:38,266 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:56:38,267 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Word has length 96 [2022-04-27 14:56:38,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:56:38,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:56:38,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:38,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 14:56:38,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:56:38,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 14:56:38,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:56:38,313 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:56:39,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:39,341 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-04-27 14:56:39,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 14:56:39,341 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Word has length 96 [2022-04-27 14:56:39,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:56:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:56:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-27 14:56:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:56:39,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-27 14:56:39,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 74 transitions. [2022-04-27 14:56:39,424 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:56:39,425 INFO L225 Difference]: With dead ends: 66 [2022-04-27 14:56:39,425 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 14:56:39,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-27 14:56:39,425 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:56:39,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 439 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 14:56:39,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 14:56:39,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-27 14:56:39,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:56:39,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:56:39,454 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:56:39,454 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:56:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:39,456 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-27 14:56:39,456 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-27 14:56:39,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:39,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:39,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 60 states. [2022-04-27 14:56:39,456 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 60 states. [2022-04-27 14:56:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:39,458 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-27 14:56:39,458 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-27 14:56:39,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:39,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:39,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:56:39,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:56:39,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:56:39,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2022-04-27 14:56:39,459 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 96 [2022-04-27 14:56:39,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:56:39,460 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2022-04-27 14:56:39,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:56:39,460 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-27 14:56:39,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-27 14:56:39,460 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:56:39,460 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:56:39,470 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:56:39,670 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:56:39,671 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:56:39,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:56:39,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1610181715, now seen corresponding path program 10 times [2022-04-27 14:56:39,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:56:39,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709092922] [2022-04-27 14:56:39,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:39,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:56:39,684 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:56:39,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [178096652] [2022-04-27 14:56:39,684 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:56:39,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:39,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:56:39,685 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:56:39,686 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:56:39,725 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:56:39,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:56:39,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-27 14:56:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:39,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:56:40,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {5721#true} call ULTIMATE.init(); {5721#true} is VALID [2022-04-27 14:56:40,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {5721#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); {5721#true} is VALID [2022-04-27 14:56:40,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {5721#true} assume true; {5721#true} is VALID [2022-04-27 14:56:40,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5721#true} {5721#true} #63#return; {5721#true} is VALID [2022-04-27 14:56:40,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {5721#true} call #t~ret5 := main(); {5721#true} is VALID [2022-04-27 14:56:40,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {5721#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; {5721#true} is VALID [2022-04-27 14:56:40,261 INFO L272 TraceCheckUtils]: 6: Hoare triple {5721#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {5721#true} is VALID [2022-04-27 14:56:40,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {5721#true} ~cond := #in~cond; {5721#true} is VALID [2022-04-27 14:56:40,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {5721#true} assume !(0 == ~cond); {5721#true} is VALID [2022-04-27 14:56:40,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {5721#true} assume true; {5721#true} is VALID [2022-04-27 14:56:40,261 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5721#true} {5721#true} #53#return; {5721#true} is VALID [2022-04-27 14:56:40,261 INFO L272 TraceCheckUtils]: 11: Hoare triple {5721#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5721#true} is VALID [2022-04-27 14:56:40,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {5721#true} ~cond := #in~cond; {5721#true} is VALID [2022-04-27 14:56:40,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {5721#true} assume !(0 == ~cond); {5721#true} is VALID [2022-04-27 14:56:40,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {5721#true} assume true; {5721#true} is VALID [2022-04-27 14:56:40,262 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5721#true} {5721#true} #55#return; {5721#true} is VALID [2022-04-27 14:56:40,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {5721#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5774#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:56:40,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {5774#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5774#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:56:40,266 INFO L272 TraceCheckUtils]: 18: Hoare triple {5774#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5721#true} is VALID [2022-04-27 14:56:40,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {5721#true} ~cond := #in~cond; {5721#true} is VALID [2022-04-27 14:56:40,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {5721#true} assume !(0 == ~cond); {5721#true} is VALID [2022-04-27 14:56:40,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {5721#true} assume true; {5721#true} is VALID [2022-04-27 14:56:40,267 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5721#true} {5774#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {5774#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:56:40,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {5774#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5796#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:56:40,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {5796#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {5796#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:56:40,268 INFO L272 TraceCheckUtils]: 25: Hoare triple {5796#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5721#true} is VALID [2022-04-27 14:56:40,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {5721#true} ~cond := #in~cond; {5721#true} is VALID [2022-04-27 14:56:40,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {5721#true} assume !(0 == ~cond); {5721#true} is VALID [2022-04-27 14:56:40,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {5721#true} assume true; {5721#true} is VALID [2022-04-27 14:56:40,269 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5721#true} {5796#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {5796#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:56:40,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {5796#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5818#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:56:40,270 INFO L290 TraceCheckUtils]: 31: Hoare triple {5818#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {5818#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:56:40,270 INFO L272 TraceCheckUtils]: 32: Hoare triple {5818#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5721#true} is VALID [2022-04-27 14:56:40,270 INFO L290 TraceCheckUtils]: 33: Hoare triple {5721#true} ~cond := #in~cond; {5721#true} is VALID [2022-04-27 14:56:40,270 INFO L290 TraceCheckUtils]: 34: Hoare triple {5721#true} assume !(0 == ~cond); {5721#true} is VALID [2022-04-27 14:56:40,270 INFO L290 TraceCheckUtils]: 35: Hoare triple {5721#true} assume true; {5721#true} is VALID [2022-04-27 14:56:40,271 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5721#true} {5818#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #57#return; {5818#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:56:40,271 INFO L290 TraceCheckUtils]: 37: Hoare triple {5818#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5840#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 14:56:40,272 INFO L290 TraceCheckUtils]: 38: Hoare triple {5840#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {5840#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 14:56:40,272 INFO L272 TraceCheckUtils]: 39: Hoare triple {5840#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5721#true} is VALID [2022-04-27 14:56:40,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {5721#true} ~cond := #in~cond; {5721#true} is VALID [2022-04-27 14:56:40,272 INFO L290 TraceCheckUtils]: 41: Hoare triple {5721#true} assume !(0 == ~cond); {5721#true} is VALID [2022-04-27 14:56:40,272 INFO L290 TraceCheckUtils]: 42: Hoare triple {5721#true} assume true; {5721#true} is VALID [2022-04-27 14:56:40,272 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5721#true} {5840#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #57#return; {5840#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 14:56:40,273 INFO L290 TraceCheckUtils]: 44: Hoare triple {5840#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5862#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:56:40,273 INFO L290 TraceCheckUtils]: 45: Hoare triple {5862#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {5862#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:56:40,273 INFO L272 TraceCheckUtils]: 46: Hoare triple {5862#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5721#true} is VALID [2022-04-27 14:56:40,273 INFO L290 TraceCheckUtils]: 47: Hoare triple {5721#true} ~cond := #in~cond; {5721#true} is VALID [2022-04-27 14:56:40,273 INFO L290 TraceCheckUtils]: 48: Hoare triple {5721#true} assume !(0 == ~cond); {5721#true} is VALID [2022-04-27 14:56:40,273 INFO L290 TraceCheckUtils]: 49: Hoare triple {5721#true} assume true; {5721#true} is VALID [2022-04-27 14:56:40,274 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5721#true} {5862#(and (= main_~y~0 4) (= main_~c~0 4))} #57#return; {5862#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:56:40,274 INFO L290 TraceCheckUtils]: 51: Hoare triple {5862#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5884#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:56:40,275 INFO L290 TraceCheckUtils]: 52: Hoare triple {5884#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {5884#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:56:40,275 INFO L272 TraceCheckUtils]: 53: Hoare triple {5884#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5721#true} is VALID [2022-04-27 14:56:40,275 INFO L290 TraceCheckUtils]: 54: Hoare triple {5721#true} ~cond := #in~cond; {5721#true} is VALID [2022-04-27 14:56:40,275 INFO L290 TraceCheckUtils]: 55: Hoare triple {5721#true} assume !(0 == ~cond); {5721#true} is VALID [2022-04-27 14:56:40,275 INFO L290 TraceCheckUtils]: 56: Hoare triple {5721#true} assume true; {5721#true} is VALID [2022-04-27 14:56:40,276 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {5721#true} {5884#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #57#return; {5884#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:56:40,276 INFO L290 TraceCheckUtils]: 58: Hoare triple {5884#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5906#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:56:40,276 INFO L290 TraceCheckUtils]: 59: Hoare triple {5906#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {5906#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:56:40,276 INFO L272 TraceCheckUtils]: 60: Hoare triple {5906#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5721#true} is VALID [2022-04-27 14:56:40,277 INFO L290 TraceCheckUtils]: 61: Hoare triple {5721#true} ~cond := #in~cond; {5721#true} is VALID [2022-04-27 14:56:40,277 INFO L290 TraceCheckUtils]: 62: Hoare triple {5721#true} assume !(0 == ~cond); {5721#true} is VALID [2022-04-27 14:56:40,277 INFO L290 TraceCheckUtils]: 63: Hoare triple {5721#true} assume true; {5721#true} is VALID [2022-04-27 14:56:40,277 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5721#true} {5906#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #57#return; {5906#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:56:40,278 INFO L290 TraceCheckUtils]: 65: Hoare triple {5906#(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 * ~y~0 * ~y~0 + ~x~0; {5928#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-27 14:56:40,278 INFO L290 TraceCheckUtils]: 66: Hoare triple {5928#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} assume !false; {5928#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-27 14:56:40,278 INFO L272 TraceCheckUtils]: 67: Hoare triple {5928#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5721#true} is VALID [2022-04-27 14:56:40,278 INFO L290 TraceCheckUtils]: 68: Hoare triple {5721#true} ~cond := #in~cond; {5721#true} is VALID [2022-04-27 14:56:40,278 INFO L290 TraceCheckUtils]: 69: Hoare triple {5721#true} assume !(0 == ~cond); {5721#true} is VALID [2022-04-27 14:56:40,278 INFO L290 TraceCheckUtils]: 70: Hoare triple {5721#true} assume true; {5721#true} is VALID [2022-04-27 14:56:40,279 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5721#true} {5928#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} #57#return; {5928#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-27 14:56:40,279 INFO L290 TraceCheckUtils]: 72: Hoare triple {5928#(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 * ~y~0 * ~y~0 + ~x~0; {5950#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:56:40,280 INFO L290 TraceCheckUtils]: 73: Hoare triple {5950#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} assume !false; {5950#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:56:40,280 INFO L272 TraceCheckUtils]: 74: Hoare triple {5950#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5721#true} is VALID [2022-04-27 14:56:40,280 INFO L290 TraceCheckUtils]: 75: Hoare triple {5721#true} ~cond := #in~cond; {5721#true} is VALID [2022-04-27 14:56:40,280 INFO L290 TraceCheckUtils]: 76: Hoare triple {5721#true} assume !(0 == ~cond); {5721#true} is VALID [2022-04-27 14:56:40,280 INFO L290 TraceCheckUtils]: 77: Hoare triple {5721#true} assume true; {5721#true} is VALID [2022-04-27 14:56:40,280 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {5721#true} {5950#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} #57#return; {5950#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:56:40,281 INFO L290 TraceCheckUtils]: 79: Hoare triple {5950#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5972#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:56:40,282 INFO L290 TraceCheckUtils]: 80: Hoare triple {5972#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {5972#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:56:40,282 INFO L272 TraceCheckUtils]: 81: Hoare triple {5972#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5721#true} is VALID [2022-04-27 14:56:40,282 INFO L290 TraceCheckUtils]: 82: Hoare triple {5721#true} ~cond := #in~cond; {5721#true} is VALID [2022-04-27 14:56:40,282 INFO L290 TraceCheckUtils]: 83: Hoare triple {5721#true} assume !(0 == ~cond); {5721#true} is VALID [2022-04-27 14:56:40,282 INFO L290 TraceCheckUtils]: 84: Hoare triple {5721#true} assume true; {5721#true} is VALID [2022-04-27 14:56:40,282 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {5721#true} {5972#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #57#return; {5972#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:56:40,283 INFO L290 TraceCheckUtils]: 86: Hoare triple {5972#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5994#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-27 14:56:40,283 INFO L290 TraceCheckUtils]: 87: Hoare triple {5994#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} assume !false; {5994#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-27 14:56:40,284 INFO L272 TraceCheckUtils]: 88: Hoare triple {5994#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5721#true} is VALID [2022-04-27 14:56:40,284 INFO L290 TraceCheckUtils]: 89: Hoare triple {5721#true} ~cond := #in~cond; {5721#true} is VALID [2022-04-27 14:56:40,284 INFO L290 TraceCheckUtils]: 90: Hoare triple {5721#true} assume !(0 == ~cond); {5721#true} is VALID [2022-04-27 14:56:40,284 INFO L290 TraceCheckUtils]: 91: Hoare triple {5721#true} assume true; {5721#true} is VALID [2022-04-27 14:56:40,284 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {5721#true} {5994#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} #57#return; {5994#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-27 14:56:40,285 INFO L290 TraceCheckUtils]: 93: Hoare triple {5994#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {6016#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-27 14:56:40,285 INFO L272 TraceCheckUtils]: 94: Hoare triple {6016#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5721#true} is VALID [2022-04-27 14:56:40,285 INFO L290 TraceCheckUtils]: 95: Hoare triple {5721#true} ~cond := #in~cond; {5721#true} is VALID [2022-04-27 14:56:40,285 INFO L290 TraceCheckUtils]: 96: Hoare triple {5721#true} assume !(0 == ~cond); {5721#true} is VALID [2022-04-27 14:56:40,285 INFO L290 TraceCheckUtils]: 97: Hoare triple {5721#true} assume true; {5721#true} is VALID [2022-04-27 14:56:40,285 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {5721#true} {6016#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} #59#return; {6016#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-27 14:56:40,287 INFO L272 TraceCheckUtils]: 99: Hoare triple {6016#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {6035#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:40,287 INFO L290 TraceCheckUtils]: 100: Hoare triple {6035#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6039#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:40,287 INFO L290 TraceCheckUtils]: 101: Hoare triple {6039#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5722#false} is VALID [2022-04-27 14:56:40,287 INFO L290 TraceCheckUtils]: 102: Hoare triple {5722#false} assume !false; {5722#false} is VALID [2022-04-27 14:56:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 24 proven. 165 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-27 14:56:40,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:56:40,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:56:40,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709092922] [2022-04-27 14:56:40,549 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:56:40,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178096652] [2022-04-27 14:56:40,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178096652] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:56:40,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:56:40,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-27 14:56:40,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500374561] [2022-04-27 14:56:40,550 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:56:40,550 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Word has length 103 [2022-04-27 14:56:40,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:56:40,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-27 14:56:40,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:40,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 14:56:40,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:56:40,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 14:56:40,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:56:40,618 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-27 14:56:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:41,771 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-27 14:56:41,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 14:56:41,772 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Word has length 103 [2022-04-27 14:56:41,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:56:41,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-27 14:56:41,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2022-04-27 14:56:41,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-27 14:56:41,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2022-04-27 14:56:41,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 78 transitions. [2022-04-27 14:56:41,840 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:56:41,841 INFO L225 Difference]: With dead ends: 69 [2022-04-27 14:56:41,841 INFO L226 Difference]: Without dead ends: 63 [2022-04-27 14:56:41,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-27 14:56:41,842 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 14:56:41,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 486 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 14:56:41,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-27 14:56:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-27 14:56:41,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:56:41,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:56:41,875 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:56:41,875 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:56:41,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:41,876 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-27 14:56:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-27 14:56:41,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:41,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:41,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-27 14:56:41,877 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-27 14:56:41,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:41,878 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-27 14:56:41,878 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-27 14:56:41,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:41,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:41,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:56:41,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:56:41,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:56:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2022-04-27 14:56:41,882 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 103 [2022-04-27 14:56:41,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:56:41,882 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-04-27 14:56:41,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-27 14:56:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-27 14:56:41,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-27 14:56:41,884 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:56:41,884 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 12, 12, 12, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:56:41,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-27 14:56:42,100 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:56:42,100 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:56:42,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:56:42,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1881400669, now seen corresponding path program 11 times [2022-04-27 14:56:42,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:56:42,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051206964] [2022-04-27 14:56:42,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:42,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:56:42,112 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:56:42,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1181031172] [2022-04-27 14:56:42,112 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:56:42,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:42,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:56:42,113 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:56:42,114 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:57:03,786 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-04-27 14:57:03,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:57:03,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-27 14:57:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:57:03,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:57:04,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {6439#true} call ULTIMATE.init(); {6439#true} is VALID [2022-04-27 14:57:04,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {6439#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); {6439#true} is VALID [2022-04-27 14:57:04,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {6439#true} assume true; {6439#true} is VALID [2022-04-27 14:57:04,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6439#true} {6439#true} #63#return; {6439#true} is VALID [2022-04-27 14:57:04,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {6439#true} call #t~ret5 := main(); {6439#true} is VALID [2022-04-27 14:57:04,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {6439#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; {6439#true} is VALID [2022-04-27 14:57:04,396 INFO L272 TraceCheckUtils]: 6: Hoare triple {6439#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {6439#true} is VALID [2022-04-27 14:57:04,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {6439#true} ~cond := #in~cond; {6439#true} is VALID [2022-04-27 14:57:04,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {6439#true} assume !(0 == ~cond); {6439#true} is VALID [2022-04-27 14:57:04,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {6439#true} assume true; {6439#true} is VALID [2022-04-27 14:57:04,396 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6439#true} {6439#true} #53#return; {6439#true} is VALID [2022-04-27 14:57:04,396 INFO L272 TraceCheckUtils]: 11: Hoare triple {6439#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6439#true} is VALID [2022-04-27 14:57:04,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {6439#true} ~cond := #in~cond; {6439#true} is VALID [2022-04-27 14:57:04,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {6439#true} assume !(0 == ~cond); {6439#true} is VALID [2022-04-27 14:57:04,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {6439#true} assume true; {6439#true} is VALID [2022-04-27 14:57:04,397 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6439#true} {6439#true} #55#return; {6439#true} is VALID [2022-04-27 14:57:04,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {6439#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6492#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:57:04,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {6492#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6492#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:57:04,397 INFO L272 TraceCheckUtils]: 18: Hoare triple {6492#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6439#true} is VALID [2022-04-27 14:57:04,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {6439#true} ~cond := #in~cond; {6439#true} is VALID [2022-04-27 14:57:04,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {6439#true} assume !(0 == ~cond); {6439#true} is VALID [2022-04-27 14:57:04,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {6439#true} assume true; {6439#true} is VALID [2022-04-27 14:57:04,398 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6439#true} {6492#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {6492#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:57:04,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {6492#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6514#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:57:04,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {6514#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {6514#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:57:04,400 INFO L272 TraceCheckUtils]: 25: Hoare triple {6514#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6439#true} is VALID [2022-04-27 14:57:04,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {6439#true} ~cond := #in~cond; {6439#true} is VALID [2022-04-27 14:57:04,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {6439#true} assume !(0 == ~cond); {6439#true} is VALID [2022-04-27 14:57:04,400 INFO L290 TraceCheckUtils]: 28: Hoare triple {6439#true} assume true; {6439#true} is VALID [2022-04-27 14:57:04,400 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6439#true} {6514#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {6514#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:57:04,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {6514#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6536#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:57:04,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {6536#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {6536#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:57:04,401 INFO L272 TraceCheckUtils]: 32: Hoare triple {6536#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6439#true} is VALID [2022-04-27 14:57:04,401 INFO L290 TraceCheckUtils]: 33: Hoare triple {6439#true} ~cond := #in~cond; {6439#true} is VALID [2022-04-27 14:57:04,401 INFO L290 TraceCheckUtils]: 34: Hoare triple {6439#true} assume !(0 == ~cond); {6439#true} is VALID [2022-04-27 14:57:04,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {6439#true} assume true; {6439#true} is VALID [2022-04-27 14:57:04,402 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6439#true} {6536#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {6536#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:57:04,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {6536#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6558#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:57:04,403 INFO L290 TraceCheckUtils]: 38: Hoare triple {6558#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {6558#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:57:04,403 INFO L272 TraceCheckUtils]: 39: Hoare triple {6558#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6439#true} is VALID [2022-04-27 14:57:04,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {6439#true} ~cond := #in~cond; {6439#true} is VALID [2022-04-27 14:57:04,403 INFO L290 TraceCheckUtils]: 41: Hoare triple {6439#true} assume !(0 == ~cond); {6439#true} is VALID [2022-04-27 14:57:04,403 INFO L290 TraceCheckUtils]: 42: Hoare triple {6439#true} assume true; {6439#true} is VALID [2022-04-27 14:57:04,403 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6439#true} {6558#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #57#return; {6558#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:57:04,404 INFO L290 TraceCheckUtils]: 44: Hoare triple {6558#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6580#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-27 14:57:04,404 INFO L290 TraceCheckUtils]: 45: Hoare triple {6580#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} assume !false; {6580#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-27 14:57:04,405 INFO L272 TraceCheckUtils]: 46: Hoare triple {6580#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6439#true} is VALID [2022-04-27 14:57:04,405 INFO L290 TraceCheckUtils]: 47: Hoare triple {6439#true} ~cond := #in~cond; {6439#true} is VALID [2022-04-27 14:57:04,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {6439#true} assume !(0 == ~cond); {6439#true} is VALID [2022-04-27 14:57:04,405 INFO L290 TraceCheckUtils]: 49: Hoare triple {6439#true} assume true; {6439#true} is VALID [2022-04-27 14:57:04,405 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6439#true} {6580#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} #57#return; {6580#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-27 14:57:04,406 INFO L290 TraceCheckUtils]: 51: Hoare triple {6580#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6602#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 14:57:04,406 INFO L290 TraceCheckUtils]: 52: Hoare triple {6602#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !false; {6602#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 14:57:04,406 INFO L272 TraceCheckUtils]: 53: Hoare triple {6602#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6439#true} is VALID [2022-04-27 14:57:04,406 INFO L290 TraceCheckUtils]: 54: Hoare triple {6439#true} ~cond := #in~cond; {6439#true} is VALID [2022-04-27 14:57:04,406 INFO L290 TraceCheckUtils]: 55: Hoare triple {6439#true} assume !(0 == ~cond); {6439#true} is VALID [2022-04-27 14:57:04,406 INFO L290 TraceCheckUtils]: 56: Hoare triple {6439#true} assume true; {6439#true} is VALID [2022-04-27 14:57:04,407 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {6439#true} {6602#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #57#return; {6602#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 14:57:04,407 INFO L290 TraceCheckUtils]: 58: Hoare triple {6602#(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 * ~y~0 * ~y~0 + ~x~0; {6624#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:57:04,408 INFO L290 TraceCheckUtils]: 59: Hoare triple {6624#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {6624#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:57:04,408 INFO L272 TraceCheckUtils]: 60: Hoare triple {6624#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6439#true} is VALID [2022-04-27 14:57:04,408 INFO L290 TraceCheckUtils]: 61: Hoare triple {6439#true} ~cond := #in~cond; {6439#true} is VALID [2022-04-27 14:57:04,408 INFO L290 TraceCheckUtils]: 62: Hoare triple {6439#true} assume !(0 == ~cond); {6439#true} is VALID [2022-04-27 14:57:04,408 INFO L290 TraceCheckUtils]: 63: Hoare triple {6439#true} assume true; {6439#true} is VALID [2022-04-27 14:57:04,408 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6439#true} {6624#(and (= main_~y~0 6) (= main_~c~0 6))} #57#return; {6624#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:57:04,409 INFO L290 TraceCheckUtils]: 65: Hoare triple {6624#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6646#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:57:04,409 INFO L290 TraceCheckUtils]: 66: Hoare triple {6646#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !false; {6646#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:57:04,409 INFO L272 TraceCheckUtils]: 67: Hoare triple {6646#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6439#true} is VALID [2022-04-27 14:57:04,409 INFO L290 TraceCheckUtils]: 68: Hoare triple {6439#true} ~cond := #in~cond; {6439#true} is VALID [2022-04-27 14:57:04,410 INFO L290 TraceCheckUtils]: 69: Hoare triple {6439#true} assume !(0 == ~cond); {6439#true} is VALID [2022-04-27 14:57:04,410 INFO L290 TraceCheckUtils]: 70: Hoare triple {6439#true} assume true; {6439#true} is VALID [2022-04-27 14:57:04,410 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6439#true} {6646#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #57#return; {6646#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:57:04,410 INFO L290 TraceCheckUtils]: 72: Hoare triple {6646#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6668#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:57:04,411 INFO L290 TraceCheckUtils]: 73: Hoare triple {6668#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {6668#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:57:04,411 INFO L272 TraceCheckUtils]: 74: Hoare triple {6668#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6439#true} is VALID [2022-04-27 14:57:04,411 INFO L290 TraceCheckUtils]: 75: Hoare triple {6439#true} ~cond := #in~cond; {6439#true} is VALID [2022-04-27 14:57:04,411 INFO L290 TraceCheckUtils]: 76: Hoare triple {6439#true} assume !(0 == ~cond); {6439#true} is VALID [2022-04-27 14:57:04,411 INFO L290 TraceCheckUtils]: 77: Hoare triple {6439#true} assume true; {6439#true} is VALID [2022-04-27 14:57:04,411 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {6439#true} {6668#(and (= main_~y~0 8) (= main_~c~0 8))} #57#return; {6668#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:57:04,412 INFO L290 TraceCheckUtils]: 79: Hoare triple {6668#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6690#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:57:04,412 INFO L290 TraceCheckUtils]: 80: Hoare triple {6690#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {6690#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:57:04,412 INFO L272 TraceCheckUtils]: 81: Hoare triple {6690#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6439#true} is VALID [2022-04-27 14:57:04,412 INFO L290 TraceCheckUtils]: 82: Hoare triple {6439#true} ~cond := #in~cond; {6439#true} is VALID [2022-04-27 14:57:04,412 INFO L290 TraceCheckUtils]: 83: Hoare triple {6439#true} assume !(0 == ~cond); {6439#true} is VALID [2022-04-27 14:57:04,413 INFO L290 TraceCheckUtils]: 84: Hoare triple {6439#true} assume true; {6439#true} is VALID [2022-04-27 14:57:04,413 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {6439#true} {6690#(and (= main_~y~0 9) (= main_~c~0 9))} #57#return; {6690#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:57:04,414 INFO L290 TraceCheckUtils]: 86: Hoare triple {6690#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6712#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 14:57:04,414 INFO L290 TraceCheckUtils]: 87: Hoare triple {6712#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {6712#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 14:57:04,414 INFO L272 TraceCheckUtils]: 88: Hoare triple {6712#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6439#true} is VALID [2022-04-27 14:57:04,414 INFO L290 TraceCheckUtils]: 89: Hoare triple {6439#true} ~cond := #in~cond; {6439#true} is VALID [2022-04-27 14:57:04,414 INFO L290 TraceCheckUtils]: 90: Hoare triple {6439#true} assume !(0 == ~cond); {6439#true} is VALID [2022-04-27 14:57:04,414 INFO L290 TraceCheckUtils]: 91: Hoare triple {6439#true} assume true; {6439#true} is VALID [2022-04-27 14:57:04,415 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {6439#true} {6712#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #57#return; {6712#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 14:57:04,415 INFO L290 TraceCheckUtils]: 93: Hoare triple {6712#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6734#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-27 14:57:04,416 INFO L290 TraceCheckUtils]: 94: Hoare triple {6734#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} assume !false; {6734#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-27 14:57:04,416 INFO L272 TraceCheckUtils]: 95: Hoare triple {6734#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6439#true} is VALID [2022-04-27 14:57:04,416 INFO L290 TraceCheckUtils]: 96: Hoare triple {6439#true} ~cond := #in~cond; {6439#true} is VALID [2022-04-27 14:57:04,416 INFO L290 TraceCheckUtils]: 97: Hoare triple {6439#true} assume !(0 == ~cond); {6439#true} is VALID [2022-04-27 14:57:04,416 INFO L290 TraceCheckUtils]: 98: Hoare triple {6439#true} assume true; {6439#true} is VALID [2022-04-27 14:57:04,416 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {6439#true} {6734#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} #57#return; {6734#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-27 14:57:04,417 INFO L290 TraceCheckUtils]: 100: Hoare triple {6734#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} assume !(~c~0 < ~k~0); {6756#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} is VALID [2022-04-27 14:57:04,417 INFO L272 TraceCheckUtils]: 101: Hoare triple {6756#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6439#true} is VALID [2022-04-27 14:57:04,417 INFO L290 TraceCheckUtils]: 102: Hoare triple {6439#true} ~cond := #in~cond; {6439#true} is VALID [2022-04-27 14:57:04,417 INFO L290 TraceCheckUtils]: 103: Hoare triple {6439#true} assume !(0 == ~cond); {6439#true} is VALID [2022-04-27 14:57:04,417 INFO L290 TraceCheckUtils]: 104: Hoare triple {6439#true} assume true; {6439#true} is VALID [2022-04-27 14:57:04,417 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {6439#true} {6756#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} #59#return; {6756#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} is VALID [2022-04-27 14:57:04,418 INFO L272 TraceCheckUtils]: 106: Hoare triple {6756#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {6775#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:57:04,418 INFO L290 TraceCheckUtils]: 107: Hoare triple {6775#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6779#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:57:04,419 INFO L290 TraceCheckUtils]: 108: Hoare triple {6779#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6440#false} is VALID [2022-04-27 14:57:04,419 INFO L290 TraceCheckUtils]: 109: Hoare triple {6440#false} assume !false; {6440#false} is VALID [2022-04-27 14:57:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 26 proven. 198 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-27 14:57:04,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:57:04,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:57:04,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051206964] [2022-04-27 14:57:04,662 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:57:04,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181031172] [2022-04-27 14:57:04,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181031172] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:57:04,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:57:04,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-27 14:57:04,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588761852] [2022-04-27 14:57:04,663 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:57:04,663 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Word has length 110 [2022-04-27 14:57:04,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:57:04,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-27 14:57:04,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:57:04,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 14:57:04,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:57:04,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 14:57:04,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-27 14:57:04,716 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-27 14:57:06,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:57:06,107 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2022-04-27 14:57:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 14:57:06,108 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Word has length 110 [2022-04-27 14:57:06,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:57:06,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-27 14:57:06,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2022-04-27 14:57:06,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-27 14:57:06,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2022-04-27 14:57:06,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2022-04-27 14:57:06,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:57:06,175 INFO L225 Difference]: With dead ends: 72 [2022-04-27 14:57:06,175 INFO L226 Difference]: Without dead ends: 66 [2022-04-27 14:57:06,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-27 14:57:06,176 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 14:57:06,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 535 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 14:57:06,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-27 14:57:06,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-27 14:57:06,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:57:06,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:57:06,205 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:57:06,205 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:57:06,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:57:06,206 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-27 14:57:06,206 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-27 14:57:06,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:57:06,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:57:06,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-27 14:57:06,207 INFO L87 Difference]: Start difference. First operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-27 14:57:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:57:06,208 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-27 14:57:06,208 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-27 14:57:06,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:57:06,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:57:06,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:57:06,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:57:06,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:57:06,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-04-27 14:57:06,210 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 110 [2022-04-27 14:57:06,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:57:06,210 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-04-27 14:57:06,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-27 14:57:06,210 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-27 14:57:06,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-27 14:57:06,211 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:57:06,211 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 13, 13, 13, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:57:06,229 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:57:06,415 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:57:06,415 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:57:06,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:57:06,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1600671149, now seen corresponding path program 12 times [2022-04-27 14:57:06,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:57:06,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750524401] [2022-04-27 14:57:06,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:57:06,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:57:06,432 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:57:06,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1739962986] [2022-04-27 14:57:06,433 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:57:06,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:57:06,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:57:06,435 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:57:06,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process