/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:33:22,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:33:22,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:33:23,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:33:23,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:33:23,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:33:23,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:33:23,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:33:23,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:33:23,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:33:23,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:33:23,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:33:23,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:33:23,064 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:33:23,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:33:23,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:33:23,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:33:23,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:33:23,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:33:23,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:33:23,071 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:33:23,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:33:23,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:33:23,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:33:23,081 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:33:23,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:33:23,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:33:23,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:33:23,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:33:23,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:33:23,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:33:23,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:33:23,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:33:23,095 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:33:23,096 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:33:23,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:33:23,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:33:23,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:33:23,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:33:23,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:33:23,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:33:23,099 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:33:23,099 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:33:23,117 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:33:23,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:33:23,117 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:33:23,117 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:33:23,118 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:33:23,118 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:33:23,118 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:33:23,118 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:33:23,118 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:33:23,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:33:23,119 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:33:23,119 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:33:23,119 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:33:23,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:33:23,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:33:23,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:33:23,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:33:23,119 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:33:23,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:33:23,120 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:33:23,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:33:23,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:33:23,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:33:23,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:33:23,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:33:23,120 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:33:23,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:33:23,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:33:23,121 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:33:23,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:33:23,121 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:33:23,121 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:33:23,121 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:33:23,121 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:33:23,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:33:23,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:33:23,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:33:23,368 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:33:23,370 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:33:23,371 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound100.c [2022-04-27 14:33:23,420 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/230f83dc8/4e67c851fdf143f8bce0ca1c318c596b/FLAG9130e6776 [2022-04-27 14:33:23,832 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:33:23,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound100.c [2022-04-27 14:33:23,838 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/230f83dc8/4e67c851fdf143f8bce0ca1c318c596b/FLAG9130e6776 [2022-04-27 14:33:23,848 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/230f83dc8/4e67c851fdf143f8bce0ca1c318c596b [2022-04-27 14:33:23,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:33:23,854 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:33:23,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:33:23,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:33:23,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:33:23,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:33:23" (1/1) ... [2022-04-27 14:33:23,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f5897c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:23, skipping insertion in model container [2022-04-27 14:33:23,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:33:23" (1/1) ... [2022-04-27 14:33:23,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:33:23,878 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:33:24,020 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound100.c[458,471] [2022-04-27 14:33:24,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:33:24,059 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:33:24,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound100.c[458,471] [2022-04-27 14:33:24,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:33:24,085 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:33:24,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:24 WrapperNode [2022-04-27 14:33:24,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:33:24,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:33:24,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:33:24,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:33:24,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:24" (1/1) ... [2022-04-27 14:33:24,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:24" (1/1) ... [2022-04-27 14:33:24,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:24" (1/1) ... [2022-04-27 14:33:24,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:24" (1/1) ... [2022-04-27 14:33:24,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:24" (1/1) ... [2022-04-27 14:33:24,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:24" (1/1) ... [2022-04-27 14:33:24,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:24" (1/1) ... [2022-04-27 14:33:24,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:33:24,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:33:24,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:33:24,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:33:24,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:24" (1/1) ... [2022-04-27 14:33:24,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:33:24,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:33:24,140 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:33:24,147 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:33:24,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:33:24,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:33:24,184 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:33:24,185 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:33:24,186 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:33:24,186 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:33:24,186 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:33:24,186 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:33:24,187 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:33:24,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:33:24,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:33:24,187 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:33:24,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:33:24,194 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:33:24,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:33:24,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:33:24,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:33:24,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:33:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:33:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:33:24,251 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:33:24,252 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:33:24,419 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:33:24,424 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:33:24,425 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:33:24,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:33:24 BoogieIcfgContainer [2022-04-27 14:33:24,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:33:24,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:33:24,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:33:24,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:33:24,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:33:23" (1/3) ... [2022-04-27 14:33:24,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d64118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:33:24, skipping insertion in model container [2022-04-27 14:33:24,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:24" (2/3) ... [2022-04-27 14:33:24,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d64118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:33:24, skipping insertion in model container [2022-04-27 14:33:24,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:33:24" (3/3) ... [2022-04-27 14:33:24,448 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound100.c [2022-04-27 14:33:24,474 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:33:24,475 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:33:24,553 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:33:24,572 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@5b511d3d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1217e1eb [2022-04-27 14:33:24,572 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:33:24,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:24,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 14:33:24,586 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:33:24,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:33:24,587 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:33:24,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:33:24,593 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 1 times [2022-04-27 14:33:24,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:33:24,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542517535] [2022-04-27 14:33:24,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:24,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:33:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:24,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:33:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:24,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26#true} is VALID [2022-04-27 14:33:24,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 14:33:24,785 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-27 14:33:24,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:33:24,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26#true} is VALID [2022-04-27 14:33:24,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 14:33:24,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-27 14:33:24,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret6 := main(); {26#true} is VALID [2022-04-27 14:33:24,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {26#true} is VALID [2022-04-27 14:33:24,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-27 14:33:24,792 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27#false} is VALID [2022-04-27 14:33:24,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-27 14:33:24,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-27 14:33:24,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-27 14:33:24,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:33:24,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:33:24,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542517535] [2022-04-27 14:33:24,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542517535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:33:24,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:33:24,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:33:24,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456757910] [2022-04-27 14:33:24,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:33:24,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 14:33:24,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:33:24,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:24,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:33:24,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:33:24,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:33:24,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:33:24,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:33:24,841 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:24,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:24,981 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-27 14:33:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:33:24,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 14:33:24,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:33:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:24,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 14:33:24,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:24,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 14:33:24,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-27 14:33:25,057 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:33:25,064 INFO L225 Difference]: With dead ends: 41 [2022-04-27 14:33:25,064 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 14:33:25,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:33:25,069 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:33:25,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:33:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 14:33:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-27 14:33:25,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:33:25,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:25,095 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:25,095 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:25,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:25,098 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-27 14:33:25,098 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-27 14:33:25,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:25,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:25,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-27 14:33:25,100 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-27 14:33:25,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:25,102 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-27 14:33:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-27 14:33:25,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:25,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:25,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:33:25,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:33:25,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-27 14:33:25,106 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2022-04-27 14:33:25,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:33:25,107 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-27 14:33:25,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:25,107 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-27 14:33:25,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 14:33:25,108 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:33:25,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:33:25,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:33:25,108 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:33:25,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:33:25,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 1 times [2022-04-27 14:33:25,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:33:25,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245077524] [2022-04-27 14:33:25,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:25,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:33:25,124 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:33:25,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1019450854] [2022-04-27 14:33:25,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:25,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:33:25,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:33:25,130 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:33:25,167 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:33:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:25,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 14:33:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:25,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:33:25,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {155#true} call ULTIMATE.init(); {155#true} is VALID [2022-04-27 14:33:25,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:25,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#(<= ~counter~0 0)} assume true; {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:25,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#(<= ~counter~0 0)} {155#true} #57#return; {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:25,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#(<= ~counter~0 0)} call #t~ret6 := main(); {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:25,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:25,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {179#(<= |main_#t~post5| 0)} is VALID [2022-04-27 14:33:25,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {179#(<= |main_#t~post5| 0)} assume !(#t~post5 < 100);havoc #t~post5; {156#false} is VALID [2022-04-27 14:33:25,358 INFO L272 TraceCheckUtils]: 8: Hoare triple {156#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {156#false} is VALID [2022-04-27 14:33:25,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {156#false} ~cond := #in~cond; {156#false} is VALID [2022-04-27 14:33:25,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {156#false} assume 0 == ~cond; {156#false} is VALID [2022-04-27 14:33:25,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {156#false} assume !false; {156#false} is VALID [2022-04-27 14:33:25,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:33:25,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:33:25,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:33:25,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245077524] [2022-04-27 14:33:25,361 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:33:25,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019450854] [2022-04-27 14:33:25,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019450854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:33:25,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:33:25,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:33:25,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236971425] [2022-04-27 14:33:25,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:33:25,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:33:25,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:33:25,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:25,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:33:25,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 14:33:25,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:33:25,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 14:33:25,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:33:25,382 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:25,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:25,441 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-27 14:33:25,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 14:33:25,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:33:25,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:33:25,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-27 14:33:25,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:25,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-27 14:33:25,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-04-27 14:33:25,475 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:33:25,476 INFO L225 Difference]: With dead ends: 28 [2022-04-27 14:33:25,476 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 14:33:25,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:33:25,478 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:33:25,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:33:25,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 14:33:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 14:33:25,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:33:25,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:25,485 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:25,485 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:25,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:25,487 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 14:33:25,487 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 14:33:25,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:25,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:25,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 14:33:25,488 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 14:33:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:25,490 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 14:33:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 14:33:25,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:25,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:25,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:33:25,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:33:25,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-27 14:33:25,493 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-04-27 14:33:25,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:33:25,493 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-27 14:33:25,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:25,493 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 14:33:25,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 14:33:25,494 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:33:25,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:33:25,521 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:33:25,716 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:33:25,716 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:33:25,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:33:25,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 1 times [2022-04-27 14:33:25,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:33:25,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950484602] [2022-04-27 14:33:25,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:25,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:33:25,732 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:33:25,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1093842274] [2022-04-27 14:33:25,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:25,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:33:25,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:33:25,734 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:33:25,759 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:33:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:25,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:33:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:25,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:33:25,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {305#true} call ULTIMATE.init(); {305#true} is VALID [2022-04-27 14:33:25,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {305#true} is VALID [2022-04-27 14:33:25,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {305#true} assume true; {305#true} is VALID [2022-04-27 14:33:25,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {305#true} {305#true} #57#return; {305#true} is VALID [2022-04-27 14:33:25,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {305#true} call #t~ret6 := main(); {305#true} is VALID [2022-04-27 14:33:25,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {305#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:25,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:25,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:25,897 INFO L272 TraceCheckUtils]: 8: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {335#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:33:25,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {335#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:33:25,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {306#false} is VALID [2022-04-27 14:33:25,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {306#false} assume !false; {306#false} is VALID [2022-04-27 14:33:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:33:25,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:33:25,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:33:25,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950484602] [2022-04-27 14:33:25,908 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:33:25,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093842274] [2022-04-27 14:33:25,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093842274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:33:25,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:33:25,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:33:25,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296355252] [2022-04-27 14:33:25,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:33:25,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:33:25,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:33:25,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:25,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:33:25,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:33:25,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:33:25,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:33:25,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:33:25,922 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:26,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:26,056 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-27 14:33:26,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:33:26,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:33:26,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:33:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 14:33:26,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:26,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 14:33:26,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-27 14:33:26,093 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:33:26,094 INFO L225 Difference]: With dead ends: 30 [2022-04-27 14:33:26,094 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 14:33:26,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:33:26,096 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:33:26,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:33:26,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 14:33:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 14:33:26,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:33:26,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:33:26,103 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:33:26,104 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:33:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:26,105 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:33:26,106 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:33:26,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:26,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:26,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 14:33:26,107 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 14:33:26,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:26,108 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:33:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:33:26,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:26,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:26,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:33:26,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:33:26,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:33:26,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-27 14:33:26,111 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12 [2022-04-27 14:33:26,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:33:26,111 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-27 14:33:26,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:26,112 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:33:26,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 14:33:26,113 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:33:26,113 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:33:26,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 14:33:26,327 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:33:26,328 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:33:26,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:33:26,328 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 1 times [2022-04-27 14:33:26,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:33:26,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371209936] [2022-04-27 14:33:26,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:26,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:33:26,342 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:33:26,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [311354200] [2022-04-27 14:33:26,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:26,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:33:26,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:33:26,356 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:33:26,387 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:33:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:26,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:33:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:26,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:33:26,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2022-04-27 14:33:26,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:26,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#(<= ~counter~0 0)} assume true; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:26,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {489#(<= ~counter~0 0)} {481#true} #57#return; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:26,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {489#(<= ~counter~0 0)} call #t~ret6 := main(); {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:26,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:26,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {489#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:26,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {505#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:26,551 INFO L272 TraceCheckUtils]: 8: Hoare triple {505#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:26,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {505#(<= ~counter~0 1)} ~cond := #in~cond; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:26,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {505#(<= ~counter~0 1)} assume !(0 == ~cond); {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:26,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {505#(<= ~counter~0 1)} assume true; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:26,556 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {505#(<= ~counter~0 1)} {505#(<= ~counter~0 1)} #51#return; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:26,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {505#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:26,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {505#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {530#(<= |main_#t~post5| 1)} is VALID [2022-04-27 14:33:26,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#(<= |main_#t~post5| 1)} assume !(#t~post5 < 100);havoc #t~post5; {482#false} is VALID [2022-04-27 14:33:26,559 INFO L272 TraceCheckUtils]: 16: Hoare triple {482#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {482#false} is VALID [2022-04-27 14:33:26,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2022-04-27 14:33:26,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2022-04-27 14:33:26,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-04-27 14:33:26,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:33:26,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:33:26,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-04-27 14:33:26,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2022-04-27 14:33:26,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2022-04-27 14:33:26,702 INFO L272 TraceCheckUtils]: 16: Hoare triple {482#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {482#false} is VALID [2022-04-27 14:33:26,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {558#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {482#false} is VALID [2022-04-27 14:33:26,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {562#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {558#(< |main_#t~post5| 100)} is VALID [2022-04-27 14:33:26,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {562#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {562#(< ~counter~0 100)} is VALID [2022-04-27 14:33:26,704 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {481#true} {562#(< ~counter~0 100)} #51#return; {562#(< ~counter~0 100)} is VALID [2022-04-27 14:33:26,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {481#true} assume true; {481#true} is VALID [2022-04-27 14:33:26,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {481#true} assume !(0 == ~cond); {481#true} is VALID [2022-04-27 14:33:26,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {481#true} ~cond := #in~cond; {481#true} is VALID [2022-04-27 14:33:26,704 INFO L272 TraceCheckUtils]: 8: Hoare triple {562#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {481#true} is VALID [2022-04-27 14:33:26,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {562#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {562#(< ~counter~0 100)} is VALID [2022-04-27 14:33:26,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {587#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {562#(< ~counter~0 100)} is VALID [2022-04-27 14:33:26,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {587#(< ~counter~0 99)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {587#(< ~counter~0 99)} is VALID [2022-04-27 14:33:26,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {587#(< ~counter~0 99)} call #t~ret6 := main(); {587#(< ~counter~0 99)} is VALID [2022-04-27 14:33:26,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {587#(< ~counter~0 99)} {481#true} #57#return; {587#(< ~counter~0 99)} is VALID [2022-04-27 14:33:26,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {587#(< ~counter~0 99)} assume true; {587#(< ~counter~0 99)} is VALID [2022-04-27 14:33:26,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {587#(< ~counter~0 99)} is VALID [2022-04-27 14:33:26,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2022-04-27 14:33:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:33:26,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:33:26,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371209936] [2022-04-27 14:33:26,711 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:33:26,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311354200] [2022-04-27 14:33:26,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311354200] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:33:26,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:33:26,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 14:33:26,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083392789] [2022-04-27 14:33:26,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:33:26,712 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-27 14:33:26,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:33:26,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:33:26,738 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:33:26,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:33:26,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:33:26,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:33:26,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:33:26,739 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:33:26,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:26,945 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-27 14:33:26,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:33:26,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-27 14:33:26,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:33:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:33:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2022-04-27 14:33:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:33:26,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2022-04-27 14:33:26,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 70 transitions. [2022-04-27 14:33:27,006 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:33:27,008 INFO L225 Difference]: With dead ends: 60 [2022-04-27 14:33:27,008 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 14:33:27,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:33:27,009 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:33:27,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 90 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:33:27,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 14:33:27,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-27 14:33:27,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:33:27,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:33:27,026 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:33:27,026 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:33:27,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:27,029 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 14:33:27,030 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:33:27,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:27,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:27,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 52 states. [2022-04-27 14:33:27,031 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 52 states. [2022-04-27 14:33:27,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:27,033 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 14:33:27,033 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:33:27,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:27,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:27,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:33:27,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:33:27,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:33:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-27 14:33:27,037 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 20 [2022-04-27 14:33:27,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:33:27,037 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-27 14:33:27,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:33:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-27 14:33:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 14:33:27,037 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:33:27,038 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:33:27,063 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:33:27,251 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:33:27,251 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:33:27,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:33:27,252 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 1 times [2022-04-27 14:33:27,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:33:27,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978977812] [2022-04-27 14:33:27,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:27,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:33:27,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:33:27,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1996345269] [2022-04-27 14:33:27,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:27,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:33:27,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:33:27,265 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:33:27,290 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:33:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:27,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:33:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:27,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:33:27,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {875#true} call ULTIMATE.init(); {875#true} is VALID [2022-04-27 14:33:27,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {875#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {875#true} is VALID [2022-04-27 14:33:27,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {875#true} assume true; {875#true} is VALID [2022-04-27 14:33:27,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {875#true} {875#true} #57#return; {875#true} is VALID [2022-04-27 14:33:27,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {875#true} call #t~ret6 := main(); {875#true} is VALID [2022-04-27 14:33:27,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {875#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:27,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:27,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:27,455 INFO L272 TraceCheckUtils]: 8: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {875#true} is VALID [2022-04-27 14:33:27,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {875#true} ~cond := #in~cond; {875#true} is VALID [2022-04-27 14:33:27,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {875#true} assume !(0 == ~cond); {875#true} is VALID [2022-04-27 14:33:27,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {875#true} assume true; {875#true} is VALID [2022-04-27 14:33:27,456 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {875#true} {895#(and (= main_~x~0 0) (= main_~y~0 0))} #51#return; {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:27,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:33:27,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:33:27,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:33:27,459 INFO L272 TraceCheckUtils]: 16: Hoare triple {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:33:27,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:33:27,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {876#false} is VALID [2022-04-27 14:33:27,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {876#false} assume !false; {876#false} is VALID [2022-04-27 14:33:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:33:27,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:33:27,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {876#false} assume !false; {876#false} is VALID [2022-04-27 14:33:27,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {876#false} is VALID [2022-04-27 14:33:27,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:33:27,613 INFO L272 TraceCheckUtils]: 16: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:33:27,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:33:27,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:33:27,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:33:27,888 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {875#true} {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #51#return; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:33:27,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {875#true} assume true; {875#true} is VALID [2022-04-27 14:33:27,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {875#true} assume !(0 == ~cond); {875#true} is VALID [2022-04-27 14:33:27,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {875#true} ~cond := #in~cond; {875#true} is VALID [2022-04-27 14:33:27,888 INFO L272 TraceCheckUtils]: 8: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {875#true} is VALID [2022-04-27 14:33:27,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:33:27,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:33:27,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {875#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:33:27,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {875#true} call #t~ret6 := main(); {875#true} is VALID [2022-04-27 14:33:27,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {875#true} {875#true} #57#return; {875#true} is VALID [2022-04-27 14:33:27,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {875#true} assume true; {875#true} is VALID [2022-04-27 14:33:27,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {875#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {875#true} is VALID [2022-04-27 14:33:27,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {875#true} call ULTIMATE.init(); {875#true} is VALID [2022-04-27 14:33:27,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 14:33:27,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:33:27,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978977812] [2022-04-27 14:33:27,893 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:33:27,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996345269] [2022-04-27 14:33:27,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996345269] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:33:27,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:33:27,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:33:27,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951113501] [2022-04-27 14:33:27,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:33:27,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 14:33:27,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:33:27,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:33:28,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:33:28,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:33:28,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:33:28,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:33:28,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:33:28,381 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:33:28,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:28,484 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-04-27 14:33:28,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:33:28,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 14:33:28,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:33:28,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:33:28,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-27 14:33:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:33:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-27 14:33:28,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-27 14:33:28,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:33:28,975 INFO L225 Difference]: With dead ends: 62 [2022-04-27 14:33:28,975 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 14:33:28,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 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:33:28,976 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:33:28,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:33:28,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 14:33:29,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2022-04-27 14:33:29,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:33:29,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:29,008 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:29,008 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:29,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:29,012 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-04-27 14:33:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-27 14:33:29,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:29,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:29,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-04-27 14:33:29,015 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-04-27 14:33:29,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:29,018 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-04-27 14:33:29,018 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-27 14:33:29,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:29,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:29,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:33:29,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:33:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-04-27 14:33:29,020 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 20 [2022-04-27 14:33:29,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:33:29,020 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-04-27 14:33:29,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:33:29,020 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-04-27 14:33:29,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 14:33:29,021 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:33:29,021 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:33:29,043 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:33:29,243 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:33:29,243 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:33:29,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:33:29,244 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 1 times [2022-04-27 14:33:29,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:33:29,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108583176] [2022-04-27 14:33:29,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:29,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:33:29,263 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:33:29,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [594032824] [2022-04-27 14:33:29,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:29,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:33:29,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:33:29,265 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:33:29,270 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:33:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:29,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 14:33:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:29,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:33:29,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {1257#true} call ULTIMATE.init(); {1257#true} is VALID [2022-04-27 14:33:29,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {1257#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1257#true} is VALID [2022-04-27 14:33:29,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {1257#true} assume true; {1257#true} is VALID [2022-04-27 14:33:29,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1257#true} {1257#true} #57#return; {1257#true} is VALID [2022-04-27 14:33:29,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {1257#true} call #t~ret6 := main(); {1257#true} is VALID [2022-04-27 14:33:29,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {1257#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:29,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:29,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:29,692 INFO L272 TraceCheckUtils]: 8: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1257#true} is VALID [2022-04-27 14:33:29,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {1257#true} ~cond := #in~cond; {1257#true} is VALID [2022-04-27 14:33:29,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {1257#true} assume !(0 == ~cond); {1257#true} is VALID [2022-04-27 14:33:29,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {1257#true} assume true; {1257#true} is VALID [2022-04-27 14:33:29,693 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1257#true} {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #51#return; {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:29,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:33:29,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:33:29,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:33:29,694 INFO L272 TraceCheckUtils]: 16: Hoare triple {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1257#true} is VALID [2022-04-27 14:33:29,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {1257#true} ~cond := #in~cond; {1315#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:33:29,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {1315#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:33:29,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:33:29,696 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} #51#return; {1326#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:33:29,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {1326#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1330#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:33:29,698 INFO L272 TraceCheckUtils]: 22: Hoare triple {1330#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1334#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:33:29,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {1334#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1338#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:33:29,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {1338#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1258#false} is VALID [2022-04-27 14:33:29,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {1258#false} assume !false; {1258#false} is VALID [2022-04-27 14:33:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 14:33:29,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:33:54,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:33:54,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108583176] [2022-04-27 14:33:54,784 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:33:54,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594032824] [2022-04-27 14:33:54,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594032824] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:33:54,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:33:54,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:33:54,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585962434] [2022-04-27 14:33:54,785 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:33:54,785 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-27 14:33:54,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:33:54,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:54,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:33:54,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:33:54,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:33:54,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:33:54,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:33:54,813 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:55,161 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-04-27 14:33:55,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:33:55,162 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-27 14:33:55,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:33:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-27 14:33:55,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:55,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-27 14:33:55,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2022-04-27 14:33:55,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:33:55,196 INFO L225 Difference]: With dead ends: 50 [2022-04-27 14:33:55,196 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 14:33:55,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:33:55,197 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:33:55,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 112 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:33:55,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 14:33:55,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 14:33:55,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:33:55,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:55,223 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:55,224 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:55,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:55,226 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-27 14:33:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-27 14:33:55,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:55,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:55,226 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 14:33:55,226 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 14:33:55,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:55,230 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-27 14:33:55,231 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-27 14:33:55,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:55,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:55,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:33:55,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:33:55,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-04-27 14:33:55,235 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 26 [2022-04-27 14:33:55,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:33:55,235 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-04-27 14:33:55,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:55,235 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-27 14:33:55,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 14:33:55,236 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:33:55,236 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:33:55,264 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:33:55,458 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:33:55,458 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:33:55,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:33:55,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1036651181, now seen corresponding path program 2 times [2022-04-27 14:33:55,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:33:55,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558259255] [2022-04-27 14:33:55,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:55,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:33:55,470 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:33:55,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1133421535] [2022-04-27 14:33:55,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:33:55,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:33:55,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:33:55,472 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:33:55,473 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:33:55,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:33:55,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:33:55,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 14:33:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:55,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:33:55,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1622#true} is VALID [2022-04-27 14:33:55,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {1622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1622#true} is VALID [2022-04-27 14:33:55,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-27 14:33:55,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1622#true} {1622#true} #57#return; {1622#true} is VALID [2022-04-27 14:33:55,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {1622#true} call #t~ret6 := main(); {1622#true} is VALID [2022-04-27 14:33:55,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {1622#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:55,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:55,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:55,850 INFO L272 TraceCheckUtils]: 8: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1622#true} is VALID [2022-04-27 14:33:55,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-27 14:33:55,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-27 14:33:55,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-27 14:33:55,851 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1622#true} {1642#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:55,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:33:55,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:33:55,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:33:55,852 INFO L272 TraceCheckUtils]: 16: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1622#true} is VALID [2022-04-27 14:33:55,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-27 14:33:55,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-27 14:33:55,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-27 14:33:55,853 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1622#true} {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #51#return; {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:33:55,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:33:55,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:33:55,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:33:55,855 INFO L272 TraceCheckUtils]: 24: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1622#true} is VALID [2022-04-27 14:33:55,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-27 14:33:55,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-27 14:33:55,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-27 14:33:55,856 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1622#true} {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #51#return; {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:33:55,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1717#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-27 14:33:55,857 INFO L272 TraceCheckUtils]: 30: Hoare triple {1717#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1721#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:33:55,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {1721#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1725#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:33:55,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {1725#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1623#false} is VALID [2022-04-27 14:33:55,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2022-04-27 14:33:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:33:55,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:33:56,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:33:56,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558259255] [2022-04-27 14:33:56,225 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:33:56,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133421535] [2022-04-27 14:33:56,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133421535] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:33:56,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:33:56,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 14:33:56,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439295628] [2022-04-27 14:33:56,225 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:33:56,226 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-27 14:33:56,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:33:56,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:33:56,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:33:56,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:33:56,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:33:56,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:33:56,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:33:56,250 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:33:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:56,502 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-27 14:33:56,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:33:56,502 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-27 14:33:56,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:33:56,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:33:56,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 14:33:56,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:33:56,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 14:33:56,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-27 14:33:56,538 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:33:56,539 INFO L225 Difference]: With dead ends: 50 [2022-04-27 14:33:56,539 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 14:33:56,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:33:56,540 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:33:56,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 132 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:33:56,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 14:33:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 14:33:56,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:33:56,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:56,566 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:56,567 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:56,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:56,568 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-27 14:33:56,568 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-27 14:33:56,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:56,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:56,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 14:33:56,569 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 14:33:56,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:56,570 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-27 14:33:56,570 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-27 14:33:56,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:56,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:56,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:33:56,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:33:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:56,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-04-27 14:33:56,572 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 34 [2022-04-27 14:33:56,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:33:56,575 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-04-27 14:33:56,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:33:56,575 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-27 14:33:56,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 14:33:56,577 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:33:56,577 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:33:56,603 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:33:56,799 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:33:56,800 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:33:56,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:33:56,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1383171920, now seen corresponding path program 3 times [2022-04-27 14:33:56,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:33:56,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545827267] [2022-04-27 14:33:56,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:56,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:33:56,815 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:33:56,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1525844840] [2022-04-27 14:33:56,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:33:56,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:33:56,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:33:56,820 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:33:56,820 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:33:56,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:33:56,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:33:56,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 14:33:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:56,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:33:57,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {2005#true} call ULTIMATE.init(); {2005#true} is VALID [2022-04-27 14:33:57,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {2005#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2005#true} is VALID [2022-04-27 14:33:57,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:33:57,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2005#true} {2005#true} #57#return; {2005#true} is VALID [2022-04-27 14:33:57,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {2005#true} call #t~ret6 := main(); {2005#true} is VALID [2022-04-27 14:33:57,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {2005#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:57,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:57,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:57,285 INFO L272 TraceCheckUtils]: 8: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2005#true} is VALID [2022-04-27 14:33:57,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-04-27 14:33:57,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-04-27 14:33:57,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:33:57,286 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2005#true} {2025#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:57,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:33:57,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:33:57,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:33:57,288 INFO L272 TraceCheckUtils]: 16: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2005#true} is VALID [2022-04-27 14:33:57,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-04-27 14:33:57,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-04-27 14:33:57,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:33:57,289 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2005#true} {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #51#return; {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:33:57,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:33:57,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:33:57,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:33:57,296 INFO L272 TraceCheckUtils]: 24: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2005#true} is VALID [2022-04-27 14:33:57,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-04-27 14:33:57,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-04-27 14:33:57,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:33:57,297 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2005#true} {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #51#return; {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:33:57,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:33:57,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:33:57,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:33:57,298 INFO L272 TraceCheckUtils]: 32: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2005#true} is VALID [2022-04-27 14:33:57,299 INFO L290 TraceCheckUtils]: 33: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-04-27 14:33:57,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-04-27 14:33:57,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:33:57,299 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2005#true} {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #51#return; {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:33:57,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {2125#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:33:57,300 INFO L272 TraceCheckUtils]: 38: Hoare triple {2125#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2129#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:33:57,301 INFO L290 TraceCheckUtils]: 39: Hoare triple {2129#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2133#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:33:57,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {2133#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2006#false} is VALID [2022-04-27 14:33:57,301 INFO L290 TraceCheckUtils]: 41: Hoare triple {2006#false} assume !false; {2006#false} is VALID [2022-04-27 14:33:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:33:57,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:33:57,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:33:57,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545827267] [2022-04-27 14:33:57,614 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:33:57,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525844840] [2022-04-27 14:33:57,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525844840] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:33:57,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:33:57,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 14:33:57,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080625695] [2022-04-27 14:33:57,614 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:33:57,614 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-04-27 14:33:57,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:33:57,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:57,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:33:57,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 14:33:57,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:33:57,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 14:33:57,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:33:57,641 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:57,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:57,968 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-27 14:33:57,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:33:57,968 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-04-27 14:33:57,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:33:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-27 14:33:57,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-27 14:33:57,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-27 14:33:58,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:33:58,007 INFO L225 Difference]: With dead ends: 52 [2022-04-27 14:33:58,007 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 14:33:58,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:33:58,008 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:33:58,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 168 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:33:58,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 14:33:58,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-27 14:33:58,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:33:58,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:33:58,041 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:33:58,042 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:33:58,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:58,043 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-27 14:33:58,044 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-27 14:33:58,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:58,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:58,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-27 14:33:58,044 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-27 14:33:58,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:58,046 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-27 14:33:58,046 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-27 14:33:58,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:58,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:58,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:33:58,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:33:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:33:58,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-27 14:33:58,052 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42 [2022-04-27 14:33:58,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:33:58,052 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-27 14:33:58,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:58,053 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-27 14:33:58,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 14:33:58,054 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:33:58,054 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:33:58,080 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:33:58,267 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:33:58,267 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:33:58,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:33:58,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1386691371, now seen corresponding path program 2 times [2022-04-27 14:33:58,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:33:58,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789743331] [2022-04-27 14:33:58,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:58,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:33:58,279 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:33:58,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1296877216] [2022-04-27 14:33:58,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:33:58,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:33:58,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:33:58,288 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:33:58,296 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:33:58,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:33:58,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:33:58,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 14:33:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:58,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:33:58,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {2423#true} call ULTIMATE.init(); {2423#true} is VALID [2022-04-27 14:33:58,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {2423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:58,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {2431#(<= ~counter~0 0)} assume true; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:58,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2431#(<= ~counter~0 0)} {2423#true} #57#return; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:58,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {2431#(<= ~counter~0 0)} call #t~ret6 := main(); {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:58,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {2431#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:58,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {2431#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:58,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {2447#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:58,621 INFO L272 TraceCheckUtils]: 8: Hoare triple {2447#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:58,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {2447#(<= ~counter~0 1)} ~cond := #in~cond; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:58,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {2447#(<= ~counter~0 1)} assume !(0 == ~cond); {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:58,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {2447#(<= ~counter~0 1)} assume true; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:58,623 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2447#(<= ~counter~0 1)} {2447#(<= ~counter~0 1)} #51#return; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:58,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {2447#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:58,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {2447#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:33:58,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {2472#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:33:58,625 INFO L272 TraceCheckUtils]: 16: Hoare triple {2472#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:33:58,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {2472#(<= ~counter~0 2)} ~cond := #in~cond; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:33:58,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {2472#(<= ~counter~0 2)} assume !(0 == ~cond); {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:33:58,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {2472#(<= ~counter~0 2)} assume true; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:33:58,631 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2472#(<= ~counter~0 2)} {2472#(<= ~counter~0 2)} #51#return; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:33:58,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {2472#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:33:58,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {2472#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:33:58,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {2497#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:33:58,633 INFO L272 TraceCheckUtils]: 24: Hoare triple {2497#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:33:58,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {2497#(<= ~counter~0 3)} ~cond := #in~cond; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:33:58,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {2497#(<= ~counter~0 3)} assume !(0 == ~cond); {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:33:58,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {2497#(<= ~counter~0 3)} assume true; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:33:58,635 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2497#(<= ~counter~0 3)} {2497#(<= ~counter~0 3)} #51#return; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:33:58,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {2497#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:33:58,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {2497#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:33:58,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {2522#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:33:58,637 INFO L272 TraceCheckUtils]: 32: Hoare triple {2522#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:33:58,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {2522#(<= ~counter~0 4)} ~cond := #in~cond; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:33:58,638 INFO L290 TraceCheckUtils]: 34: Hoare triple {2522#(<= ~counter~0 4)} assume !(0 == ~cond); {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:33:58,638 INFO L290 TraceCheckUtils]: 35: Hoare triple {2522#(<= ~counter~0 4)} assume true; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:33:58,638 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2522#(<= ~counter~0 4)} {2522#(<= ~counter~0 4)} #51#return; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:33:58,639 INFO L290 TraceCheckUtils]: 37: Hoare triple {2522#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:33:58,639 INFO L290 TraceCheckUtils]: 38: Hoare triple {2522#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2547#(<= |main_#t~post5| 4)} is VALID [2022-04-27 14:33:58,640 INFO L290 TraceCheckUtils]: 39: Hoare triple {2547#(<= |main_#t~post5| 4)} assume !(#t~post5 < 100);havoc #t~post5; {2424#false} is VALID [2022-04-27 14:33:58,640 INFO L272 TraceCheckUtils]: 40: Hoare triple {2424#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2424#false} is VALID [2022-04-27 14:33:58,640 INFO L290 TraceCheckUtils]: 41: Hoare triple {2424#false} ~cond := #in~cond; {2424#false} is VALID [2022-04-27 14:33:58,640 INFO L290 TraceCheckUtils]: 42: Hoare triple {2424#false} assume 0 == ~cond; {2424#false} is VALID [2022-04-27 14:33:58,640 INFO L290 TraceCheckUtils]: 43: Hoare triple {2424#false} assume !false; {2424#false} is VALID [2022-04-27 14:33:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:33:58,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:33:58,928 INFO L290 TraceCheckUtils]: 43: Hoare triple {2424#false} assume !false; {2424#false} is VALID [2022-04-27 14:33:58,928 INFO L290 TraceCheckUtils]: 42: Hoare triple {2424#false} assume 0 == ~cond; {2424#false} is VALID [2022-04-27 14:33:58,928 INFO L290 TraceCheckUtils]: 41: Hoare triple {2424#false} ~cond := #in~cond; {2424#false} is VALID [2022-04-27 14:33:58,929 INFO L272 TraceCheckUtils]: 40: Hoare triple {2424#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2424#false} is VALID [2022-04-27 14:33:58,929 INFO L290 TraceCheckUtils]: 39: Hoare triple {2575#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {2424#false} is VALID [2022-04-27 14:33:58,929 INFO L290 TraceCheckUtils]: 38: Hoare triple {2579#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2575#(< |main_#t~post5| 100)} is VALID [2022-04-27 14:33:58,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {2579#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2579#(< ~counter~0 100)} is VALID [2022-04-27 14:33:58,930 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2423#true} {2579#(< ~counter~0 100)} #51#return; {2579#(< ~counter~0 100)} is VALID [2022-04-27 14:33:58,930 INFO L290 TraceCheckUtils]: 35: Hoare triple {2423#true} assume true; {2423#true} is VALID [2022-04-27 14:33:58,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {2423#true} assume !(0 == ~cond); {2423#true} is VALID [2022-04-27 14:33:58,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {2423#true} ~cond := #in~cond; {2423#true} is VALID [2022-04-27 14:33:58,930 INFO L272 TraceCheckUtils]: 32: Hoare triple {2579#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2423#true} is VALID [2022-04-27 14:33:58,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {2579#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {2579#(< ~counter~0 100)} is VALID [2022-04-27 14:33:58,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {2604#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2579#(< ~counter~0 100)} is VALID [2022-04-27 14:33:58,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {2604#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2604#(< ~counter~0 99)} is VALID [2022-04-27 14:33:58,932 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2423#true} {2604#(< ~counter~0 99)} #51#return; {2604#(< ~counter~0 99)} is VALID [2022-04-27 14:33:58,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {2423#true} assume true; {2423#true} is VALID [2022-04-27 14:33:58,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {2423#true} assume !(0 == ~cond); {2423#true} is VALID [2022-04-27 14:33:58,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {2423#true} ~cond := #in~cond; {2423#true} is VALID [2022-04-27 14:33:58,933 INFO L272 TraceCheckUtils]: 24: Hoare triple {2604#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2423#true} is VALID [2022-04-27 14:33:58,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {2604#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {2604#(< ~counter~0 99)} is VALID [2022-04-27 14:33:58,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {2629#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2604#(< ~counter~0 99)} is VALID [2022-04-27 14:33:58,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {2629#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2629#(< ~counter~0 98)} is VALID [2022-04-27 14:33:58,935 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2423#true} {2629#(< ~counter~0 98)} #51#return; {2629#(< ~counter~0 98)} is VALID [2022-04-27 14:33:58,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {2423#true} assume true; {2423#true} is VALID [2022-04-27 14:33:58,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {2423#true} assume !(0 == ~cond); {2423#true} is VALID [2022-04-27 14:33:58,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {2423#true} ~cond := #in~cond; {2423#true} is VALID [2022-04-27 14:33:58,935 INFO L272 TraceCheckUtils]: 16: Hoare triple {2629#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2423#true} is VALID [2022-04-27 14:33:58,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {2629#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {2629#(< ~counter~0 98)} is VALID [2022-04-27 14:33:58,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {2654#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2629#(< ~counter~0 98)} is VALID [2022-04-27 14:33:58,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {2654#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2654#(< ~counter~0 97)} is VALID [2022-04-27 14:33:58,937 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2423#true} {2654#(< ~counter~0 97)} #51#return; {2654#(< ~counter~0 97)} is VALID [2022-04-27 14:33:58,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {2423#true} assume true; {2423#true} is VALID [2022-04-27 14:33:58,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {2423#true} assume !(0 == ~cond); {2423#true} is VALID [2022-04-27 14:33:58,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {2423#true} ~cond := #in~cond; {2423#true} is VALID [2022-04-27 14:33:58,937 INFO L272 TraceCheckUtils]: 8: Hoare triple {2654#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2423#true} is VALID [2022-04-27 14:33:58,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {2654#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {2654#(< ~counter~0 97)} is VALID [2022-04-27 14:33:58,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {2679#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2654#(< ~counter~0 97)} is VALID [2022-04-27 14:33:58,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {2679#(< ~counter~0 96)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2679#(< ~counter~0 96)} is VALID [2022-04-27 14:33:58,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {2679#(< ~counter~0 96)} call #t~ret6 := main(); {2679#(< ~counter~0 96)} is VALID [2022-04-27 14:33:58,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2679#(< ~counter~0 96)} {2423#true} #57#return; {2679#(< ~counter~0 96)} is VALID [2022-04-27 14:33:58,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {2679#(< ~counter~0 96)} assume true; {2679#(< ~counter~0 96)} is VALID [2022-04-27 14:33:58,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {2423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2679#(< ~counter~0 96)} is VALID [2022-04-27 14:33:58,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {2423#true} call ULTIMATE.init(); {2423#true} is VALID [2022-04-27 14:33:58,940 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:33:58,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:33:58,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789743331] [2022-04-27 14:33:58,941 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:33:58,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296877216] [2022-04-27 14:33:58,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296877216] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:33:58,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:33:58,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 14:33:58,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271861891] [2022-04-27 14:33:58,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:33:58,942 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 44 [2022-04-27 14:33:58,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:33:58,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:33:58,991 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:33:58,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:33:58,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:33:58,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:33:58,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:33:58,992 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:33:59,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:59,456 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2022-04-27 14:33:59,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 14:33:59,457 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 44 [2022-04-27 14:33:59,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:33:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:33:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 123 transitions. [2022-04-27 14:33:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:33:59,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 123 transitions. [2022-04-27 14:33:59,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 123 transitions. [2022-04-27 14:33:59,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:33:59,551 INFO L225 Difference]: With dead ends: 123 [2022-04-27 14:33:59,551 INFO L226 Difference]: Without dead ends: 118 [2022-04-27 14:33:59,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-27 14:33:59,552 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 120 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:33:59,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 148 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:33:59,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-27 14:33:59,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 93. [2022-04-27 14:33:59,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:33:59,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:33:59,600 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:33:59,600 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:33:59,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:59,603 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2022-04-27 14:33:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2022-04-27 14:33:59,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:59,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:59,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 118 states. [2022-04-27 14:33:59,604 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 118 states. [2022-04-27 14:33:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:59,607 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2022-04-27 14:33:59,607 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2022-04-27 14:33:59,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:59,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:59,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:33:59,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:33:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:33:59,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2022-04-27 14:33:59,611 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 44 [2022-04-27 14:33:59,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:33:59,612 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2022-04-27 14:33:59,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:33:59,612 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2022-04-27 14:33:59,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 14:33:59,612 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:33:59,612 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:33:59,639 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:33:59,825 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:33:59,825 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:33:59,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:33:59,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1037185971, now seen corresponding path program 4 times [2022-04-27 14:33:59,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:33:59,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72133121] [2022-04-27 14:33:59,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:59,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:33:59,836 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:33:59,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [888381887] [2022-04-27 14:33:59,837 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:33:59,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:33:59,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:33:59,838 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:33:59,845 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:33:59,924 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:33:59,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:33:59,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 14:33:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:59,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:00,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {3256#true} call ULTIMATE.init(); {3256#true} is VALID [2022-04-27 14:34:00,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {3256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3256#true} is VALID [2022-04-27 14:34:00,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:34:00,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3256#true} {3256#true} #57#return; {3256#true} is VALID [2022-04-27 14:34:00,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {3256#true} call #t~ret6 := main(); {3256#true} is VALID [2022-04-27 14:34:00,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {3256#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:00,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {3276#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:00,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {3276#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {3276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:00,292 INFO L272 TraceCheckUtils]: 8: Hoare triple {3276#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3256#true} is VALID [2022-04-27 14:34:00,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {3256#true} ~cond := #in~cond; {3256#true} is VALID [2022-04-27 14:34:00,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {3256#true} assume !(0 == ~cond); {3256#true} is VALID [2022-04-27 14:34:00,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:34:00,293 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3256#true} {3276#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {3276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:00,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {3276#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:34:00,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:34:00,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:34:00,294 INFO L272 TraceCheckUtils]: 16: Hoare triple {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3256#true} is VALID [2022-04-27 14:34:00,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {3256#true} ~cond := #in~cond; {3256#true} is VALID [2022-04-27 14:34:00,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {3256#true} assume !(0 == ~cond); {3256#true} is VALID [2022-04-27 14:34:00,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:34:00,295 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3256#true} {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #51#return; {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:34:00,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:34:00,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:34:00,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:34:00,296 INFO L272 TraceCheckUtils]: 24: Hoare triple {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3256#true} is VALID [2022-04-27 14:34:00,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {3256#true} ~cond := #in~cond; {3256#true} is VALID [2022-04-27 14:34:00,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {3256#true} assume !(0 == ~cond); {3256#true} is VALID [2022-04-27 14:34:00,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:34:00,297 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3256#true} {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #51#return; {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:34:00,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:34:00,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:34:00,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 100);havoc #t~post5; {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:34:00,298 INFO L272 TraceCheckUtils]: 32: Hoare triple {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3256#true} is VALID [2022-04-27 14:34:00,298 INFO L290 TraceCheckUtils]: 33: Hoare triple {3256#true} ~cond := #in~cond; {3256#true} is VALID [2022-04-27 14:34:00,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {3256#true} assume !(0 == ~cond); {3256#true} is VALID [2022-04-27 14:34:00,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:34:00,299 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3256#true} {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #51#return; {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:34:00,299 INFO L290 TraceCheckUtils]: 37: Hoare triple {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:34:00,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:34:00,300 INFO L290 TraceCheckUtils]: 39: Hoare triple {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:34:00,300 INFO L272 TraceCheckUtils]: 40: Hoare triple {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3256#true} is VALID [2022-04-27 14:34:00,300 INFO L290 TraceCheckUtils]: 41: Hoare triple {3256#true} ~cond := #in~cond; {3256#true} is VALID [2022-04-27 14:34:00,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {3256#true} assume !(0 == ~cond); {3256#true} is VALID [2022-04-27 14:34:00,301 INFO L290 TraceCheckUtils]: 43: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:34:00,301 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3256#true} {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #51#return; {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:34:00,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {3401#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:34:00,302 INFO L272 TraceCheckUtils]: 46: Hoare triple {3401#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3405#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:00,303 INFO L290 TraceCheckUtils]: 47: Hoare triple {3405#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3409#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:00,303 INFO L290 TraceCheckUtils]: 48: Hoare triple {3409#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3257#false} is VALID [2022-04-27 14:34:00,303 INFO L290 TraceCheckUtils]: 49: Hoare triple {3257#false} assume !false; {3257#false} is VALID [2022-04-27 14:34:00,303 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 14:34:00,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:34:00,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:00,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72133121] [2022-04-27 14:34:00,593 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:00,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888381887] [2022-04-27 14:34:00,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888381887] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:34:00,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:34:00,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:34:00,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341105694] [2022-04-27 14:34:00,594 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:34:00,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-04-27 14:34:00,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:00,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:34:00,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:00,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:34:00,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:00,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:34:00,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:34:00,629 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:34:01,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:01,051 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-04-27 14:34:01,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:34:01,051 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-04-27 14:34:01,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:01,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:34:01,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-27 14:34:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:34:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-27 14:34:01,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 49 transitions. [2022-04-27 14:34:01,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:01,104 INFO L225 Difference]: With dead ends: 98 [2022-04-27 14:34:01,104 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 14:34:01,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:34:01,105 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:01,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 208 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:34:01,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 14:34:01,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 14:34:01,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:01,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:01,146 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:01,147 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:01,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:01,149 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-04-27 14:34:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-27 14:34:01,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:01,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:01,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:34:01,149 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:34:01,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:01,151 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-04-27 14:34:01,151 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-27 14:34:01,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:01,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:01,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:01,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:01,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2022-04-27 14:34:01,153 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 50 [2022-04-27 14:34:01,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:01,154 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2022-04-27 14:34:01,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:34:01,154 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-27 14:34:01,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 14:34:01,154 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:01,154 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:01,179 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:34:01,379 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:34:01,379 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:01,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:01,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1795671114, now seen corresponding path program 5 times [2022-04-27 14:34:01,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:01,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075522346] [2022-04-27 14:34:01,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:01,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:01,391 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:01,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [836245690] [2022-04-27 14:34:01,391 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:34:01,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:01,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:01,392 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:34:01,402 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:34:01,574 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 14:34:01,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:34:01,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:34:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:01,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:02,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {3917#true} call ULTIMATE.init(); {3917#true} is VALID [2022-04-27 14:34:02,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {3917#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3917#true} is VALID [2022-04-27 14:34:02,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:34:02,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3917#true} {3917#true} #57#return; {3917#true} is VALID [2022-04-27 14:34:02,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {3917#true} call #t~ret6 := main(); {3917#true} is VALID [2022-04-27 14:34:02,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {3917#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3937#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:02,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {3937#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3937#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:02,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {3937#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {3937#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:02,015 INFO L272 TraceCheckUtils]: 8: Hoare triple {3937#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:34:02,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:34:02,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:34:02,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:34:02,016 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3917#true} {3937#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {3937#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:02,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {3937#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:34:02,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:34:02,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:34:02,018 INFO L272 TraceCheckUtils]: 16: Hoare triple {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:34:02,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:34:02,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:34:02,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:34:02,019 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3917#true} {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #51#return; {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:34:02,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:34:02,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:34:02,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:34:02,020 INFO L272 TraceCheckUtils]: 24: Hoare triple {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:34:02,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:34:02,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:34:02,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:34:02,021 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3917#true} {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #51#return; {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:34:02,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:34:02,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:34:02,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:34:02,023 INFO L272 TraceCheckUtils]: 32: Hoare triple {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:34:02,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:34:02,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:34:02,023 INFO L290 TraceCheckUtils]: 35: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:34:02,024 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3917#true} {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #51#return; {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:34:02,024 INFO L290 TraceCheckUtils]: 37: Hoare triple {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:34:02,025 INFO L290 TraceCheckUtils]: 38: Hoare triple {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:34:02,025 INFO L290 TraceCheckUtils]: 39: Hoare triple {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:34:02,025 INFO L272 TraceCheckUtils]: 40: Hoare triple {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:34:02,025 INFO L290 TraceCheckUtils]: 41: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:34:02,026 INFO L290 TraceCheckUtils]: 42: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:34:02,026 INFO L290 TraceCheckUtils]: 43: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:34:02,026 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3917#true} {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #51#return; {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:34:02,027 INFO L290 TraceCheckUtils]: 45: Hoare triple {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:34:02,027 INFO L290 TraceCheckUtils]: 46: Hoare triple {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:34:02,028 INFO L290 TraceCheckUtils]: 47: Hoare triple {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:34:02,028 INFO L272 TraceCheckUtils]: 48: Hoare triple {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:34:02,028 INFO L290 TraceCheckUtils]: 49: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:34:02,028 INFO L290 TraceCheckUtils]: 50: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:34:02,028 INFO L290 TraceCheckUtils]: 51: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:34:02,028 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3917#true} {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #51#return; {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:34:02,029 INFO L290 TraceCheckUtils]: 53: Hoare triple {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {4087#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:34:02,030 INFO L272 TraceCheckUtils]: 54: Hoare triple {4087#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4091#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:02,030 INFO L290 TraceCheckUtils]: 55: Hoare triple {4091#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4095#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:02,031 INFO L290 TraceCheckUtils]: 56: Hoare triple {4095#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3918#false} is VALID [2022-04-27 14:34:02,031 INFO L290 TraceCheckUtils]: 57: Hoare triple {3918#false} assume !false; {3918#false} is VALID [2022-04-27 14:34:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 14:34:02,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:34:02,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:02,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075522346] [2022-04-27 14:34:02,334 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:02,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836245690] [2022-04-27 14:34:02,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836245690] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:34:02,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:34:02,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 14:34:02,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38636164] [2022-04-27 14:34:02,335 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:34:02,335 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 58 [2022-04-27 14:34:02,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:02,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:34:02,371 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:34:02,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:34:02,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:02,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:34:02,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:34:02,372 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:34:02,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:02,868 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2022-04-27 14:34:02,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 14:34:02,868 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 58 [2022-04-27 14:34:02,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:34:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-27 14:34:02,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:34:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-27 14:34:02,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 54 transitions. [2022-04-27 14:34:02,910 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:34:02,911 INFO L225 Difference]: With dead ends: 98 [2022-04-27 14:34:02,911 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 14:34:02,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:34:02,912 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:02,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 252 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:34:02,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 14:34:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 14:34:02,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:02,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:02,969 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:02,969 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:02,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:02,970 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-27 14:34:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-27 14:34:02,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:02,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:02,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:34:02,971 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:34:02,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:02,973 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-27 14:34:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-27 14:34:02,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:02,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:02,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:02,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2022-04-27 14:34:02,975 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 58 [2022-04-27 14:34:02,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:02,975 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2022-04-27 14:34:02,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:34:02,975 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-27 14:34:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 14:34:02,976 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:02,976 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:02,991 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:34:03,181 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:34:03,181 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:03,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:03,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1180930233, now seen corresponding path program 6 times [2022-04-27 14:34:03,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:03,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765209948] [2022-04-27 14:34:03,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:03,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:03,192 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:03,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [124546035] [2022-04-27 14:34:03,193 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:34:03,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:03,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:03,194 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:34:03,203 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:34:03,526 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 14:34:03,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:34:03,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 14:34:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:03,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:04,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {4603#true} call ULTIMATE.init(); {4603#true} is VALID [2022-04-27 14:34:04,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {4603#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4603#true} is VALID [2022-04-27 14:34:04,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:34:04,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4603#true} {4603#true} #57#return; {4603#true} is VALID [2022-04-27 14:34:04,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {4603#true} call #t~ret6 := main(); {4603#true} is VALID [2022-04-27 14:34:04,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {4603#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {4623#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:04,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {4623#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4623#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:04,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {4623#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {4623#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:04,010 INFO L272 TraceCheckUtils]: 8: Hoare triple {4623#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4603#true} is VALID [2022-04-27 14:34:04,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {4603#true} ~cond := #in~cond; {4603#true} is VALID [2022-04-27 14:34:04,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {4603#true} assume !(0 == ~cond); {4603#true} is VALID [2022-04-27 14:34:04,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:34:04,011 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4603#true} {4623#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {4623#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:04,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {4623#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:34:04,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:34:04,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:34:04,012 INFO L272 TraceCheckUtils]: 16: Hoare triple {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4603#true} is VALID [2022-04-27 14:34:04,013 INFO L290 TraceCheckUtils]: 17: Hoare triple {4603#true} ~cond := #in~cond; {4603#true} is VALID [2022-04-27 14:34:04,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {4603#true} assume !(0 == ~cond); {4603#true} is VALID [2022-04-27 14:34:04,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:34:04,018 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4603#true} {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #51#return; {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:34:04,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4673#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:34:04,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {4673#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4673#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:34:04,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {4673#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {4673#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:34:04,020 INFO L272 TraceCheckUtils]: 24: Hoare triple {4673#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4603#true} is VALID [2022-04-27 14:34:04,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {4603#true} ~cond := #in~cond; {4603#true} is VALID [2022-04-27 14:34:04,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {4603#true} assume !(0 == ~cond); {4603#true} is VALID [2022-04-27 14:34:04,020 INFO L290 TraceCheckUtils]: 27: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:34:04,020 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4603#true} {4673#(and (= main_~y~0 2) (= main_~c~0 2))} #51#return; {4673#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:34:04,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {4673#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4698#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:34:04,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {4698#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4698#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:34:04,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {4698#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {4698#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:34:04,028 INFO L272 TraceCheckUtils]: 32: Hoare triple {4698#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4603#true} is VALID [2022-04-27 14:34:04,028 INFO L290 TraceCheckUtils]: 33: Hoare triple {4603#true} ~cond := #in~cond; {4603#true} is VALID [2022-04-27 14:34:04,028 INFO L290 TraceCheckUtils]: 34: Hoare triple {4603#true} assume !(0 == ~cond); {4603#true} is VALID [2022-04-27 14:34:04,028 INFO L290 TraceCheckUtils]: 35: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:34:04,028 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4603#true} {4698#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #51#return; {4698#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:34:04,029 INFO L290 TraceCheckUtils]: 37: Hoare triple {4698#(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 + ~x~0; {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:34:04,029 INFO L290 TraceCheckUtils]: 38: Hoare triple {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:34:04,029 INFO L290 TraceCheckUtils]: 39: Hoare triple {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(#t~post5 < 100);havoc #t~post5; {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:34:04,029 INFO L272 TraceCheckUtils]: 40: Hoare triple {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4603#true} is VALID [2022-04-27 14:34:04,029 INFO L290 TraceCheckUtils]: 41: Hoare triple {4603#true} ~cond := #in~cond; {4603#true} is VALID [2022-04-27 14:34:04,029 INFO L290 TraceCheckUtils]: 42: Hoare triple {4603#true} assume !(0 == ~cond); {4603#true} is VALID [2022-04-27 14:34:04,029 INFO L290 TraceCheckUtils]: 43: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:34:04,030 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4603#true} {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #51#return; {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:34:04,030 INFO L290 TraceCheckUtils]: 45: Hoare triple {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4748#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-27 14:34:04,031 INFO L290 TraceCheckUtils]: 46: Hoare triple {4748#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4748#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-27 14:34:04,031 INFO L290 TraceCheckUtils]: 47: Hoare triple {4748#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} assume !!(#t~post5 < 100);havoc #t~post5; {4748#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-27 14:34:04,031 INFO L272 TraceCheckUtils]: 48: Hoare triple {4748#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4603#true} is VALID [2022-04-27 14:34:04,031 INFO L290 TraceCheckUtils]: 49: Hoare triple {4603#true} ~cond := #in~cond; {4603#true} is VALID [2022-04-27 14:34:04,031 INFO L290 TraceCheckUtils]: 50: Hoare triple {4603#true} assume !(0 == ~cond); {4603#true} is VALID [2022-04-27 14:34:04,031 INFO L290 TraceCheckUtils]: 51: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:34:04,032 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4603#true} {4748#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} #51#return; {4748#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-27 14:34:04,032 INFO L290 TraceCheckUtils]: 53: Hoare triple {4748#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:34:04,033 INFO L290 TraceCheckUtils]: 54: Hoare triple {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:34:04,033 INFO L290 TraceCheckUtils]: 55: Hoare triple {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 100);havoc #t~post5; {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:34:04,033 INFO L272 TraceCheckUtils]: 56: Hoare triple {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4603#true} is VALID [2022-04-27 14:34:04,033 INFO L290 TraceCheckUtils]: 57: Hoare triple {4603#true} ~cond := #in~cond; {4603#true} is VALID [2022-04-27 14:34:04,033 INFO L290 TraceCheckUtils]: 58: Hoare triple {4603#true} assume !(0 == ~cond); {4603#true} is VALID [2022-04-27 14:34:04,033 INFO L290 TraceCheckUtils]: 59: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:34:04,034 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4603#true} {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} #51#return; {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:34:04,034 INFO L290 TraceCheckUtils]: 61: Hoare triple {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {4798#(and (<= main_~k~0 6) (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0))} is VALID [2022-04-27 14:34:04,035 INFO L272 TraceCheckUtils]: 62: Hoare triple {4798#(and (<= main_~k~0 6) (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4802#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:04,035 INFO L290 TraceCheckUtils]: 63: Hoare triple {4802#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4806#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:04,035 INFO L290 TraceCheckUtils]: 64: Hoare triple {4806#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4604#false} is VALID [2022-04-27 14:34:04,035 INFO L290 TraceCheckUtils]: 65: Hoare triple {4604#false} assume !false; {4604#false} is VALID [2022-04-27 14:34:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 14 proven. 84 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 14:34:04,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:34:04,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:04,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765209948] [2022-04-27 14:34:04,279 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:04,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124546035] [2022-04-27 14:34:04,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124546035] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:34:04,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:34:04,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 14:34:04,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432735778] [2022-04-27 14:34:04,279 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:34:04,280 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 66 [2022-04-27 14:34:04,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:04,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:34:04,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:04,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 14:34:04,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:04,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 14:34:04,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:34:04,314 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:34:04,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:04,911 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2022-04-27 14:34:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:34:04,911 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 66 [2022-04-27 14:34:04,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:34:04,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-27 14:34:04,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:34:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-27 14:34:04,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-04-27 14:34:04,962 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:34:04,963 INFO L225 Difference]: With dead ends: 98 [2022-04-27 14:34:04,963 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 14:34:04,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:34:04,964 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:04,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 300 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:34:04,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 14:34:05,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 14:34:05,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:05,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:05,013 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:05,013 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:05,015 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-04-27 14:34:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-27 14:34:05,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:05,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:05,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:34:05,016 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:34:05,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:05,017 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-04-27 14:34:05,017 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-27 14:34:05,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:05,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:05,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:05,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:05,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:05,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2022-04-27 14:34:05,025 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 66 [2022-04-27 14:34:05,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:05,025 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2022-04-27 14:34:05,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:34:05,025 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-27 14:34:05,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-27 14:34:05,029 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:05,029 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:05,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 14:34:05,229 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:34:05,230 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:05,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:05,230 INFO L85 PathProgramCache]: Analyzing trace with hash -763940164, now seen corresponding path program 7 times [2022-04-27 14:34:05,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:05,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091052713] [2022-04-27 14:34:05,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:05,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:05,255 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:05,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1914797683] [2022-04-27 14:34:05,256 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:34:05,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:05,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:05,257 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:34:05,257 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:34:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:05,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-27 14:34:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:05,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:06,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {5314#true} call ULTIMATE.init(); {5314#true} is VALID [2022-04-27 14:34:06,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {5314#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5314#true} is VALID [2022-04-27 14:34:06,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {5314#true} assume true; {5314#true} is VALID [2022-04-27 14:34:06,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5314#true} {5314#true} #57#return; {5314#true} is VALID [2022-04-27 14:34:06,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {5314#true} call #t~ret6 := main(); {5314#true} is VALID [2022-04-27 14:34:06,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {5314#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {5334#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:06,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {5334#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5334#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:06,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {5334#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {5334#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:06,270 INFO L272 TraceCheckUtils]: 8: Hoare triple {5334#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5314#true} is VALID [2022-04-27 14:34:06,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {5314#true} ~cond := #in~cond; {5314#true} is VALID [2022-04-27 14:34:06,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {5314#true} assume !(0 == ~cond); {5314#true} is VALID [2022-04-27 14:34:06,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {5314#true} assume true; {5314#true} is VALID [2022-04-27 14:34:06,271 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5314#true} {5334#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {5334#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:06,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {5334#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:34:06,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:34:06,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:34:06,272 INFO L272 TraceCheckUtils]: 16: Hoare triple {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5314#true} is VALID [2022-04-27 14:34:06,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {5314#true} ~cond := #in~cond; {5314#true} is VALID [2022-04-27 14:34:06,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {5314#true} assume !(0 == ~cond); {5314#true} is VALID [2022-04-27 14:34:06,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {5314#true} assume true; {5314#true} is VALID [2022-04-27 14:34:06,274 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5314#true} {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #51#return; {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:34:06,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:06,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:06,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:06,275 INFO L272 TraceCheckUtils]: 24: Hoare triple {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5314#true} is VALID [2022-04-27 14:34:06,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {5314#true} ~cond := #in~cond; {5314#true} is VALID [2022-04-27 14:34:06,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {5314#true} assume !(0 == ~cond); {5314#true} is VALID [2022-04-27 14:34:06,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {5314#true} assume true; {5314#true} is VALID [2022-04-27 14:34:06,276 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5314#true} {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} #51#return; {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:06,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:34:06,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:34:06,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:34:06,277 INFO L272 TraceCheckUtils]: 32: Hoare triple {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5314#true} is VALID [2022-04-27 14:34:06,277 INFO L290 TraceCheckUtils]: 33: Hoare triple {5314#true} ~cond := #in~cond; {5314#true} is VALID [2022-04-27 14:34:06,277 INFO L290 TraceCheckUtils]: 34: Hoare triple {5314#true} assume !(0 == ~cond); {5314#true} is VALID [2022-04-27 14:34:06,277 INFO L290 TraceCheckUtils]: 35: Hoare triple {5314#true} assume true; {5314#true} is VALID [2022-04-27 14:34:06,278 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5314#true} {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #51#return; {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:34:06,278 INFO L290 TraceCheckUtils]: 37: Hoare triple {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:06,279 INFO L290 TraceCheckUtils]: 38: Hoare triple {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:06,279 INFO L290 TraceCheckUtils]: 39: Hoare triple {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:06,279 INFO L272 TraceCheckUtils]: 40: Hoare triple {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5314#true} is VALID [2022-04-27 14:34:06,279 INFO L290 TraceCheckUtils]: 41: Hoare triple {5314#true} ~cond := #in~cond; {5314#true} is VALID [2022-04-27 14:34:06,279 INFO L290 TraceCheckUtils]: 42: Hoare triple {5314#true} assume !(0 == ~cond); {5314#true} is VALID [2022-04-27 14:34:06,279 INFO L290 TraceCheckUtils]: 43: Hoare triple {5314#true} assume true; {5314#true} is VALID [2022-04-27 14:34:06,280 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5314#true} {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #51#return; {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:06,280 INFO L290 TraceCheckUtils]: 45: Hoare triple {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:06,280 INFO L290 TraceCheckUtils]: 46: Hoare triple {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:06,281 INFO L290 TraceCheckUtils]: 47: Hoare triple {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:06,281 INFO L272 TraceCheckUtils]: 48: Hoare triple {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5314#true} is VALID [2022-04-27 14:34:06,281 INFO L290 TraceCheckUtils]: 49: Hoare triple {5314#true} ~cond := #in~cond; {5314#true} is VALID [2022-04-27 14:34:06,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {5314#true} assume !(0 == ~cond); {5314#true} is VALID [2022-04-27 14:34:06,281 INFO L290 TraceCheckUtils]: 51: Hoare triple {5314#true} assume true; {5314#true} is VALID [2022-04-27 14:34:06,281 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5314#true} {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} #51#return; {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:06,282 INFO L290 TraceCheckUtils]: 53: Hoare triple {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 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 + ~x~0; {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:06,282 INFO L290 TraceCheckUtils]: 54: Hoare triple {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:06,282 INFO L290 TraceCheckUtils]: 55: Hoare triple {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:06,282 INFO L272 TraceCheckUtils]: 56: Hoare triple {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5314#true} is VALID [2022-04-27 14:34:06,283 INFO L290 TraceCheckUtils]: 57: Hoare triple {5314#true} ~cond := #in~cond; {5314#true} is VALID [2022-04-27 14:34:06,283 INFO L290 TraceCheckUtils]: 58: Hoare triple {5314#true} assume !(0 == ~cond); {5314#true} is VALID [2022-04-27 14:34:06,283 INFO L290 TraceCheckUtils]: 59: Hoare triple {5314#true} assume true; {5314#true} is VALID [2022-04-27 14:34:06,283 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5314#true} {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} #51#return; {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:06,283 INFO L290 TraceCheckUtils]: 61: Hoare triple {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:34:06,284 INFO L290 TraceCheckUtils]: 62: Hoare triple {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:34:06,284 INFO L290 TraceCheckUtils]: 63: Hoare triple {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:34:06,284 INFO L272 TraceCheckUtils]: 64: Hoare triple {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5314#true} is VALID [2022-04-27 14:34:06,284 INFO L290 TraceCheckUtils]: 65: Hoare triple {5314#true} ~cond := #in~cond; {5314#true} is VALID [2022-04-27 14:34:06,284 INFO L290 TraceCheckUtils]: 66: Hoare triple {5314#true} assume !(0 == ~cond); {5314#true} is VALID [2022-04-27 14:34:06,284 INFO L290 TraceCheckUtils]: 67: Hoare triple {5314#true} assume true; {5314#true} is VALID [2022-04-27 14:34:06,285 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5314#true} {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #51#return; {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:34:06,285 INFO L290 TraceCheckUtils]: 69: Hoare triple {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {5534#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:34:06,286 INFO L272 TraceCheckUtils]: 70: Hoare triple {5534#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5538#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:06,286 INFO L290 TraceCheckUtils]: 71: Hoare triple {5538#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5542#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:06,287 INFO L290 TraceCheckUtils]: 72: Hoare triple {5542#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5315#false} is VALID [2022-04-27 14:34:06,287 INFO L290 TraceCheckUtils]: 73: Hoare triple {5315#false} assume !false; {5315#false} is VALID [2022-04-27 14:34:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 16 proven. 112 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 14:34:06,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:34:07,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:07,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091052713] [2022-04-27 14:34:07,390 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:07,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914797683] [2022-04-27 14:34:07,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914797683] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:34:07,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:34:07,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 14:34:07,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655417927] [2022-04-27 14:34:07,390 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:34:07,390 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74 [2022-04-27 14:34:07,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:07,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:34:07,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:07,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 14:34:07,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:07,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 14:34:07,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2022-04-27 14:34:07,432 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:34:08,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:08,222 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2022-04-27 14:34:08,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:34:08,222 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74 [2022-04-27 14:34:08,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:08,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:34:08,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-27 14:34:08,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:34:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-27 14:34:08,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2022-04-27 14:34:08,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:08,271 INFO L225 Difference]: With dead ends: 98 [2022-04-27 14:34:08,271 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 14:34:08,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2022-04-27 14:34:08,272 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:08,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 352 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:34:08,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 14:34:08,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 14:34:08,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:08,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:08,339 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:08,339 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:08,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:08,341 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2022-04-27 14:34:08,341 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-27 14:34:08,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:08,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:08,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:34:08,342 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:34:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:08,344 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2022-04-27 14:34:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-27 14:34:08,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:08,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:08,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:08,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:08,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2022-04-27 14:34:08,348 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 74 [2022-04-27 14:34:08,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:08,348 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2022-04-27 14:34:08,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:34:08,348 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-27 14:34:08,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-27 14:34:08,352 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:08,352 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:08,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 14:34:08,558 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:34:08,558 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:08,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:08,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1500110401, now seen corresponding path program 8 times [2022-04-27 14:34:08,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:08,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792429326] [2022-04-27 14:34:08,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:08,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:08,587 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:08,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [864006974] [2022-04-27 14:34:08,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:34:08,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:08,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:08,590 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:34:08,597 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:34:09,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:34:09,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:34:09,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 14:34:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:09,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:09,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {6200#true} call ULTIMATE.init(); {6200#true} is VALID [2022-04-27 14:34:09,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {6200#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6200#true} is VALID [2022-04-27 14:34:09,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-27 14:34:09,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6200#true} {6200#true} #57#return; {6200#true} is VALID [2022-04-27 14:34:09,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {6200#true} call #t~ret6 := main(); {6200#true} is VALID [2022-04-27 14:34:09,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {6200#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {6220#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:09,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {6220#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6220#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:09,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {6220#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {6220#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:09,636 INFO L272 TraceCheckUtils]: 8: Hoare triple {6220#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6200#true} is VALID [2022-04-27 14:34:09,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {6200#true} ~cond := #in~cond; {6200#true} is VALID [2022-04-27 14:34:09,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {6200#true} assume !(0 == ~cond); {6200#true} is VALID [2022-04-27 14:34:09,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-27 14:34:09,637 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6200#true} {6220#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {6220#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:09,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {6220#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:34:09,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:34:09,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:34:09,638 INFO L272 TraceCheckUtils]: 16: Hoare triple {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6200#true} is VALID [2022-04-27 14:34:09,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {6200#true} ~cond := #in~cond; {6200#true} is VALID [2022-04-27 14:34:09,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {6200#true} assume !(0 == ~cond); {6200#true} is VALID [2022-04-27 14:34:09,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-27 14:34:09,639 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6200#true} {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:34:09,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:34:09,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:34:09,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:34:09,640 INFO L272 TraceCheckUtils]: 24: Hoare triple {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6200#true} is VALID [2022-04-27 14:34:09,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {6200#true} ~cond := #in~cond; {6200#true} is VALID [2022-04-27 14:34:09,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {6200#true} assume !(0 == ~cond); {6200#true} is VALID [2022-04-27 14:34:09,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-27 14:34:09,640 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6200#true} {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #51#return; {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:34:09,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6295#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:34:09,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {6295#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6295#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:34:09,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {6295#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {6295#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:34:09,641 INFO L272 TraceCheckUtils]: 32: Hoare triple {6295#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6200#true} is VALID [2022-04-27 14:34:09,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {6200#true} ~cond := #in~cond; {6200#true} is VALID [2022-04-27 14:34:09,642 INFO L290 TraceCheckUtils]: 34: Hoare triple {6200#true} assume !(0 == ~cond); {6200#true} is VALID [2022-04-27 14:34:09,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-27 14:34:09,642 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6200#true} {6295#(and (= main_~y~0 3) (= main_~c~0 3))} #51#return; {6295#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:34:09,642 INFO L290 TraceCheckUtils]: 37: Hoare triple {6295#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:34:09,643 INFO L290 TraceCheckUtils]: 38: Hoare triple {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:34:09,643 INFO L290 TraceCheckUtils]: 39: Hoare triple {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:34:09,643 INFO L272 TraceCheckUtils]: 40: Hoare triple {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6200#true} is VALID [2022-04-27 14:34:09,643 INFO L290 TraceCheckUtils]: 41: Hoare triple {6200#true} ~cond := #in~cond; {6200#true} is VALID [2022-04-27 14:34:09,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {6200#true} assume !(0 == ~cond); {6200#true} is VALID [2022-04-27 14:34:09,643 INFO L290 TraceCheckUtils]: 43: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-27 14:34:09,644 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6200#true} {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #51#return; {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:34:09,644 INFO L290 TraceCheckUtils]: 45: Hoare triple {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:34:09,644 INFO L290 TraceCheckUtils]: 46: Hoare triple {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:34:09,645 INFO L290 TraceCheckUtils]: 47: Hoare triple {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !!(#t~post5 < 100);havoc #t~post5; {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:34:09,645 INFO L272 TraceCheckUtils]: 48: Hoare triple {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6200#true} is VALID [2022-04-27 14:34:09,645 INFO L290 TraceCheckUtils]: 49: Hoare triple {6200#true} ~cond := #in~cond; {6200#true} is VALID [2022-04-27 14:34:09,645 INFO L290 TraceCheckUtils]: 50: Hoare triple {6200#true} assume !(0 == ~cond); {6200#true} is VALID [2022-04-27 14:34:09,645 INFO L290 TraceCheckUtils]: 51: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-27 14:34:09,645 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6200#true} {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #51#return; {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:34:09,646 INFO L290 TraceCheckUtils]: 53: Hoare triple {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 14:34:09,646 INFO L290 TraceCheckUtils]: 54: Hoare triple {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 14:34:09,647 INFO L290 TraceCheckUtils]: 55: Hoare triple {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} assume !!(#t~post5 < 100);havoc #t~post5; {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 14:34:09,647 INFO L272 TraceCheckUtils]: 56: Hoare triple {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6200#true} is VALID [2022-04-27 14:34:09,647 INFO L290 TraceCheckUtils]: 57: Hoare triple {6200#true} ~cond := #in~cond; {6200#true} is VALID [2022-04-27 14:34:09,647 INFO L290 TraceCheckUtils]: 58: Hoare triple {6200#true} assume !(0 == ~cond); {6200#true} is VALID [2022-04-27 14:34:09,647 INFO L290 TraceCheckUtils]: 59: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-27 14:34:09,647 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6200#true} {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} #51#return; {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 14:34:09,648 INFO L290 TraceCheckUtils]: 61: Hoare triple {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 14:34:09,648 INFO L290 TraceCheckUtils]: 62: Hoare triple {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 14:34:09,648 INFO L290 TraceCheckUtils]: 63: Hoare triple {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} assume !!(#t~post5 < 100);havoc #t~post5; {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 14:34:09,648 INFO L272 TraceCheckUtils]: 64: Hoare triple {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6200#true} is VALID [2022-04-27 14:34:09,648 INFO L290 TraceCheckUtils]: 65: Hoare triple {6200#true} ~cond := #in~cond; {6200#true} is VALID [2022-04-27 14:34:09,649 INFO L290 TraceCheckUtils]: 66: Hoare triple {6200#true} assume !(0 == ~cond); {6200#true} is VALID [2022-04-27 14:34:09,649 INFO L290 TraceCheckUtils]: 67: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-27 14:34:09,650 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6200#true} {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} #51#return; {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 14:34:09,650 INFO L290 TraceCheckUtils]: 69: Hoare triple {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:34:09,650 INFO L290 TraceCheckUtils]: 70: Hoare triple {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:34:09,651 INFO L290 TraceCheckUtils]: 71: Hoare triple {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !!(#t~post5 < 100);havoc #t~post5; {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:34:09,651 INFO L272 TraceCheckUtils]: 72: Hoare triple {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6200#true} is VALID [2022-04-27 14:34:09,651 INFO L290 TraceCheckUtils]: 73: Hoare triple {6200#true} ~cond := #in~cond; {6200#true} is VALID [2022-04-27 14:34:09,651 INFO L290 TraceCheckUtils]: 74: Hoare triple {6200#true} assume !(0 == ~cond); {6200#true} is VALID [2022-04-27 14:34:09,651 INFO L290 TraceCheckUtils]: 75: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-27 14:34:09,654 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {6200#true} {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #51#return; {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:34:09,655 INFO L290 TraceCheckUtils]: 77: Hoare triple {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {6445#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 14:34:09,656 INFO L272 TraceCheckUtils]: 78: Hoare triple {6445#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6449#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:09,656 INFO L290 TraceCheckUtils]: 79: Hoare triple {6449#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6453#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:09,656 INFO L290 TraceCheckUtils]: 80: Hoare triple {6453#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6201#false} is VALID [2022-04-27 14:34:09,656 INFO L290 TraceCheckUtils]: 81: Hoare triple {6201#false} assume !false; {6201#false} is VALID [2022-04-27 14:34:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 18 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-27 14:34:09,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:34:09,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:09,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792429326] [2022-04-27 14:34:09,919 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:09,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864006974] [2022-04-27 14:34:09,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864006974] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:34:09,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:34:09,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 14:34:09,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395366792] [2022-04-27 14:34:09,919 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:34:09,920 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 82 [2022-04-27 14:34:09,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:09,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:34:09,967 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:34:09,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:34:09,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:09,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:34:09,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:34:09,968 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:34:10,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:10,791 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-04-27 14:34:10,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 14:34:10,791 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 82 [2022-04-27 14:34:10,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:10,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:34:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-27 14:34:10,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:34:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-27 14:34:10,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 69 transitions. [2022-04-27 14:34:10,850 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:34:10,851 INFO L225 Difference]: With dead ends: 98 [2022-04-27 14:34:10,852 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 14:34:10,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:34:10,852 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:10,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 408 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:34:10,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 14:34:10,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 14:34:10,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:10,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:10,901 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:10,902 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:10,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:10,903 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-04-27 14:34:10,903 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-27 14:34:10,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:10,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:10,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:34:10,904 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:34:10,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:10,906 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-04-27 14:34:10,906 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-27 14:34:10,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:10,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:10,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:10,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2022-04-27 14:34:10,908 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 82 [2022-04-27 14:34:10,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:10,908 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2022-04-27 14:34:10,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:34:10,909 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-27 14:34:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-27 14:34:10,909 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:10,909 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:10,922 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:34:11,117 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:34:11,118 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:11,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:11,118 INFO L85 PathProgramCache]: Analyzing trace with hash 488857026, now seen corresponding path program 9 times [2022-04-27 14:34:11,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:11,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837509477] [2022-04-27 14:34:11,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:11,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:11,134 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:11,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1326246973] [2022-04-27 14:34:11,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:34:11,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:11,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:11,135 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:34:11,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-27 14:34:11,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-04-27 14:34:11,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:34:11,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-27 14:34:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:11,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:12,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {6961#true} call ULTIMATE.init(); {6961#true} is VALID [2022-04-27 14:34:12,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {6961#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6961#true} is VALID [2022-04-27 14:34:12,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {6961#true} assume true; {6961#true} is VALID [2022-04-27 14:34:12,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6961#true} {6961#true} #57#return; {6961#true} is VALID [2022-04-27 14:34:12,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {6961#true} call #t~ret6 := main(); {6961#true} is VALID [2022-04-27 14:34:12,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {6961#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {6981#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:12,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {6981#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6981#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:12,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {6981#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {6981#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:12,525 INFO L272 TraceCheckUtils]: 8: Hoare triple {6981#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6961#true} is VALID [2022-04-27 14:34:12,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {6961#true} ~cond := #in~cond; {6961#true} is VALID [2022-04-27 14:34:12,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {6961#true} assume !(0 == ~cond); {6961#true} is VALID [2022-04-27 14:34:12,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {6961#true} assume true; {6961#true} is VALID [2022-04-27 14:34:12,531 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6961#true} {6981#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {6981#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:12,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {6981#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:34:12,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:34:12,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 100);havoc #t~post5; {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:34:12,534 INFO L272 TraceCheckUtils]: 16: Hoare triple {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6961#true} is VALID [2022-04-27 14:34:12,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {6961#true} ~cond := #in~cond; {6961#true} is VALID [2022-04-27 14:34:12,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {6961#true} assume !(0 == ~cond); {6961#true} is VALID [2022-04-27 14:34:12,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {6961#true} assume true; {6961#true} is VALID [2022-04-27 14:34:12,542 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6961#true} {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #51#return; {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:34:12,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {7006#(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 + ~x~0; {7031#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:34:12,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {7031#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7031#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:34:12,544 INFO L290 TraceCheckUtils]: 23: Hoare triple {7031#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {7031#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:34:12,544 INFO L272 TraceCheckUtils]: 24: Hoare triple {7031#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6961#true} is VALID [2022-04-27 14:34:12,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {6961#true} ~cond := #in~cond; {6961#true} is VALID [2022-04-27 14:34:12,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {6961#true} assume !(0 == ~cond); {6961#true} is VALID [2022-04-27 14:34:12,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {6961#true} assume true; {6961#true} is VALID [2022-04-27 14:34:12,545 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6961#true} {7031#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #51#return; {7031#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:34:12,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {7031#(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 + ~x~0; {7056#(and (= 2 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:34:12,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {7056#(and (= 2 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7056#(and (= 2 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:34:12,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {7056#(and (= 2 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {7056#(and (= 2 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:34:12,547 INFO L272 TraceCheckUtils]: 32: Hoare triple {7056#(and (= 2 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6961#true} is VALID [2022-04-27 14:34:12,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {6961#true} ~cond := #in~cond; {6961#true} is VALID [2022-04-27 14:34:12,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {6961#true} assume !(0 == ~cond); {6961#true} is VALID [2022-04-27 14:34:12,547 INFO L290 TraceCheckUtils]: 35: Hoare triple {6961#true} assume true; {6961#true} is VALID [2022-04-27 14:34:12,548 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6961#true} {7056#(and (= 2 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} #51#return; {7056#(and (= 2 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:34:12,549 INFO L290 TraceCheckUtils]: 37: Hoare triple {7056#(and (= 2 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7081#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:34:12,549 INFO L290 TraceCheckUtils]: 38: Hoare triple {7081#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7081#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:34:12,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {7081#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {7081#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:34:12,550 INFO L272 TraceCheckUtils]: 40: Hoare triple {7081#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6961#true} is VALID [2022-04-27 14:34:12,550 INFO L290 TraceCheckUtils]: 41: Hoare triple {6961#true} ~cond := #in~cond; {6961#true} is VALID [2022-04-27 14:34:12,550 INFO L290 TraceCheckUtils]: 42: Hoare triple {6961#true} assume !(0 == ~cond); {6961#true} is VALID [2022-04-27 14:34:12,550 INFO L290 TraceCheckUtils]: 43: Hoare triple {6961#true} assume true; {6961#true} is VALID [2022-04-27 14:34:12,551 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6961#true} {7081#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} #51#return; {7081#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:34:12,551 INFO L290 TraceCheckUtils]: 45: Hoare triple {7081#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7106#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:34:12,552 INFO L290 TraceCheckUtils]: 46: Hoare triple {7106#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7106#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:34:12,552 INFO L290 TraceCheckUtils]: 47: Hoare triple {7106#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 100);havoc #t~post5; {7106#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:34:12,552 INFO L272 TraceCheckUtils]: 48: Hoare triple {7106#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6961#true} is VALID [2022-04-27 14:34:12,552 INFO L290 TraceCheckUtils]: 49: Hoare triple {6961#true} ~cond := #in~cond; {6961#true} is VALID [2022-04-27 14:34:12,552 INFO L290 TraceCheckUtils]: 50: Hoare triple {6961#true} assume !(0 == ~cond); {6961#true} is VALID [2022-04-27 14:34:12,552 INFO L290 TraceCheckUtils]: 51: Hoare triple {6961#true} assume true; {6961#true} is VALID [2022-04-27 14:34:12,553 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6961#true} {7106#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} #51#return; {7106#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:34:12,553 INFO L290 TraceCheckUtils]: 53: Hoare triple {7106#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7131#(and (= main_~y~0 6) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-27 14:34:12,553 INFO L290 TraceCheckUtils]: 54: Hoare triple {7131#(and (= main_~y~0 6) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7131#(and (= main_~y~0 6) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-27 14:34:12,554 INFO L290 TraceCheckUtils]: 55: Hoare triple {7131#(and (= main_~y~0 6) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {7131#(and (= main_~y~0 6) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-27 14:34:12,554 INFO L272 TraceCheckUtils]: 56: Hoare triple {7131#(and (= main_~y~0 6) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6961#true} is VALID [2022-04-27 14:34:12,554 INFO L290 TraceCheckUtils]: 57: Hoare triple {6961#true} ~cond := #in~cond; {6961#true} is VALID [2022-04-27 14:34:12,554 INFO L290 TraceCheckUtils]: 58: Hoare triple {6961#true} assume !(0 == ~cond); {6961#true} is VALID [2022-04-27 14:34:12,554 INFO L290 TraceCheckUtils]: 59: Hoare triple {6961#true} assume true; {6961#true} is VALID [2022-04-27 14:34:12,555 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6961#true} {7131#(and (= main_~y~0 6) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0))} #51#return; {7131#(and (= main_~y~0 6) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-27 14:34:12,555 INFO L290 TraceCheckUtils]: 61: Hoare triple {7131#(and (= main_~y~0 6) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0) (< main_~c~0 (+ 7 main_~k~0)))} is VALID [2022-04-27 14:34:12,556 INFO L290 TraceCheckUtils]: 62: Hoare triple {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0) (< main_~c~0 (+ 7 main_~k~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0) (< main_~c~0 (+ 7 main_~k~0)))} is VALID [2022-04-27 14:34:12,556 INFO L290 TraceCheckUtils]: 63: Hoare triple {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0) (< main_~c~0 (+ 7 main_~k~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0) (< main_~c~0 (+ 7 main_~k~0)))} is VALID [2022-04-27 14:34:12,556 INFO L272 TraceCheckUtils]: 64: Hoare triple {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0) (< main_~c~0 (+ 7 main_~k~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6961#true} is VALID [2022-04-27 14:34:12,556 INFO L290 TraceCheckUtils]: 65: Hoare triple {6961#true} ~cond := #in~cond; {6961#true} is VALID [2022-04-27 14:34:12,556 INFO L290 TraceCheckUtils]: 66: Hoare triple {6961#true} assume !(0 == ~cond); {6961#true} is VALID [2022-04-27 14:34:12,556 INFO L290 TraceCheckUtils]: 67: Hoare triple {6961#true} assume true; {6961#true} is VALID [2022-04-27 14:34:12,557 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6961#true} {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0) (< main_~c~0 (+ 7 main_~k~0)))} #51#return; {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0) (< main_~c~0 (+ 7 main_~k~0)))} is VALID [2022-04-27 14:34:12,557 INFO L290 TraceCheckUtils]: 69: Hoare triple {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0) (< main_~c~0 (+ 7 main_~k~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7181#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:12,557 INFO L290 TraceCheckUtils]: 70: Hoare triple {7181#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7181#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:12,558 INFO L290 TraceCheckUtils]: 71: Hoare triple {7181#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {7181#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:12,558 INFO L272 TraceCheckUtils]: 72: Hoare triple {7181#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6961#true} is VALID [2022-04-27 14:34:12,558 INFO L290 TraceCheckUtils]: 73: Hoare triple {6961#true} ~cond := #in~cond; {7194#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:12,558 INFO L290 TraceCheckUtils]: 74: Hoare triple {7194#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:34:12,559 INFO L290 TraceCheckUtils]: 75: Hoare triple {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:34:12,559 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} {7181#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} #51#return; {7205#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} is VALID [2022-04-27 14:34:12,560 INFO L290 TraceCheckUtils]: 77: Hoare triple {7205#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7209#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (<= main_~c~0 9))} is VALID [2022-04-27 14:34:12,561 INFO L290 TraceCheckUtils]: 78: Hoare triple {7209#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (<= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7209#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (<= main_~c~0 9))} is VALID [2022-04-27 14:34:12,561 INFO L290 TraceCheckUtils]: 79: Hoare triple {7209#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (<= main_~c~0 9))} assume !!(#t~post5 < 100);havoc #t~post5; {7209#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (<= main_~c~0 9))} is VALID [2022-04-27 14:34:12,561 INFO L272 TraceCheckUtils]: 80: Hoare triple {7209#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6961#true} is VALID [2022-04-27 14:34:12,562 INFO L290 TraceCheckUtils]: 81: Hoare triple {6961#true} ~cond := #in~cond; {7194#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:12,562 INFO L290 TraceCheckUtils]: 82: Hoare triple {7194#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:34:12,562 INFO L290 TraceCheckUtils]: 83: Hoare triple {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:34:12,563 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} {7209#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (<= main_~c~0 9))} #51#return; {7231#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:34:12,563 INFO L290 TraceCheckUtils]: 85: Hoare triple {7231#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {7235#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-27 14:34:12,564 INFO L272 TraceCheckUtils]: 86: Hoare triple {7235#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7239#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:12,564 INFO L290 TraceCheckUtils]: 87: Hoare triple {7239#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7243#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:12,564 INFO L290 TraceCheckUtils]: 88: Hoare triple {7243#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6962#false} is VALID [2022-04-27 14:34:12,564 INFO L290 TraceCheckUtils]: 89: Hoare triple {6962#false} assume !false; {6962#false} is VALID [2022-04-27 14:34:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 66 proven. 182 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-04-27 14:34:12,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:34:31,002 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (.cse2 (* 13 c_main_~y~0 c_main_~y~0)) (.cse3 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (or (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 c_main_~k~0) (* .cse0 .cse0))) (not (<= (div (+ .cse1 .cse2 4 .cse3) 4) (+ (* c_main_~y~0 c_main_~y~0 c_main_~y~0) c_main_~x~0 1 (* 3 (* c_main_~y~0 c_main_~y~0))))) (not (= 0 (mod (+ .cse1 .cse2 .cse3) 4))) (< (+ c_main_~c~0 1) c_main_~k~0) (not (< c_main_~c~0 c_main_~k~0)))) is different from false [2022-04-27 14:34:35,154 WARN L833 $PredicateComparison]: unable to prove that (or (= (+ (* c_main_~y~0 c_main_~k~0) c_main_~k~0) (+ (* 2 c_main_~y~0) (* c_main_~y~0 c_main_~y~0) 1)) (<= c_main_~k~0 c_main_~c~0) (not (= 0 (mod (+ (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 13 c_main_~y~0 c_main_~y~0) (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4))) (< (+ c_main_~c~0 1) c_main_~k~0)) is different from false [2022-04-27 14:35:43,491 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 c_main_~y~0))) (or (= (+ (* 2 c_main_~y~0) 7 (* .cse0 .cse0)) (+ (* .cse0 c_main_~k~0) c_main_~k~0)) (< (+ c_main_~c~0 4) c_main_~k~0) (not (= (mod (+ (* .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 13) (* .cse0 .cse0 .cse0 6)) 4) 0)) (<= c_main_~k~0 (+ 3 c_main_~c~0)))) is different from false [2022-04-27 14:36:25,754 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 5 c_main_~y~0))) (or (< (+ 6 c_main_~c~0) c_main_~k~0) (= (+ (* .cse0 c_main_~k~0) c_main_~k~0) (+ (* 2 c_main_~y~0) (* .cse0 .cse0) 11)) (not (= (mod (+ (* .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 13) (* 6 .cse0 .cse0 .cse0)) 4) 0)) (<= c_main_~k~0 (+ 5 c_main_~c~0)))) is different from false [2022-04-27 14:37:17,457 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((main_~k~0 Int)) (or (< (+ 9 c_main_~c~0) main_~k~0) (= (+ (* main_~k~0 9) (* main_~k~0 c_main_~y~0)) (+ (* 18 c_main_~y~0) 81 (* c_main_~y~0 c_main_~y~0))) (<= main_~k~0 (+ c_main_~c~0 8)))) (not (= (mod (let ((.cse0 (+ 8 c_main_~y~0))) (+ (* .cse0 .cse0 .cse0 6) (* .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 13))) 4) 0))) is different from false [2022-04-27 14:37:19,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:19,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837509477] [2022-04-27 14:37:19,533 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:19,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326246973] [2022-04-27 14:37:19,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326246973] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:19,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:19,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-27 14:37:19,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939062300] [2022-04-27 14:37:19,533 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:19,534 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 90 [2022-04-27 14:37:19,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:19,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:37:19,590 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:37:19,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 14:37:19,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:19,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 14:37:19,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=623, Unknown=19, NotChecked=280, Total=1056 [2022-04-27 14:37:19,591 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:37:22,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:22,844 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-27 14:37:22,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 14:37:22,844 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 90 [2022-04-27 14:37:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:37:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-04-27 14:37:22,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:37:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-04-27 14:37:22,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 74 transitions. [2022-04-27 14:37:22,922 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:37:22,923 INFO L225 Difference]: With dead ends: 100 [2022-04-27 14:37:22,923 INFO L226 Difference]: Without dead ends: 95 [2022-04-27 14:37:22,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 105.4s TimeCoverageRelationStatistics Valid=155, Invalid=776, Unknown=19, NotChecked=310, Total=1260 [2022-04-27 14:37:22,924 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:22,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 482 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 14:37:22,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-27 14:37:22,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-04-27 14:37:22,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:22,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:37:22,985 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:37:22,985 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:37:22,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:22,987 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2022-04-27 14:37:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-27 14:37:22,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:22,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:22,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 95 states. [2022-04-27 14:37:22,987 INFO L87 Difference]: Start difference. First operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 95 states. [2022-04-27 14:37:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:22,989 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2022-04-27 14:37:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-27 14:37:22,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:22,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:22,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:22,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:22,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:37:22,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2022-04-27 14:37:22,997 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 90 [2022-04-27 14:37:22,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:22,997 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2022-04-27 14:37:22,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:37:22,997 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-27 14:37:22,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-27 14:37:22,998 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:22,998 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:37:23,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-27 14:37:23,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:23,199 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:23,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:23,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1958171289, now seen corresponding path program 3 times [2022-04-27 14:37:23,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:23,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551609086] [2022-04-27 14:37:23,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:23,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:23,212 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:23,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [103574857] [2022-04-27 14:37:23,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:37:23,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:23,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:23,213 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:37:23,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-27 14:37:23,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 14:37:23,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:23,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 14:37:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:23,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:23,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {7966#true} call ULTIMATE.init(); {7966#true} is VALID [2022-04-27 14:37:23,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {7966#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7974#(<= ~counter~0 0)} is VALID [2022-04-27 14:37:23,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {7974#(<= ~counter~0 0)} assume true; {7974#(<= ~counter~0 0)} is VALID [2022-04-27 14:37:23,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7974#(<= ~counter~0 0)} {7966#true} #57#return; {7974#(<= ~counter~0 0)} is VALID [2022-04-27 14:37:23,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {7974#(<= ~counter~0 0)} call #t~ret6 := main(); {7974#(<= ~counter~0 0)} is VALID [2022-04-27 14:37:23,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {7974#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {7974#(<= ~counter~0 0)} is VALID [2022-04-27 14:37:23,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {7974#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7990#(<= ~counter~0 1)} is VALID [2022-04-27 14:37:23,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {7990#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {7990#(<= ~counter~0 1)} is VALID [2022-04-27 14:37:23,817 INFO L272 TraceCheckUtils]: 8: Hoare triple {7990#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7990#(<= ~counter~0 1)} is VALID [2022-04-27 14:37:23,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {7990#(<= ~counter~0 1)} ~cond := #in~cond; {7990#(<= ~counter~0 1)} is VALID [2022-04-27 14:37:23,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {7990#(<= ~counter~0 1)} assume !(0 == ~cond); {7990#(<= ~counter~0 1)} is VALID [2022-04-27 14:37:23,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {7990#(<= ~counter~0 1)} assume true; {7990#(<= ~counter~0 1)} is VALID [2022-04-27 14:37:23,819 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7990#(<= ~counter~0 1)} {7990#(<= ~counter~0 1)} #51#return; {7990#(<= ~counter~0 1)} is VALID [2022-04-27 14:37:23,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {7990#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7990#(<= ~counter~0 1)} is VALID [2022-04-27 14:37:23,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {7990#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8015#(<= ~counter~0 2)} is VALID [2022-04-27 14:37:23,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {8015#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {8015#(<= ~counter~0 2)} is VALID [2022-04-27 14:37:23,821 INFO L272 TraceCheckUtils]: 16: Hoare triple {8015#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8015#(<= ~counter~0 2)} is VALID [2022-04-27 14:37:23,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {8015#(<= ~counter~0 2)} ~cond := #in~cond; {8015#(<= ~counter~0 2)} is VALID [2022-04-27 14:37:23,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {8015#(<= ~counter~0 2)} assume !(0 == ~cond); {8015#(<= ~counter~0 2)} is VALID [2022-04-27 14:37:23,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {8015#(<= ~counter~0 2)} assume true; {8015#(<= ~counter~0 2)} is VALID [2022-04-27 14:37:23,822 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8015#(<= ~counter~0 2)} {8015#(<= ~counter~0 2)} #51#return; {8015#(<= ~counter~0 2)} is VALID [2022-04-27 14:37:23,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {8015#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8015#(<= ~counter~0 2)} is VALID [2022-04-27 14:37:23,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {8015#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8040#(<= ~counter~0 3)} is VALID [2022-04-27 14:37:23,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {8040#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {8040#(<= ~counter~0 3)} is VALID [2022-04-27 14:37:23,824 INFO L272 TraceCheckUtils]: 24: Hoare triple {8040#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8040#(<= ~counter~0 3)} is VALID [2022-04-27 14:37:23,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {8040#(<= ~counter~0 3)} ~cond := #in~cond; {8040#(<= ~counter~0 3)} is VALID [2022-04-27 14:37:23,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {8040#(<= ~counter~0 3)} assume !(0 == ~cond); {8040#(<= ~counter~0 3)} is VALID [2022-04-27 14:37:23,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {8040#(<= ~counter~0 3)} assume true; {8040#(<= ~counter~0 3)} is VALID [2022-04-27 14:37:23,826 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8040#(<= ~counter~0 3)} {8040#(<= ~counter~0 3)} #51#return; {8040#(<= ~counter~0 3)} is VALID [2022-04-27 14:37:23,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {8040#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8040#(<= ~counter~0 3)} is VALID [2022-04-27 14:37:23,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {8040#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8065#(<= ~counter~0 4)} is VALID [2022-04-27 14:37:23,827 INFO L290 TraceCheckUtils]: 31: Hoare triple {8065#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {8065#(<= ~counter~0 4)} is VALID [2022-04-27 14:37:23,828 INFO L272 TraceCheckUtils]: 32: Hoare triple {8065#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8065#(<= ~counter~0 4)} is VALID [2022-04-27 14:37:23,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {8065#(<= ~counter~0 4)} ~cond := #in~cond; {8065#(<= ~counter~0 4)} is VALID [2022-04-27 14:37:23,828 INFO L290 TraceCheckUtils]: 34: Hoare triple {8065#(<= ~counter~0 4)} assume !(0 == ~cond); {8065#(<= ~counter~0 4)} is VALID [2022-04-27 14:37:23,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {8065#(<= ~counter~0 4)} assume true; {8065#(<= ~counter~0 4)} is VALID [2022-04-27 14:37:23,829 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8065#(<= ~counter~0 4)} {8065#(<= ~counter~0 4)} #51#return; {8065#(<= ~counter~0 4)} is VALID [2022-04-27 14:37:23,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {8065#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8065#(<= ~counter~0 4)} is VALID [2022-04-27 14:37:23,830 INFO L290 TraceCheckUtils]: 38: Hoare triple {8065#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8090#(<= ~counter~0 5)} is VALID [2022-04-27 14:37:23,830 INFO L290 TraceCheckUtils]: 39: Hoare triple {8090#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {8090#(<= ~counter~0 5)} is VALID [2022-04-27 14:37:23,831 INFO L272 TraceCheckUtils]: 40: Hoare triple {8090#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8090#(<= ~counter~0 5)} is VALID [2022-04-27 14:37:23,831 INFO L290 TraceCheckUtils]: 41: Hoare triple {8090#(<= ~counter~0 5)} ~cond := #in~cond; {8090#(<= ~counter~0 5)} is VALID [2022-04-27 14:37:23,832 INFO L290 TraceCheckUtils]: 42: Hoare triple {8090#(<= ~counter~0 5)} assume !(0 == ~cond); {8090#(<= ~counter~0 5)} is VALID [2022-04-27 14:37:23,832 INFO L290 TraceCheckUtils]: 43: Hoare triple {8090#(<= ~counter~0 5)} assume true; {8090#(<= ~counter~0 5)} is VALID [2022-04-27 14:37:23,832 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8090#(<= ~counter~0 5)} {8090#(<= ~counter~0 5)} #51#return; {8090#(<= ~counter~0 5)} is VALID [2022-04-27 14:37:23,833 INFO L290 TraceCheckUtils]: 45: Hoare triple {8090#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8090#(<= ~counter~0 5)} is VALID [2022-04-27 14:37:23,833 INFO L290 TraceCheckUtils]: 46: Hoare triple {8090#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8115#(<= ~counter~0 6)} is VALID [2022-04-27 14:37:23,834 INFO L290 TraceCheckUtils]: 47: Hoare triple {8115#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {8115#(<= ~counter~0 6)} is VALID [2022-04-27 14:37:23,834 INFO L272 TraceCheckUtils]: 48: Hoare triple {8115#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8115#(<= ~counter~0 6)} is VALID [2022-04-27 14:37:23,835 INFO L290 TraceCheckUtils]: 49: Hoare triple {8115#(<= ~counter~0 6)} ~cond := #in~cond; {8115#(<= ~counter~0 6)} is VALID [2022-04-27 14:37:23,835 INFO L290 TraceCheckUtils]: 50: Hoare triple {8115#(<= ~counter~0 6)} assume !(0 == ~cond); {8115#(<= ~counter~0 6)} is VALID [2022-04-27 14:37:23,835 INFO L290 TraceCheckUtils]: 51: Hoare triple {8115#(<= ~counter~0 6)} assume true; {8115#(<= ~counter~0 6)} is VALID [2022-04-27 14:37:23,836 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8115#(<= ~counter~0 6)} {8115#(<= ~counter~0 6)} #51#return; {8115#(<= ~counter~0 6)} is VALID [2022-04-27 14:37:23,836 INFO L290 TraceCheckUtils]: 53: Hoare triple {8115#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8115#(<= ~counter~0 6)} is VALID [2022-04-27 14:37:23,837 INFO L290 TraceCheckUtils]: 54: Hoare triple {8115#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8140#(<= ~counter~0 7)} is VALID [2022-04-27 14:37:23,837 INFO L290 TraceCheckUtils]: 55: Hoare triple {8140#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {8140#(<= ~counter~0 7)} is VALID [2022-04-27 14:37:23,838 INFO L272 TraceCheckUtils]: 56: Hoare triple {8140#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8140#(<= ~counter~0 7)} is VALID [2022-04-27 14:37:23,838 INFO L290 TraceCheckUtils]: 57: Hoare triple {8140#(<= ~counter~0 7)} ~cond := #in~cond; {8140#(<= ~counter~0 7)} is VALID [2022-04-27 14:37:23,838 INFO L290 TraceCheckUtils]: 58: Hoare triple {8140#(<= ~counter~0 7)} assume !(0 == ~cond); {8140#(<= ~counter~0 7)} is VALID [2022-04-27 14:37:23,838 INFO L290 TraceCheckUtils]: 59: Hoare triple {8140#(<= ~counter~0 7)} assume true; {8140#(<= ~counter~0 7)} is VALID [2022-04-27 14:37:23,839 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8140#(<= ~counter~0 7)} {8140#(<= ~counter~0 7)} #51#return; {8140#(<= ~counter~0 7)} is VALID [2022-04-27 14:37:23,839 INFO L290 TraceCheckUtils]: 61: Hoare triple {8140#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8140#(<= ~counter~0 7)} is VALID [2022-04-27 14:37:23,840 INFO L290 TraceCheckUtils]: 62: Hoare triple {8140#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8165#(<= ~counter~0 8)} is VALID [2022-04-27 14:37:23,840 INFO L290 TraceCheckUtils]: 63: Hoare triple {8165#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {8165#(<= ~counter~0 8)} is VALID [2022-04-27 14:37:23,841 INFO L272 TraceCheckUtils]: 64: Hoare triple {8165#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8165#(<= ~counter~0 8)} is VALID [2022-04-27 14:37:23,841 INFO L290 TraceCheckUtils]: 65: Hoare triple {8165#(<= ~counter~0 8)} ~cond := #in~cond; {8165#(<= ~counter~0 8)} is VALID [2022-04-27 14:37:23,841 INFO L290 TraceCheckUtils]: 66: Hoare triple {8165#(<= ~counter~0 8)} assume !(0 == ~cond); {8165#(<= ~counter~0 8)} is VALID [2022-04-27 14:37:23,842 INFO L290 TraceCheckUtils]: 67: Hoare triple {8165#(<= ~counter~0 8)} assume true; {8165#(<= ~counter~0 8)} is VALID [2022-04-27 14:37:23,842 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8165#(<= ~counter~0 8)} {8165#(<= ~counter~0 8)} #51#return; {8165#(<= ~counter~0 8)} is VALID [2022-04-27 14:37:23,843 INFO L290 TraceCheckUtils]: 69: Hoare triple {8165#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8165#(<= ~counter~0 8)} is VALID [2022-04-27 14:37:23,843 INFO L290 TraceCheckUtils]: 70: Hoare triple {8165#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8190#(<= ~counter~0 9)} is VALID [2022-04-27 14:37:23,843 INFO L290 TraceCheckUtils]: 71: Hoare triple {8190#(<= ~counter~0 9)} assume !!(#t~post5 < 100);havoc #t~post5; {8190#(<= ~counter~0 9)} is VALID [2022-04-27 14:37:23,844 INFO L272 TraceCheckUtils]: 72: Hoare triple {8190#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8190#(<= ~counter~0 9)} is VALID [2022-04-27 14:37:23,844 INFO L290 TraceCheckUtils]: 73: Hoare triple {8190#(<= ~counter~0 9)} ~cond := #in~cond; {8190#(<= ~counter~0 9)} is VALID [2022-04-27 14:37:23,845 INFO L290 TraceCheckUtils]: 74: Hoare triple {8190#(<= ~counter~0 9)} assume !(0 == ~cond); {8190#(<= ~counter~0 9)} is VALID [2022-04-27 14:37:23,845 INFO L290 TraceCheckUtils]: 75: Hoare triple {8190#(<= ~counter~0 9)} assume true; {8190#(<= ~counter~0 9)} is VALID [2022-04-27 14:37:23,845 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8190#(<= ~counter~0 9)} {8190#(<= ~counter~0 9)} #51#return; {8190#(<= ~counter~0 9)} is VALID [2022-04-27 14:37:23,846 INFO L290 TraceCheckUtils]: 77: Hoare triple {8190#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8190#(<= ~counter~0 9)} is VALID [2022-04-27 14:37:23,846 INFO L290 TraceCheckUtils]: 78: Hoare triple {8190#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8215#(<= ~counter~0 10)} is VALID [2022-04-27 14:37:23,847 INFO L290 TraceCheckUtils]: 79: Hoare triple {8215#(<= ~counter~0 10)} assume !!(#t~post5 < 100);havoc #t~post5; {8215#(<= ~counter~0 10)} is VALID [2022-04-27 14:37:23,847 INFO L272 TraceCheckUtils]: 80: Hoare triple {8215#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8215#(<= ~counter~0 10)} is VALID [2022-04-27 14:37:23,847 INFO L290 TraceCheckUtils]: 81: Hoare triple {8215#(<= ~counter~0 10)} ~cond := #in~cond; {8215#(<= ~counter~0 10)} is VALID [2022-04-27 14:37:23,848 INFO L290 TraceCheckUtils]: 82: Hoare triple {8215#(<= ~counter~0 10)} assume !(0 == ~cond); {8215#(<= ~counter~0 10)} is VALID [2022-04-27 14:37:23,848 INFO L290 TraceCheckUtils]: 83: Hoare triple {8215#(<= ~counter~0 10)} assume true; {8215#(<= ~counter~0 10)} is VALID [2022-04-27 14:37:23,848 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {8215#(<= ~counter~0 10)} {8215#(<= ~counter~0 10)} #51#return; {8215#(<= ~counter~0 10)} is VALID [2022-04-27 14:37:23,849 INFO L290 TraceCheckUtils]: 85: Hoare triple {8215#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8215#(<= ~counter~0 10)} is VALID [2022-04-27 14:37:23,849 INFO L290 TraceCheckUtils]: 86: Hoare triple {8215#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8240#(<= |main_#t~post5| 10)} is VALID [2022-04-27 14:37:23,849 INFO L290 TraceCheckUtils]: 87: Hoare triple {8240#(<= |main_#t~post5| 10)} assume !(#t~post5 < 100);havoc #t~post5; {7967#false} is VALID [2022-04-27 14:37:23,849 INFO L272 TraceCheckUtils]: 88: Hoare triple {7967#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7967#false} is VALID [2022-04-27 14:37:23,849 INFO L290 TraceCheckUtils]: 89: Hoare triple {7967#false} ~cond := #in~cond; {7967#false} is VALID [2022-04-27 14:37:23,849 INFO L290 TraceCheckUtils]: 90: Hoare triple {7967#false} assume 0 == ~cond; {7967#false} is VALID [2022-04-27 14:37:23,849 INFO L290 TraceCheckUtils]: 91: Hoare triple {7967#false} assume !false; {7967#false} is VALID [2022-04-27 14:37:23,850 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:37:23,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:24,421 INFO L290 TraceCheckUtils]: 91: Hoare triple {7967#false} assume !false; {7967#false} is VALID [2022-04-27 14:37:24,422 INFO L290 TraceCheckUtils]: 90: Hoare triple {7967#false} assume 0 == ~cond; {7967#false} is VALID [2022-04-27 14:37:24,422 INFO L290 TraceCheckUtils]: 89: Hoare triple {7967#false} ~cond := #in~cond; {7967#false} is VALID [2022-04-27 14:37:24,422 INFO L272 TraceCheckUtils]: 88: Hoare triple {7967#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7967#false} is VALID [2022-04-27 14:37:24,423 INFO L290 TraceCheckUtils]: 87: Hoare triple {8268#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {7967#false} is VALID [2022-04-27 14:37:24,423 INFO L290 TraceCheckUtils]: 86: Hoare triple {8272#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8268#(< |main_#t~post5| 100)} is VALID [2022-04-27 14:37:24,423 INFO L290 TraceCheckUtils]: 85: Hoare triple {8272#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8272#(< ~counter~0 100)} is VALID [2022-04-27 14:37:24,424 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {7966#true} {8272#(< ~counter~0 100)} #51#return; {8272#(< ~counter~0 100)} is VALID [2022-04-27 14:37:24,424 INFO L290 TraceCheckUtils]: 83: Hoare triple {7966#true} assume true; {7966#true} is VALID [2022-04-27 14:37:24,424 INFO L290 TraceCheckUtils]: 82: Hoare triple {7966#true} assume !(0 == ~cond); {7966#true} is VALID [2022-04-27 14:37:24,424 INFO L290 TraceCheckUtils]: 81: Hoare triple {7966#true} ~cond := #in~cond; {7966#true} is VALID [2022-04-27 14:37:24,424 INFO L272 TraceCheckUtils]: 80: Hoare triple {8272#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7966#true} is VALID [2022-04-27 14:37:24,431 INFO L290 TraceCheckUtils]: 79: Hoare triple {8272#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {8272#(< ~counter~0 100)} is VALID [2022-04-27 14:37:24,433 INFO L290 TraceCheckUtils]: 78: Hoare triple {8297#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8272#(< ~counter~0 100)} is VALID [2022-04-27 14:37:24,433 INFO L290 TraceCheckUtils]: 77: Hoare triple {8297#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8297#(< ~counter~0 99)} is VALID [2022-04-27 14:37:24,434 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7966#true} {8297#(< ~counter~0 99)} #51#return; {8297#(< ~counter~0 99)} is VALID [2022-04-27 14:37:24,434 INFO L290 TraceCheckUtils]: 75: Hoare triple {7966#true} assume true; {7966#true} is VALID [2022-04-27 14:37:24,434 INFO L290 TraceCheckUtils]: 74: Hoare triple {7966#true} assume !(0 == ~cond); {7966#true} is VALID [2022-04-27 14:37:24,434 INFO L290 TraceCheckUtils]: 73: Hoare triple {7966#true} ~cond := #in~cond; {7966#true} is VALID [2022-04-27 14:37:24,434 INFO L272 TraceCheckUtils]: 72: Hoare triple {8297#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7966#true} is VALID [2022-04-27 14:37:24,435 INFO L290 TraceCheckUtils]: 71: Hoare triple {8297#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {8297#(< ~counter~0 99)} is VALID [2022-04-27 14:37:24,436 INFO L290 TraceCheckUtils]: 70: Hoare triple {8322#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8297#(< ~counter~0 99)} is VALID [2022-04-27 14:37:24,436 INFO L290 TraceCheckUtils]: 69: Hoare triple {8322#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8322#(< ~counter~0 98)} is VALID [2022-04-27 14:37:24,437 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7966#true} {8322#(< ~counter~0 98)} #51#return; {8322#(< ~counter~0 98)} is VALID [2022-04-27 14:37:24,437 INFO L290 TraceCheckUtils]: 67: Hoare triple {7966#true} assume true; {7966#true} is VALID [2022-04-27 14:37:24,437 INFO L290 TraceCheckUtils]: 66: Hoare triple {7966#true} assume !(0 == ~cond); {7966#true} is VALID [2022-04-27 14:37:24,437 INFO L290 TraceCheckUtils]: 65: Hoare triple {7966#true} ~cond := #in~cond; {7966#true} is VALID [2022-04-27 14:37:24,437 INFO L272 TraceCheckUtils]: 64: Hoare triple {8322#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7966#true} is VALID [2022-04-27 14:37:24,438 INFO L290 TraceCheckUtils]: 63: Hoare triple {8322#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {8322#(< ~counter~0 98)} is VALID [2022-04-27 14:37:24,438 INFO L290 TraceCheckUtils]: 62: Hoare triple {8347#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8322#(< ~counter~0 98)} is VALID [2022-04-27 14:37:24,439 INFO L290 TraceCheckUtils]: 61: Hoare triple {8347#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8347#(< ~counter~0 97)} is VALID [2022-04-27 14:37:24,439 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7966#true} {8347#(< ~counter~0 97)} #51#return; {8347#(< ~counter~0 97)} is VALID [2022-04-27 14:37:24,439 INFO L290 TraceCheckUtils]: 59: Hoare triple {7966#true} assume true; {7966#true} is VALID [2022-04-27 14:37:24,440 INFO L290 TraceCheckUtils]: 58: Hoare triple {7966#true} assume !(0 == ~cond); {7966#true} is VALID [2022-04-27 14:37:24,440 INFO L290 TraceCheckUtils]: 57: Hoare triple {7966#true} ~cond := #in~cond; {7966#true} is VALID [2022-04-27 14:37:24,440 INFO L272 TraceCheckUtils]: 56: Hoare triple {8347#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7966#true} is VALID [2022-04-27 14:37:24,440 INFO L290 TraceCheckUtils]: 55: Hoare triple {8347#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {8347#(< ~counter~0 97)} is VALID [2022-04-27 14:37:24,441 INFO L290 TraceCheckUtils]: 54: Hoare triple {8372#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8347#(< ~counter~0 97)} is VALID [2022-04-27 14:37:24,441 INFO L290 TraceCheckUtils]: 53: Hoare triple {8372#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8372#(< ~counter~0 96)} is VALID [2022-04-27 14:37:24,442 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7966#true} {8372#(< ~counter~0 96)} #51#return; {8372#(< ~counter~0 96)} is VALID [2022-04-27 14:37:24,442 INFO L290 TraceCheckUtils]: 51: Hoare triple {7966#true} assume true; {7966#true} is VALID [2022-04-27 14:37:24,442 INFO L290 TraceCheckUtils]: 50: Hoare triple {7966#true} assume !(0 == ~cond); {7966#true} is VALID [2022-04-27 14:37:24,442 INFO L290 TraceCheckUtils]: 49: Hoare triple {7966#true} ~cond := #in~cond; {7966#true} is VALID [2022-04-27 14:37:24,442 INFO L272 TraceCheckUtils]: 48: Hoare triple {8372#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7966#true} is VALID [2022-04-27 14:37:24,442 INFO L290 TraceCheckUtils]: 47: Hoare triple {8372#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {8372#(< ~counter~0 96)} is VALID [2022-04-27 14:37:24,443 INFO L290 TraceCheckUtils]: 46: Hoare triple {8397#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8372#(< ~counter~0 96)} is VALID [2022-04-27 14:37:24,443 INFO L290 TraceCheckUtils]: 45: Hoare triple {8397#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8397#(< ~counter~0 95)} is VALID [2022-04-27 14:37:24,444 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7966#true} {8397#(< ~counter~0 95)} #51#return; {8397#(< ~counter~0 95)} is VALID [2022-04-27 14:37:24,444 INFO L290 TraceCheckUtils]: 43: Hoare triple {7966#true} assume true; {7966#true} is VALID [2022-04-27 14:37:24,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {7966#true} assume !(0 == ~cond); {7966#true} is VALID [2022-04-27 14:37:24,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {7966#true} ~cond := #in~cond; {7966#true} is VALID [2022-04-27 14:37:24,444 INFO L272 TraceCheckUtils]: 40: Hoare triple {8397#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7966#true} is VALID [2022-04-27 14:37:24,444 INFO L290 TraceCheckUtils]: 39: Hoare triple {8397#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {8397#(< ~counter~0 95)} is VALID [2022-04-27 14:37:24,445 INFO L290 TraceCheckUtils]: 38: Hoare triple {8422#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8397#(< ~counter~0 95)} is VALID [2022-04-27 14:37:24,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {8422#(< ~counter~0 94)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8422#(< ~counter~0 94)} is VALID [2022-04-27 14:37:24,446 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7966#true} {8422#(< ~counter~0 94)} #51#return; {8422#(< ~counter~0 94)} is VALID [2022-04-27 14:37:24,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {7966#true} assume true; {7966#true} is VALID [2022-04-27 14:37:24,446 INFO L290 TraceCheckUtils]: 34: Hoare triple {7966#true} assume !(0 == ~cond); {7966#true} is VALID [2022-04-27 14:37:24,446 INFO L290 TraceCheckUtils]: 33: Hoare triple {7966#true} ~cond := #in~cond; {7966#true} is VALID [2022-04-27 14:37:24,446 INFO L272 TraceCheckUtils]: 32: Hoare triple {8422#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7966#true} is VALID [2022-04-27 14:37:24,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {8422#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {8422#(< ~counter~0 94)} is VALID [2022-04-27 14:37:24,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {8447#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8422#(< ~counter~0 94)} is VALID [2022-04-27 14:37:24,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {8447#(< ~counter~0 93)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8447#(< ~counter~0 93)} is VALID [2022-04-27 14:37:24,448 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7966#true} {8447#(< ~counter~0 93)} #51#return; {8447#(< ~counter~0 93)} is VALID [2022-04-27 14:37:24,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {7966#true} assume true; {7966#true} is VALID [2022-04-27 14:37:24,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {7966#true} assume !(0 == ~cond); {7966#true} is VALID [2022-04-27 14:37:24,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {7966#true} ~cond := #in~cond; {7966#true} is VALID [2022-04-27 14:37:24,449 INFO L272 TraceCheckUtils]: 24: Hoare triple {8447#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7966#true} is VALID [2022-04-27 14:37:24,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {8447#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {8447#(< ~counter~0 93)} is VALID [2022-04-27 14:37:24,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {8472#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8447#(< ~counter~0 93)} is VALID [2022-04-27 14:37:24,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {8472#(< ~counter~0 92)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8472#(< ~counter~0 92)} is VALID [2022-04-27 14:37:24,451 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7966#true} {8472#(< ~counter~0 92)} #51#return; {8472#(< ~counter~0 92)} is VALID [2022-04-27 14:37:24,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {7966#true} assume true; {7966#true} is VALID [2022-04-27 14:37:24,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {7966#true} assume !(0 == ~cond); {7966#true} is VALID [2022-04-27 14:37:24,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {7966#true} ~cond := #in~cond; {7966#true} is VALID [2022-04-27 14:37:24,451 INFO L272 TraceCheckUtils]: 16: Hoare triple {8472#(< ~counter~0 92)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7966#true} is VALID [2022-04-27 14:37:24,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {8472#(< ~counter~0 92)} assume !!(#t~post5 < 100);havoc #t~post5; {8472#(< ~counter~0 92)} is VALID [2022-04-27 14:37:24,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {8497#(< ~counter~0 91)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8472#(< ~counter~0 92)} is VALID [2022-04-27 14:37:24,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {8497#(< ~counter~0 91)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8497#(< ~counter~0 91)} is VALID [2022-04-27 14:37:24,466 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7966#true} {8497#(< ~counter~0 91)} #51#return; {8497#(< ~counter~0 91)} is VALID [2022-04-27 14:37:24,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {7966#true} assume true; {7966#true} is VALID [2022-04-27 14:37:24,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {7966#true} assume !(0 == ~cond); {7966#true} is VALID [2022-04-27 14:37:24,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {7966#true} ~cond := #in~cond; {7966#true} is VALID [2022-04-27 14:37:24,467 INFO L272 TraceCheckUtils]: 8: Hoare triple {8497#(< ~counter~0 91)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7966#true} is VALID [2022-04-27 14:37:24,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {8497#(< ~counter~0 91)} assume !!(#t~post5 < 100);havoc #t~post5; {8497#(< ~counter~0 91)} is VALID [2022-04-27 14:37:24,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {8522#(< ~counter~0 90)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8497#(< ~counter~0 91)} is VALID [2022-04-27 14:37:24,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {8522#(< ~counter~0 90)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {8522#(< ~counter~0 90)} is VALID [2022-04-27 14:37:24,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {8522#(< ~counter~0 90)} call #t~ret6 := main(); {8522#(< ~counter~0 90)} is VALID [2022-04-27 14:37:24,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8522#(< ~counter~0 90)} {7966#true} #57#return; {8522#(< ~counter~0 90)} is VALID [2022-04-27 14:37:24,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {8522#(< ~counter~0 90)} assume true; {8522#(< ~counter~0 90)} is VALID [2022-04-27 14:37:24,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {7966#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8522#(< ~counter~0 90)} is VALID [2022-04-27 14:37:24,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {7966#true} call ULTIMATE.init(); {7966#true} is VALID [2022-04-27 14:37:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 200 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 14:37:24,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:24,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551609086] [2022-04-27 14:37:24,471 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:24,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103574857] [2022-04-27 14:37:24,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103574857] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:37:24,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:37:24,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-27 14:37:24,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433219041] [2022-04-27 14:37:24,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:24,472 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) Word has length 92 [2022-04-27 14:37:24,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:24,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-27 14:37:24,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:24,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 14:37:24,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:24,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 14:37:24,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-27 14:37:24,602 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-27 14:37:25,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:25,828 INFO L93 Difference]: Finished difference Result 249 states and 261 transitions. [2022-04-27 14:37:25,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-27 14:37:25,829 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) Word has length 92 [2022-04-27 14:37:25,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-27 14:37:25,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 249 transitions. [2022-04-27 14:37:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-27 14:37:25,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 249 transitions. [2022-04-27 14:37:25,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 249 transitions. [2022-04-27 14:37:26,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:26,080 INFO L225 Difference]: With dead ends: 249 [2022-04-27 14:37:26,080 INFO L226 Difference]: Without dead ends: 244 [2022-04-27 14:37:26,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-04-27 14:37:26,081 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 318 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:26,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 222 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:37:26,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-04-27 14:37:26,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 189. [2022-04-27 14:37:26,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:26,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 244 states. Second operand has 189 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 140 states have internal predecessors, (153), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:26,226 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand has 189 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 140 states have internal predecessors, (153), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:26,226 INFO L87 Difference]: Start difference. First operand 244 states. Second operand has 189 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 140 states have internal predecessors, (153), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:26,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:26,231 INFO L93 Difference]: Finished difference Result 244 states and 245 transitions. [2022-04-27 14:37:26,231 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 245 transitions. [2022-04-27 14:37:26,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:26,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:26,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 140 states have internal predecessors, (153), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 244 states. [2022-04-27 14:37:26,233 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 140 states have internal predecessors, (153), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 244 states. [2022-04-27 14:37:26,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:26,239 INFO L93 Difference]: Finished difference Result 244 states and 245 transitions. [2022-04-27 14:37:26,239 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 245 transitions. [2022-04-27 14:37:26,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:26,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:26,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:26,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:26,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 140 states have internal predecessors, (153), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 201 transitions. [2022-04-27 14:37:26,243 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 201 transitions. Word has length 92 [2022-04-27 14:37:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:26,244 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 201 transitions. [2022-04-27 14:37:26,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-27 14:37:26,244 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 201 transitions. [2022-04-27 14:37:26,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-27 14:37:26,245 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:26,245 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:37:26,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-27 14:37:26,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 14:37:26,462 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:26,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:26,462 INFO L85 PathProgramCache]: Analyzing trace with hash 2105665221, now seen corresponding path program 10 times [2022-04-27 14:37:26,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:26,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324545795] [2022-04-27 14:37:26,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:26,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:26,482 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:26,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1217761531] [2022-04-27 14:37:26,483 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:37:26,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:26,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:26,492 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:37:26,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-27 14:37:27,832 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:37:27,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:27,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-27 14:37:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:27,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:28,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {9681#true} call ULTIMATE.init(); {9681#true} is VALID [2022-04-27 14:37:28,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {9681#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9681#true} is VALID [2022-04-27 14:37:28,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {9681#true} assume true; {9681#true} is VALID [2022-04-27 14:37:28,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9681#true} {9681#true} #57#return; {9681#true} is VALID [2022-04-27 14:37:28,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {9681#true} call #t~ret6 := main(); {9681#true} is VALID [2022-04-27 14:37:28,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {9681#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {9701#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:28,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {9701#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9701#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:28,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {9701#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {9701#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:28,450 INFO L272 TraceCheckUtils]: 8: Hoare triple {9701#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9681#true} is VALID [2022-04-27 14:37:28,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {9681#true} ~cond := #in~cond; {9681#true} is VALID [2022-04-27 14:37:28,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {9681#true} assume !(0 == ~cond); {9681#true} is VALID [2022-04-27 14:37:28,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {9681#true} assume true; {9681#true} is VALID [2022-04-27 14:37:28,451 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9681#true} {9701#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {9701#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:28,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {9701#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9726#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:37:28,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {9726#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9726#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:37:28,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {9726#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {9726#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:37:28,452 INFO L272 TraceCheckUtils]: 16: Hoare triple {9726#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9681#true} is VALID [2022-04-27 14:37:28,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {9681#true} ~cond := #in~cond; {9681#true} is VALID [2022-04-27 14:37:28,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {9681#true} assume !(0 == ~cond); {9681#true} is VALID [2022-04-27 14:37:28,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {9681#true} assume true; {9681#true} is VALID [2022-04-27 14:37:28,453 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9681#true} {9726#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #51#return; {9726#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:37:28,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {9726#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9751#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:37:28,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {9751#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9751#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:37:28,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {9751#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {9751#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:37:28,454 INFO L272 TraceCheckUtils]: 24: Hoare triple {9751#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9681#true} is VALID [2022-04-27 14:37:28,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {9681#true} ~cond := #in~cond; {9681#true} is VALID [2022-04-27 14:37:28,454 INFO L290 TraceCheckUtils]: 26: Hoare triple {9681#true} assume !(0 == ~cond); {9681#true} is VALID [2022-04-27 14:37:28,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {9681#true} assume true; {9681#true} is VALID [2022-04-27 14:37:28,454 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9681#true} {9751#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #51#return; {9751#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:37:28,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {9751#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9776#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-27 14:37:28,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {9776#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9776#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-27 14:37:28,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {9776#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {9776#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-27 14:37:28,455 INFO L272 TraceCheckUtils]: 32: Hoare triple {9776#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9681#true} is VALID [2022-04-27 14:37:28,455 INFO L290 TraceCheckUtils]: 33: Hoare triple {9681#true} ~cond := #in~cond; {9681#true} is VALID [2022-04-27 14:37:28,456 INFO L290 TraceCheckUtils]: 34: Hoare triple {9681#true} assume !(0 == ~cond); {9681#true} is VALID [2022-04-27 14:37:28,456 INFO L290 TraceCheckUtils]: 35: Hoare triple {9681#true} assume true; {9681#true} is VALID [2022-04-27 14:37:28,456 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9681#true} {9776#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #51#return; {9776#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-27 14:37:28,456 INFO L290 TraceCheckUtils]: 37: Hoare triple {9776#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9801#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-27 14:37:28,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {9801#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9801#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-27 14:37:28,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {9801#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {9801#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-27 14:37:28,457 INFO L272 TraceCheckUtils]: 40: Hoare triple {9801#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9681#true} is VALID [2022-04-27 14:37:28,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {9681#true} ~cond := #in~cond; {9681#true} is VALID [2022-04-27 14:37:28,457 INFO L290 TraceCheckUtils]: 42: Hoare triple {9681#true} assume !(0 == ~cond); {9681#true} is VALID [2022-04-27 14:37:28,457 INFO L290 TraceCheckUtils]: 43: Hoare triple {9681#true} assume true; {9681#true} is VALID [2022-04-27 14:37:28,458 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9681#true} {9801#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #51#return; {9801#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-27 14:37:28,459 INFO L290 TraceCheckUtils]: 45: Hoare triple {9801#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9826#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:28,459 INFO L290 TraceCheckUtils]: 46: Hoare triple {9826#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9826#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:28,459 INFO L290 TraceCheckUtils]: 47: Hoare triple {9826#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 100);havoc #t~post5; {9826#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:28,459 INFO L272 TraceCheckUtils]: 48: Hoare triple {9826#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9681#true} is VALID [2022-04-27 14:37:28,459 INFO L290 TraceCheckUtils]: 49: Hoare triple {9681#true} ~cond := #in~cond; {9681#true} is VALID [2022-04-27 14:37:28,459 INFO L290 TraceCheckUtils]: 50: Hoare triple {9681#true} assume !(0 == ~cond); {9681#true} is VALID [2022-04-27 14:37:28,459 INFO L290 TraceCheckUtils]: 51: Hoare triple {9681#true} assume true; {9681#true} is VALID [2022-04-27 14:37:28,460 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9681#true} {9826#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #51#return; {9826#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:28,460 INFO L290 TraceCheckUtils]: 53: Hoare triple {9826#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9851#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:28,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {9851#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9851#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:28,461 INFO L290 TraceCheckUtils]: 55: Hoare triple {9851#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {9851#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:28,461 INFO L272 TraceCheckUtils]: 56: Hoare triple {9851#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9681#true} is VALID [2022-04-27 14:37:28,461 INFO L290 TraceCheckUtils]: 57: Hoare triple {9681#true} ~cond := #in~cond; {9681#true} is VALID [2022-04-27 14:37:28,461 INFO L290 TraceCheckUtils]: 58: Hoare triple {9681#true} assume !(0 == ~cond); {9681#true} is VALID [2022-04-27 14:37:28,461 INFO L290 TraceCheckUtils]: 59: Hoare triple {9681#true} assume true; {9681#true} is VALID [2022-04-27 14:37:28,462 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9681#true} {9851#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} #51#return; {9851#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:28,462 INFO L290 TraceCheckUtils]: 61: Hoare triple {9851#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9876#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-27 14:37:28,462 INFO L290 TraceCheckUtils]: 62: Hoare triple {9876#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9876#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-27 14:37:28,463 INFO L290 TraceCheckUtils]: 63: Hoare triple {9876#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} assume !!(#t~post5 < 100);havoc #t~post5; {9876#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-27 14:37:28,463 INFO L272 TraceCheckUtils]: 64: Hoare triple {9876#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9681#true} is VALID [2022-04-27 14:37:28,463 INFO L290 TraceCheckUtils]: 65: Hoare triple {9681#true} ~cond := #in~cond; {9681#true} is VALID [2022-04-27 14:37:28,463 INFO L290 TraceCheckUtils]: 66: Hoare triple {9681#true} assume !(0 == ~cond); {9681#true} is VALID [2022-04-27 14:37:28,463 INFO L290 TraceCheckUtils]: 67: Hoare triple {9681#true} assume true; {9681#true} is VALID [2022-04-27 14:37:28,463 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9681#true} {9876#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} #51#return; {9876#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-27 14:37:28,464 INFO L290 TraceCheckUtils]: 69: Hoare triple {9876#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9901#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-27 14:37:28,464 INFO L290 TraceCheckUtils]: 70: Hoare triple {9901#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9901#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-27 14:37:28,465 INFO L290 TraceCheckUtils]: 71: Hoare triple {9901#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !!(#t~post5 < 100);havoc #t~post5; {9901#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-27 14:37:28,465 INFO L272 TraceCheckUtils]: 72: Hoare triple {9901#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9681#true} is VALID [2022-04-27 14:37:28,465 INFO L290 TraceCheckUtils]: 73: Hoare triple {9681#true} ~cond := #in~cond; {9681#true} is VALID [2022-04-27 14:37:28,465 INFO L290 TraceCheckUtils]: 74: Hoare triple {9681#true} assume !(0 == ~cond); {9681#true} is VALID [2022-04-27 14:37:28,465 INFO L290 TraceCheckUtils]: 75: Hoare triple {9681#true} assume true; {9681#true} is VALID [2022-04-27 14:37:28,465 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {9681#true} {9901#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #51#return; {9901#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-27 14:37:28,466 INFO L290 TraceCheckUtils]: 77: Hoare triple {9901#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9926#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:37:28,466 INFO L290 TraceCheckUtils]: 78: Hoare triple {9926#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9926#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:37:28,467 INFO L290 TraceCheckUtils]: 79: Hoare triple {9926#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !!(#t~post5 < 100);havoc #t~post5; {9926#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:37:28,467 INFO L272 TraceCheckUtils]: 80: Hoare triple {9926#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9681#true} is VALID [2022-04-27 14:37:28,467 INFO L290 TraceCheckUtils]: 81: Hoare triple {9681#true} ~cond := #in~cond; {9681#true} is VALID [2022-04-27 14:37:28,467 INFO L290 TraceCheckUtils]: 82: Hoare triple {9681#true} assume !(0 == ~cond); {9681#true} is VALID [2022-04-27 14:37:28,467 INFO L290 TraceCheckUtils]: 83: Hoare triple {9681#true} assume true; {9681#true} is VALID [2022-04-27 14:37:28,467 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {9681#true} {9926#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #51#return; {9926#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:37:28,468 INFO L290 TraceCheckUtils]: 85: Hoare triple {9926#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9951#(and (<= main_~c~0 10) (= 7 (+ main_~y~0 (- 3))) (< 9 main_~k~0))} is VALID [2022-04-27 14:37:28,468 INFO L290 TraceCheckUtils]: 86: Hoare triple {9951#(and (<= main_~c~0 10) (= 7 (+ main_~y~0 (- 3))) (< 9 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9951#(and (<= main_~c~0 10) (= 7 (+ main_~y~0 (- 3))) (< 9 main_~k~0))} is VALID [2022-04-27 14:37:28,468 INFO L290 TraceCheckUtils]: 87: Hoare triple {9951#(and (<= main_~c~0 10) (= 7 (+ main_~y~0 (- 3))) (< 9 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {9951#(and (<= main_~c~0 10) (= 7 (+ main_~y~0 (- 3))) (< 9 main_~k~0))} is VALID [2022-04-27 14:37:28,468 INFO L272 TraceCheckUtils]: 88: Hoare triple {9951#(and (<= main_~c~0 10) (= 7 (+ main_~y~0 (- 3))) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9681#true} is VALID [2022-04-27 14:37:28,468 INFO L290 TraceCheckUtils]: 89: Hoare triple {9681#true} ~cond := #in~cond; {9681#true} is VALID [2022-04-27 14:37:28,468 INFO L290 TraceCheckUtils]: 90: Hoare triple {9681#true} assume !(0 == ~cond); {9681#true} is VALID [2022-04-27 14:37:28,468 INFO L290 TraceCheckUtils]: 91: Hoare triple {9681#true} assume true; {9681#true} is VALID [2022-04-27 14:37:28,469 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {9681#true} {9951#(and (<= main_~c~0 10) (= 7 (+ main_~y~0 (- 3))) (< 9 main_~k~0))} #51#return; {9951#(and (<= main_~c~0 10) (= 7 (+ main_~y~0 (- 3))) (< 9 main_~k~0))} is VALID [2022-04-27 14:37:28,470 INFO L290 TraceCheckUtils]: 93: Hoare triple {9951#(and (<= main_~c~0 10) (= 7 (+ main_~y~0 (- 3))) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {9976#(and (<= main_~k~0 10) (= 7 (+ main_~y~0 (- 3))) (< 9 main_~k~0))} is VALID [2022-04-27 14:37:28,470 INFO L272 TraceCheckUtils]: 94: Hoare triple {9976#(and (<= main_~k~0 10) (= 7 (+ main_~y~0 (- 3))) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9980#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:37:28,471 INFO L290 TraceCheckUtils]: 95: Hoare triple {9980#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9984#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:37:28,471 INFO L290 TraceCheckUtils]: 96: Hoare triple {9984#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9682#false} is VALID [2022-04-27 14:37:28,471 INFO L290 TraceCheckUtils]: 97: Hoare triple {9682#false} assume !false; {9682#false} is VALID [2022-04-27 14:37:28,471 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 22 proven. 220 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-27 14:37:28,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:28,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:28,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324545795] [2022-04-27 14:37:28,739 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:28,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217761531] [2022-04-27 14:37:28,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217761531] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:28,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:28,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-27 14:37:28,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160223806] [2022-04-27 14:37:28,740 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:28,741 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 98 [2022-04-27 14:37:28,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:28,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:37:28,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:28,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 14:37:28,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:28,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 14:37:28,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:37:28,794 INFO L87 Difference]: Start difference. First operand 189 states and 201 transitions. Second operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:37:30,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:30,346 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2022-04-27 14:37:30,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 14:37:30,346 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 98 [2022-04-27 14:37:30,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:30,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:37:30,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 79 transitions. [2022-04-27 14:37:30,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:37:30,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 79 transitions. [2022-04-27 14:37:30,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 79 transitions. [2022-04-27 14:37:30,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:30,427 INFO L225 Difference]: With dead ends: 194 [2022-04-27 14:37:30,427 INFO L226 Difference]: Without dead ends: 189 [2022-04-27 14:37:30,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-27 14:37:30,428 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:30,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 532 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 14:37:30,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-27 14:37:30,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-27 14:37:30,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:30,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0857142857142856) internal successors, (152), 140 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:30,537 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0857142857142856) internal successors, (152), 140 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:30,538 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0857142857142856) internal successors, (152), 140 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:30,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:30,541 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2022-04-27 14:37:30,541 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 200 transitions. [2022-04-27 14:37:30,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:30,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:30,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.0857142857142856) internal successors, (152), 140 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:37:30,542 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.0857142857142856) internal successors, (152), 140 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:37:30,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:30,546 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2022-04-27 14:37:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 200 transitions. [2022-04-27 14:37:30,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:30,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:30,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:30,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0857142857142856) internal successors, (152), 140 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 200 transitions. [2022-04-27 14:37:30,555 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 200 transitions. Word has length 98 [2022-04-27 14:37:30,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:30,555 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 200 transitions. [2022-04-27 14:37:30,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:37:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 200 transitions. [2022-04-27 14:37:30,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-27 14:37:30,557 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:30,557 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:37:30,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-27 14:37:30,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 14:37:30,763 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:30,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:30,763 INFO L85 PathProgramCache]: Analyzing trace with hash -65749816, now seen corresponding path program 11 times [2022-04-27 14:37:30,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:30,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820784295] [2022-04-27 14:37:30,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:30,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:30,776 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:30,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [68479283] [2022-04-27 14:37:30,776 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:37:30,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:30,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:30,777 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:37:30,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-27 14:37:31,344 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-04-27 14:37:31,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:31,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-27 14:37:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:31,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:31,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {10948#true} call ULTIMATE.init(); {10948#true} is VALID [2022-04-27 14:37:31,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {10948#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10948#true} is VALID [2022-04-27 14:37:31,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {10948#true} assume true; {10948#true} is VALID [2022-04-27 14:37:31,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10948#true} {10948#true} #57#return; {10948#true} is VALID [2022-04-27 14:37:31,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {10948#true} call #t~ret6 := main(); {10948#true} is VALID [2022-04-27 14:37:31,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {10948#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {10968#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:31,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {10968#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10968#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:31,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {10968#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {10968#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:31,989 INFO L272 TraceCheckUtils]: 8: Hoare triple {10968#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10948#true} is VALID [2022-04-27 14:37:31,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {10948#true} ~cond := #in~cond; {10948#true} is VALID [2022-04-27 14:37:31,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {10948#true} assume !(0 == ~cond); {10948#true} is VALID [2022-04-27 14:37:31,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {10948#true} assume true; {10948#true} is VALID [2022-04-27 14:37:31,989 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10948#true} {10968#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {10968#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:31,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {10968#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10993#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:31,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {10993#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10993#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:31,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {10993#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {10993#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:31,990 INFO L272 TraceCheckUtils]: 16: Hoare triple {10993#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10948#true} is VALID [2022-04-27 14:37:31,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {10948#true} ~cond := #in~cond; {10948#true} is VALID [2022-04-27 14:37:31,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {10948#true} assume !(0 == ~cond); {10948#true} is VALID [2022-04-27 14:37:31,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {10948#true} assume true; {10948#true} is VALID [2022-04-27 14:37:31,991 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10948#true} {10993#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {10993#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:31,992 INFO L290 TraceCheckUtils]: 21: Hoare triple {10993#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11018#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:37:31,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {11018#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11018#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:37:31,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {11018#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {11018#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:37:31,993 INFO L272 TraceCheckUtils]: 24: Hoare triple {11018#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10948#true} is VALID [2022-04-27 14:37:31,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {10948#true} ~cond := #in~cond; {10948#true} is VALID [2022-04-27 14:37:31,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {10948#true} assume !(0 == ~cond); {10948#true} is VALID [2022-04-27 14:37:31,993 INFO L290 TraceCheckUtils]: 27: Hoare triple {10948#true} assume true; {10948#true} is VALID [2022-04-27 14:37:31,994 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10948#true} {11018#(and (= main_~y~0 2) (= main_~c~0 2))} #51#return; {11018#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:37:31,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {11018#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11043#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:37:31,995 INFO L290 TraceCheckUtils]: 30: Hoare triple {11043#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11043#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:37:31,995 INFO L290 TraceCheckUtils]: 31: Hoare triple {11043#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {11043#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:37:31,996 INFO L272 TraceCheckUtils]: 32: Hoare triple {11043#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10948#true} is VALID [2022-04-27 14:37:31,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {10948#true} ~cond := #in~cond; {10948#true} is VALID [2022-04-27 14:37:31,996 INFO L290 TraceCheckUtils]: 34: Hoare triple {10948#true} assume !(0 == ~cond); {10948#true} is VALID [2022-04-27 14:37:31,996 INFO L290 TraceCheckUtils]: 35: Hoare triple {10948#true} assume true; {10948#true} is VALID [2022-04-27 14:37:31,996 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10948#true} {11043#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #51#return; {11043#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:37:31,997 INFO L290 TraceCheckUtils]: 37: Hoare triple {11043#(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 + ~x~0; {11068#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:37:31,997 INFO L290 TraceCheckUtils]: 38: Hoare triple {11068#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11068#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:37:31,997 INFO L290 TraceCheckUtils]: 39: Hoare triple {11068#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(#t~post5 < 100);havoc #t~post5; {11068#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:37:31,997 INFO L272 TraceCheckUtils]: 40: Hoare triple {11068#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10948#true} is VALID [2022-04-27 14:37:31,998 INFO L290 TraceCheckUtils]: 41: Hoare triple {10948#true} ~cond := #in~cond; {10948#true} is VALID [2022-04-27 14:37:31,998 INFO L290 TraceCheckUtils]: 42: Hoare triple {10948#true} assume !(0 == ~cond); {10948#true} is VALID [2022-04-27 14:37:31,998 INFO L290 TraceCheckUtils]: 43: Hoare triple {10948#true} assume true; {10948#true} is VALID [2022-04-27 14:37:31,998 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10948#true} {11068#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #51#return; {11068#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:37:31,998 INFO L290 TraceCheckUtils]: 45: Hoare triple {11068#(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 + ~x~0; {11093#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:31,999 INFO L290 TraceCheckUtils]: 46: Hoare triple {11093#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11093#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:31,999 INFO L290 TraceCheckUtils]: 47: Hoare triple {11093#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 100);havoc #t~post5; {11093#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:31,999 INFO L272 TraceCheckUtils]: 48: Hoare triple {11093#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10948#true} is VALID [2022-04-27 14:37:31,999 INFO L290 TraceCheckUtils]: 49: Hoare triple {10948#true} ~cond := #in~cond; {10948#true} is VALID [2022-04-27 14:37:31,999 INFO L290 TraceCheckUtils]: 50: Hoare triple {10948#true} assume !(0 == ~cond); {10948#true} is VALID [2022-04-27 14:37:31,999 INFO L290 TraceCheckUtils]: 51: Hoare triple {10948#true} assume true; {10948#true} is VALID [2022-04-27 14:37:32,000 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10948#true} {11093#(and (= 5 main_~c~0) (= 5 main_~y~0))} #51#return; {11093#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:32,000 INFO L290 TraceCheckUtils]: 53: Hoare triple {11093#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11118#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:32,000 INFO L290 TraceCheckUtils]: 54: Hoare triple {11118#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11118#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:32,001 INFO L290 TraceCheckUtils]: 55: Hoare triple {11118#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {11118#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:32,001 INFO L272 TraceCheckUtils]: 56: Hoare triple {11118#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10948#true} is VALID [2022-04-27 14:37:32,001 INFO L290 TraceCheckUtils]: 57: Hoare triple {10948#true} ~cond := #in~cond; {10948#true} is VALID [2022-04-27 14:37:32,001 INFO L290 TraceCheckUtils]: 58: Hoare triple {10948#true} assume !(0 == ~cond); {10948#true} is VALID [2022-04-27 14:37:32,001 INFO L290 TraceCheckUtils]: 59: Hoare triple {10948#true} assume true; {10948#true} is VALID [2022-04-27 14:37:32,001 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10948#true} {11118#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #51#return; {11118#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:32,002 INFO L290 TraceCheckUtils]: 61: Hoare triple {11118#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11143#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} is VALID [2022-04-27 14:37:32,002 INFO L290 TraceCheckUtils]: 62: Hoare triple {11143#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11143#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} is VALID [2022-04-27 14:37:32,003 INFO L290 TraceCheckUtils]: 63: Hoare triple {11143#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} assume !!(#t~post5 < 100);havoc #t~post5; {11143#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} is VALID [2022-04-27 14:37:32,003 INFO L272 TraceCheckUtils]: 64: Hoare triple {11143#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10948#true} is VALID [2022-04-27 14:37:32,003 INFO L290 TraceCheckUtils]: 65: Hoare triple {10948#true} ~cond := #in~cond; {10948#true} is VALID [2022-04-27 14:37:32,003 INFO L290 TraceCheckUtils]: 66: Hoare triple {10948#true} assume !(0 == ~cond); {10948#true} is VALID [2022-04-27 14:37:32,003 INFO L290 TraceCheckUtils]: 67: Hoare triple {10948#true} assume true; {10948#true} is VALID [2022-04-27 14:37:32,003 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10948#true} {11143#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} #51#return; {11143#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} is VALID [2022-04-27 14:37:32,004 INFO L290 TraceCheckUtils]: 69: Hoare triple {11143#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11168#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-27 14:37:32,004 INFO L290 TraceCheckUtils]: 70: Hoare triple {11168#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11168#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-27 14:37:32,004 INFO L290 TraceCheckUtils]: 71: Hoare triple {11168#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} assume !!(#t~post5 < 100);havoc #t~post5; {11168#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-27 14:37:32,004 INFO L272 TraceCheckUtils]: 72: Hoare triple {11168#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10948#true} is VALID [2022-04-27 14:37:32,004 INFO L290 TraceCheckUtils]: 73: Hoare triple {10948#true} ~cond := #in~cond; {10948#true} is VALID [2022-04-27 14:37:32,004 INFO L290 TraceCheckUtils]: 74: Hoare triple {10948#true} assume !(0 == ~cond); {10948#true} is VALID [2022-04-27 14:37:32,005 INFO L290 TraceCheckUtils]: 75: Hoare triple {10948#true} assume true; {10948#true} is VALID [2022-04-27 14:37:32,005 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10948#true} {11168#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} #51#return; {11168#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-27 14:37:32,005 INFO L290 TraceCheckUtils]: 77: Hoare triple {11168#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11193#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:37:32,006 INFO L290 TraceCheckUtils]: 78: Hoare triple {11193#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11193#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:37:32,006 INFO L290 TraceCheckUtils]: 79: Hoare triple {11193#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} assume !!(#t~post5 < 100);havoc #t~post5; {11193#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:37:32,006 INFO L272 TraceCheckUtils]: 80: Hoare triple {11193#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10948#true} is VALID [2022-04-27 14:37:32,006 INFO L290 TraceCheckUtils]: 81: Hoare triple {10948#true} ~cond := #in~cond; {10948#true} is VALID [2022-04-27 14:37:32,006 INFO L290 TraceCheckUtils]: 82: Hoare triple {10948#true} assume !(0 == ~cond); {10948#true} is VALID [2022-04-27 14:37:32,006 INFO L290 TraceCheckUtils]: 83: Hoare triple {10948#true} assume true; {10948#true} is VALID [2022-04-27 14:37:32,007 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {10948#true} {11193#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} #51#return; {11193#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:37:32,008 INFO L290 TraceCheckUtils]: 85: Hoare triple {11193#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11218#(and (= 5 (+ main_~y~0 (- 5))) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:32,008 INFO L290 TraceCheckUtils]: 86: Hoare triple {11218#(and (= 5 (+ main_~y~0 (- 5))) (= 8 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11218#(and (= 5 (+ main_~y~0 (- 5))) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:32,009 INFO L290 TraceCheckUtils]: 87: Hoare triple {11218#(and (= 5 (+ main_~y~0 (- 5))) (= 8 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {11218#(and (= 5 (+ main_~y~0 (- 5))) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:32,009 INFO L272 TraceCheckUtils]: 88: Hoare triple {11218#(and (= 5 (+ main_~y~0 (- 5))) (= 8 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10948#true} is VALID [2022-04-27 14:37:32,009 INFO L290 TraceCheckUtils]: 89: Hoare triple {10948#true} ~cond := #in~cond; {10948#true} is VALID [2022-04-27 14:37:32,009 INFO L290 TraceCheckUtils]: 90: Hoare triple {10948#true} assume !(0 == ~cond); {10948#true} is VALID [2022-04-27 14:37:32,009 INFO L290 TraceCheckUtils]: 91: Hoare triple {10948#true} assume true; {10948#true} is VALID [2022-04-27 14:37:32,010 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {10948#true} {11218#(and (= 5 (+ main_~y~0 (- 5))) (= 8 (+ (- 2) main_~c~0)))} #51#return; {11218#(and (= 5 (+ main_~y~0 (- 5))) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:32,010 INFO L290 TraceCheckUtils]: 93: Hoare triple {11218#(and (= 5 (+ main_~y~0 (- 5))) (= 8 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11243#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 5))} is VALID [2022-04-27 14:37:32,011 INFO L290 TraceCheckUtils]: 94: Hoare triple {11243#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 5))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11243#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 5))} is VALID [2022-04-27 14:37:32,011 INFO L290 TraceCheckUtils]: 95: Hoare triple {11243#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 5))} assume !!(#t~post5 < 100);havoc #t~post5; {11243#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 5))} is VALID [2022-04-27 14:37:32,011 INFO L272 TraceCheckUtils]: 96: Hoare triple {11243#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10948#true} is VALID [2022-04-27 14:37:32,011 INFO L290 TraceCheckUtils]: 97: Hoare triple {10948#true} ~cond := #in~cond; {10948#true} is VALID [2022-04-27 14:37:32,011 INFO L290 TraceCheckUtils]: 98: Hoare triple {10948#true} assume !(0 == ~cond); {10948#true} is VALID [2022-04-27 14:37:32,011 INFO L290 TraceCheckUtils]: 99: Hoare triple {10948#true} assume true; {10948#true} is VALID [2022-04-27 14:37:32,012 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {10948#true} {11243#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 5))} #51#return; {11243#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 5))} is VALID [2022-04-27 14:37:32,012 INFO L290 TraceCheckUtils]: 101: Hoare triple {11243#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 5))} assume !(~c~0 < ~k~0); {11268#(and (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 5) (<= main_~k~0 11))} is VALID [2022-04-27 14:37:32,013 INFO L272 TraceCheckUtils]: 102: Hoare triple {11268#(and (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 5) (<= main_~k~0 11))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11272#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:37:32,013 INFO L290 TraceCheckUtils]: 103: Hoare triple {11272#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11276#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:37:32,013 INFO L290 TraceCheckUtils]: 104: Hoare triple {11276#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10949#false} is VALID [2022-04-27 14:37:32,013 INFO L290 TraceCheckUtils]: 105: Hoare triple {10949#false} assume !false; {10949#false} is VALID [2022-04-27 14:37:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 24 proven. 264 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-27 14:37:32,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:32,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:32,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820784295] [2022-04-27 14:37:32,288 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:32,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68479283] [2022-04-27 14:37:32,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68479283] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:32,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:32,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-27 14:37:32,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064615748] [2022-04-27 14:37:32,288 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:32,289 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 106 [2022-04-27 14:37:32,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:32,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:37:32,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:32,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 14:37:32,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:32,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 14:37:32,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-27 14:37:32,349 INFO L87 Difference]: Start difference. First operand 189 states and 200 transitions. Second operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:37:34,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:34,065 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2022-04-27 14:37:34,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 14:37:34,065 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 106 [2022-04-27 14:37:34,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:34,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:37:34,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 84 transitions. [2022-04-27 14:37:34,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:37:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 84 transitions. [2022-04-27 14:37:34,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 84 transitions. [2022-04-27 14:37:34,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:34,165 INFO L225 Difference]: With dead ends: 194 [2022-04-27 14:37:34,165 INFO L226 Difference]: Without dead ends: 189 [2022-04-27 14:37:34,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-27 14:37:34,166 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:34,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 600 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 14:37:34,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-27 14:37:34,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-27 14:37:34,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:34,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0785714285714285) internal successors, (151), 140 states have internal predecessors, (151), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:34,280 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0785714285714285) internal successors, (151), 140 states have internal predecessors, (151), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:34,280 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0785714285714285) internal successors, (151), 140 states have internal predecessors, (151), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:34,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:34,284 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2022-04-27 14:37:34,284 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 199 transitions. [2022-04-27 14:37:34,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:34,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:34,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.0785714285714285) internal successors, (151), 140 states have internal predecessors, (151), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:37:34,285 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.0785714285714285) internal successors, (151), 140 states have internal predecessors, (151), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:37:34,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:34,288 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2022-04-27 14:37:34,288 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 199 transitions. [2022-04-27 14:37:34,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:34,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:34,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:34,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:34,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0785714285714285) internal successors, (151), 140 states have internal predecessors, (151), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:34,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 199 transitions. [2022-04-27 14:37:34,293 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 199 transitions. Word has length 106 [2022-04-27 14:37:34,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:34,293 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 199 transitions. [2022-04-27 14:37:34,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:37:34,293 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 199 transitions. [2022-04-27 14:37:34,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-27 14:37:34,294 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:34,294 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:37:34,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-27 14:37:34,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 14:37:34,501 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:34,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:34,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1170284597, now seen corresponding path program 12 times [2022-04-27 14:37:34,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:34,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853565715] [2022-04-27 14:37:34,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:34,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:34,514 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:34,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1140713831] [2022-04-27 14:37:34,514 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:37:34,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:34,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:34,515 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:37:34,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-27 14:37:35,035 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-27 14:37:35,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:35,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-27 14:37:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:35,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:35,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {12240#true} call ULTIMATE.init(); {12240#true} is VALID [2022-04-27 14:37:35,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {12240#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12240#true} is VALID [2022-04-27 14:37:35,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {12240#true} assume true; {12240#true} is VALID [2022-04-27 14:37:35,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12240#true} {12240#true} #57#return; {12240#true} is VALID [2022-04-27 14:37:35,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {12240#true} call #t~ret6 := main(); {12240#true} is VALID [2022-04-27 14:37:35,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {12240#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {12260#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:35,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {12260#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12260#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:35,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {12260#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {12260#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:35,682 INFO L272 TraceCheckUtils]: 8: Hoare triple {12260#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12240#true} is VALID [2022-04-27 14:37:35,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {12240#true} ~cond := #in~cond; {12240#true} is VALID [2022-04-27 14:37:35,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {12240#true} assume !(0 == ~cond); {12240#true} is VALID [2022-04-27 14:37:35,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {12240#true} assume true; {12240#true} is VALID [2022-04-27 14:37:35,682 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12240#true} {12260#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {12260#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:35,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {12260#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12285#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:37:35,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {12285#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12285#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:37:35,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {12285#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {12285#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:37:35,683 INFO L272 TraceCheckUtils]: 16: Hoare triple {12285#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12240#true} is VALID [2022-04-27 14:37:35,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {12240#true} ~cond := #in~cond; {12240#true} is VALID [2022-04-27 14:37:35,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {12240#true} assume !(0 == ~cond); {12240#true} is VALID [2022-04-27 14:37:35,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {12240#true} assume true; {12240#true} is VALID [2022-04-27 14:37:35,684 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {12240#true} {12285#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #51#return; {12285#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:37:35,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {12285#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12310#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:37:35,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {12310#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12310#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:37:35,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {12310#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {12310#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:37:35,685 INFO L272 TraceCheckUtils]: 24: Hoare triple {12310#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12240#true} is VALID [2022-04-27 14:37:35,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {12240#true} ~cond := #in~cond; {12240#true} is VALID [2022-04-27 14:37:35,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {12240#true} assume !(0 == ~cond); {12240#true} is VALID [2022-04-27 14:37:35,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {12240#true} assume true; {12240#true} is VALID [2022-04-27 14:37:35,686 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {12240#true} {12310#(and (= main_~y~0 2) (= main_~c~0 2))} #51#return; {12310#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:37:35,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {12310#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12335#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:37:35,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {12335#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12335#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:37:35,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {12335#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 100);havoc #t~post5; {12335#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:37:35,687 INFO L272 TraceCheckUtils]: 32: Hoare triple {12335#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12240#true} is VALID [2022-04-27 14:37:35,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {12240#true} ~cond := #in~cond; {12240#true} is VALID [2022-04-27 14:37:35,687 INFO L290 TraceCheckUtils]: 34: Hoare triple {12240#true} assume !(0 == ~cond); {12240#true} is VALID [2022-04-27 14:37:35,687 INFO L290 TraceCheckUtils]: 35: Hoare triple {12240#true} assume true; {12240#true} is VALID [2022-04-27 14:37:35,687 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12240#true} {12335#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #51#return; {12335#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:37:35,688 INFO L290 TraceCheckUtils]: 37: Hoare triple {12335#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12360#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:37:35,688 INFO L290 TraceCheckUtils]: 38: Hoare triple {12360#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12360#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:37:35,688 INFO L290 TraceCheckUtils]: 39: Hoare triple {12360#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {12360#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:37:35,688 INFO L272 TraceCheckUtils]: 40: Hoare triple {12360#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12240#true} is VALID [2022-04-27 14:37:35,688 INFO L290 TraceCheckUtils]: 41: Hoare triple {12240#true} ~cond := #in~cond; {12240#true} is VALID [2022-04-27 14:37:35,688 INFO L290 TraceCheckUtils]: 42: Hoare triple {12240#true} assume !(0 == ~cond); {12240#true} is VALID [2022-04-27 14:37:35,688 INFO L290 TraceCheckUtils]: 43: Hoare triple {12240#true} assume true; {12240#true} is VALID [2022-04-27 14:37:35,689 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {12240#true} {12360#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #51#return; {12360#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:37:35,689 INFO L290 TraceCheckUtils]: 45: Hoare triple {12360#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12385#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:35,690 INFO L290 TraceCheckUtils]: 46: Hoare triple {12385#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12385#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:35,690 INFO L290 TraceCheckUtils]: 47: Hoare triple {12385#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !!(#t~post5 < 100);havoc #t~post5; {12385#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:35,690 INFO L272 TraceCheckUtils]: 48: Hoare triple {12385#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12240#true} is VALID [2022-04-27 14:37:35,690 INFO L290 TraceCheckUtils]: 49: Hoare triple {12240#true} ~cond := #in~cond; {12240#true} is VALID [2022-04-27 14:37:35,690 INFO L290 TraceCheckUtils]: 50: Hoare triple {12240#true} assume !(0 == ~cond); {12240#true} is VALID [2022-04-27 14:37:35,690 INFO L290 TraceCheckUtils]: 51: Hoare triple {12240#true} assume true; {12240#true} is VALID [2022-04-27 14:37:35,690 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12240#true} {12385#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} #51#return; {12385#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:35,691 INFO L290 TraceCheckUtils]: 53: Hoare triple {12385#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12410#(and (= main_~y~0 6) (= 2 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:37:35,691 INFO L290 TraceCheckUtils]: 54: Hoare triple {12410#(and (= main_~y~0 6) (= 2 (+ main_~c~0 (- 4))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12410#(and (= main_~y~0 6) (= 2 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:37:35,692 INFO L290 TraceCheckUtils]: 55: Hoare triple {12410#(and (= main_~y~0 6) (= 2 (+ main_~c~0 (- 4))))} assume !!(#t~post5 < 100);havoc #t~post5; {12410#(and (= main_~y~0 6) (= 2 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:37:35,692 INFO L272 TraceCheckUtils]: 56: Hoare triple {12410#(and (= main_~y~0 6) (= 2 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12240#true} is VALID [2022-04-27 14:37:35,692 INFO L290 TraceCheckUtils]: 57: Hoare triple {12240#true} ~cond := #in~cond; {12240#true} is VALID [2022-04-27 14:37:35,692 INFO L290 TraceCheckUtils]: 58: Hoare triple {12240#true} assume !(0 == ~cond); {12240#true} is VALID [2022-04-27 14:37:35,692 INFO L290 TraceCheckUtils]: 59: Hoare triple {12240#true} assume true; {12240#true} is VALID [2022-04-27 14:37:35,692 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12240#true} {12410#(and (= main_~y~0 6) (= 2 (+ main_~c~0 (- 4))))} #51#return; {12410#(and (= main_~y~0 6) (= 2 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:37:35,693 INFO L290 TraceCheckUtils]: 61: Hoare triple {12410#(and (= main_~y~0 6) (= 2 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12435#(and (= 2 (+ main_~c~0 (- 5))) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:35,693 INFO L290 TraceCheckUtils]: 62: Hoare triple {12435#(and (= 2 (+ main_~c~0 (- 5))) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12435#(and (= 2 (+ main_~c~0 (- 5))) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:35,693 INFO L290 TraceCheckUtils]: 63: Hoare triple {12435#(and (= 2 (+ main_~c~0 (- 5))) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {12435#(and (= 2 (+ main_~c~0 (- 5))) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:35,693 INFO L272 TraceCheckUtils]: 64: Hoare triple {12435#(and (= 2 (+ main_~c~0 (- 5))) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12240#true} is VALID [2022-04-27 14:37:35,693 INFO L290 TraceCheckUtils]: 65: Hoare triple {12240#true} ~cond := #in~cond; {12240#true} is VALID [2022-04-27 14:37:35,693 INFO L290 TraceCheckUtils]: 66: Hoare triple {12240#true} assume !(0 == ~cond); {12240#true} is VALID [2022-04-27 14:37:35,693 INFO L290 TraceCheckUtils]: 67: Hoare triple {12240#true} assume true; {12240#true} is VALID [2022-04-27 14:37:35,694 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12240#true} {12435#(and (= 2 (+ main_~c~0 (- 5))) (= 6 (+ (- 1) main_~y~0)))} #51#return; {12435#(and (= 2 (+ main_~c~0 (- 5))) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:35,694 INFO L290 TraceCheckUtils]: 69: Hoare triple {12435#(and (= 2 (+ main_~c~0 (- 5))) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12460#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:37:35,694 INFO L290 TraceCheckUtils]: 70: Hoare triple {12460#(and (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12460#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:37:35,695 INFO L290 TraceCheckUtils]: 71: Hoare triple {12460#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 100);havoc #t~post5; {12460#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:37:35,695 INFO L272 TraceCheckUtils]: 72: Hoare triple {12460#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12240#true} is VALID [2022-04-27 14:37:35,695 INFO L290 TraceCheckUtils]: 73: Hoare triple {12240#true} ~cond := #in~cond; {12240#true} is VALID [2022-04-27 14:37:35,695 INFO L290 TraceCheckUtils]: 74: Hoare triple {12240#true} assume !(0 == ~cond); {12240#true} is VALID [2022-04-27 14:37:35,695 INFO L290 TraceCheckUtils]: 75: Hoare triple {12240#true} assume true; {12240#true} is VALID [2022-04-27 14:37:35,695 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {12240#true} {12460#(and (= main_~y~0 8) (= main_~c~0 8))} #51#return; {12460#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:37:35,696 INFO L290 TraceCheckUtils]: 77: Hoare triple {12460#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12485#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:37:35,696 INFO L290 TraceCheckUtils]: 78: Hoare triple {12485#(and (= main_~y~0 9) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12485#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:37:35,696 INFO L290 TraceCheckUtils]: 79: Hoare triple {12485#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(#t~post5 < 100);havoc #t~post5; {12485#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:37:35,696 INFO L272 TraceCheckUtils]: 80: Hoare triple {12485#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12240#true} is VALID [2022-04-27 14:37:35,697 INFO L290 TraceCheckUtils]: 81: Hoare triple {12240#true} ~cond := #in~cond; {12240#true} is VALID [2022-04-27 14:37:35,697 INFO L290 TraceCheckUtils]: 82: Hoare triple {12240#true} assume !(0 == ~cond); {12240#true} is VALID [2022-04-27 14:37:35,697 INFO L290 TraceCheckUtils]: 83: Hoare triple {12240#true} assume true; {12240#true} is VALID [2022-04-27 14:37:35,697 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {12240#true} {12485#(and (= main_~y~0 9) (= main_~c~0 9))} #51#return; {12485#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:37:35,697 INFO L290 TraceCheckUtils]: 85: Hoare triple {12485#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12510#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:37:35,698 INFO L290 TraceCheckUtils]: 86: Hoare triple {12510#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12510#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:37:35,698 INFO L290 TraceCheckUtils]: 87: Hoare triple {12510#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !!(#t~post5 < 100);havoc #t~post5; {12510#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:37:35,698 INFO L272 TraceCheckUtils]: 88: Hoare triple {12510#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12240#true} is VALID [2022-04-27 14:37:35,698 INFO L290 TraceCheckUtils]: 89: Hoare triple {12240#true} ~cond := #in~cond; {12240#true} is VALID [2022-04-27 14:37:35,698 INFO L290 TraceCheckUtils]: 90: Hoare triple {12240#true} assume !(0 == ~cond); {12240#true} is VALID [2022-04-27 14:37:35,698 INFO L290 TraceCheckUtils]: 91: Hoare triple {12240#true} assume true; {12240#true} is VALID [2022-04-27 14:37:35,699 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {12240#true} {12510#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #51#return; {12510#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:37:35,699 INFO L290 TraceCheckUtils]: 93: Hoare triple {12510#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12535#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:37:35,699 INFO L290 TraceCheckUtils]: 94: Hoare triple {12535#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12535#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:37:35,700 INFO L290 TraceCheckUtils]: 95: Hoare triple {12535#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !!(#t~post5 < 100);havoc #t~post5; {12535#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:37:35,700 INFO L272 TraceCheckUtils]: 96: Hoare triple {12535#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12240#true} is VALID [2022-04-27 14:37:35,700 INFO L290 TraceCheckUtils]: 97: Hoare triple {12240#true} ~cond := #in~cond; {12240#true} is VALID [2022-04-27 14:37:35,700 INFO L290 TraceCheckUtils]: 98: Hoare triple {12240#true} assume !(0 == ~cond); {12240#true} is VALID [2022-04-27 14:37:35,700 INFO L290 TraceCheckUtils]: 99: Hoare triple {12240#true} assume true; {12240#true} is VALID [2022-04-27 14:37:35,700 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {12240#true} {12535#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #51#return; {12535#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:37:35,701 INFO L290 TraceCheckUtils]: 101: Hoare triple {12535#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12560#(and (= (+ (- 2) main_~y~0) 10) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-27 14:37:35,701 INFO L290 TraceCheckUtils]: 102: Hoare triple {12560#(and (= (+ (- 2) main_~y~0) 10) (<= main_~c~0 12) (< 11 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12560#(and (= (+ (- 2) main_~y~0) 10) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-27 14:37:35,701 INFO L290 TraceCheckUtils]: 103: Hoare triple {12560#(and (= (+ (- 2) main_~y~0) 10) (<= main_~c~0 12) (< 11 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {12560#(and (= (+ (- 2) main_~y~0) 10) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-27 14:37:35,701 INFO L272 TraceCheckUtils]: 104: Hoare triple {12560#(and (= (+ (- 2) main_~y~0) 10) (<= main_~c~0 12) (< 11 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12240#true} is VALID [2022-04-27 14:37:35,701 INFO L290 TraceCheckUtils]: 105: Hoare triple {12240#true} ~cond := #in~cond; {12240#true} is VALID [2022-04-27 14:37:35,701 INFO L290 TraceCheckUtils]: 106: Hoare triple {12240#true} assume !(0 == ~cond); {12240#true} is VALID [2022-04-27 14:37:35,702 INFO L290 TraceCheckUtils]: 107: Hoare triple {12240#true} assume true; {12240#true} is VALID [2022-04-27 14:37:35,702 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {12240#true} {12560#(and (= (+ (- 2) main_~y~0) 10) (<= main_~c~0 12) (< 11 main_~k~0))} #51#return; {12560#(and (= (+ (- 2) main_~y~0) 10) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-27 14:37:35,703 INFO L290 TraceCheckUtils]: 109: Hoare triple {12560#(and (= (+ (- 2) main_~y~0) 10) (<= main_~c~0 12) (< 11 main_~k~0))} assume !(~c~0 < ~k~0); {12585#(and (= (+ (- 2) main_~y~0) 10) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-27 14:37:35,703 INFO L272 TraceCheckUtils]: 110: Hoare triple {12585#(and (= (+ (- 2) main_~y~0) 10) (< 11 main_~k~0) (<= main_~k~0 12))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12589#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:37:35,703 INFO L290 TraceCheckUtils]: 111: Hoare triple {12589#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12593#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:37:35,704 INFO L290 TraceCheckUtils]: 112: Hoare triple {12593#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12241#false} is VALID [2022-04-27 14:37:35,704 INFO L290 TraceCheckUtils]: 113: Hoare triple {12241#false} assume !false; {12241#false} is VALID [2022-04-27 14:37:35,704 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 26 proven. 312 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-27 14:37:35,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:35,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:35,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853565715] [2022-04-27 14:37:35,990 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:35,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140713831] [2022-04-27 14:37:35,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140713831] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:35,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:35,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-27 14:37:35,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273695002] [2022-04-27 14:37:35,991 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:35,991 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 114 [2022-04-27 14:37:35,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:35,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:37:36,055 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:37:36,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 14:37:36,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:36,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 14:37:36,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-27 14:37:36,056 INFO L87 Difference]: Start difference. First operand 189 states and 199 transitions. Second operand has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:37:38,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:38,027 INFO L93 Difference]: Finished difference Result 194 states and 203 transitions. [2022-04-27 14:37:38,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 14:37:38,027 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 114 [2022-04-27 14:37:38,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:37:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2022-04-27 14:37:38,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:37:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2022-04-27 14:37:38,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 89 transitions. [2022-04-27 14:37:38,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:38,130 INFO L225 Difference]: With dead ends: 194 [2022-04-27 14:37:38,130 INFO L226 Difference]: Without dead ends: 189 [2022-04-27 14:37:38,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2022-04-27 14:37:38,131 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 2 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:38,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 672 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 14:37:38,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-27 14:37:38,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-27 14:37:38,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:38,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0714285714285714) internal successors, (150), 140 states have internal predecessors, (150), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:38,246 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0714285714285714) internal successors, (150), 140 states have internal predecessors, (150), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:38,246 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0714285714285714) internal successors, (150), 140 states have internal predecessors, (150), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:38,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:38,249 INFO L93 Difference]: Finished difference Result 189 states and 198 transitions. [2022-04-27 14:37:38,249 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 198 transitions. [2022-04-27 14:37:38,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:38,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:38,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.0714285714285714) internal successors, (150), 140 states have internal predecessors, (150), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:37:38,250 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.0714285714285714) internal successors, (150), 140 states have internal predecessors, (150), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:37:38,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:38,254 INFO L93 Difference]: Finished difference Result 189 states and 198 transitions. [2022-04-27 14:37:38,254 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 198 transitions. [2022-04-27 14:37:38,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:38,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:38,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:38,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0714285714285714) internal successors, (150), 140 states have internal predecessors, (150), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:38,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 198 transitions. [2022-04-27 14:37:38,259 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 198 transitions. Word has length 114 [2022-04-27 14:37:38,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:38,260 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 198 transitions. [2022-04-27 14:37:38,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:37:38,260 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 198 transitions. [2022-04-27 14:37:38,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-27 14:37:38,261 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:38,261 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:37:38,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-27 14:37:38,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:38,470 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:38,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:38,470 INFO L85 PathProgramCache]: Analyzing trace with hash -966570034, now seen corresponding path program 13 times [2022-04-27 14:37:38,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:38,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325259549] [2022-04-27 14:37:38,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:38,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:38,511 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:38,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [936354449] [2022-04-27 14:37:38,511 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:37:38,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:38,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:38,514 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:37:38,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-27 14:37:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:39,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-27 14:37:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:39,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:40,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {13557#true} call ULTIMATE.init(); {13557#true} is VALID [2022-04-27 14:37:40,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {13557#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13557#true} is VALID [2022-04-27 14:37:40,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {13557#true} assume true; {13557#true} is VALID [2022-04-27 14:37:40,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13557#true} {13557#true} #57#return; {13557#true} is VALID [2022-04-27 14:37:40,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {13557#true} call #t~ret6 := main(); {13557#true} is VALID [2022-04-27 14:37:40,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {13557#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {13577#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:40,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {13577#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13577#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:40,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {13577#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {13577#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:40,388 INFO L272 TraceCheckUtils]: 8: Hoare triple {13577#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13557#true} is VALID [2022-04-27 14:37:40,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {13557#true} ~cond := #in~cond; {13557#true} is VALID [2022-04-27 14:37:40,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {13557#true} assume !(0 == ~cond); {13557#true} is VALID [2022-04-27 14:37:40,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {13557#true} assume true; {13557#true} is VALID [2022-04-27 14:37:40,388 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13557#true} {13577#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {13577#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:40,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {13577#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13602#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:37:40,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {13602#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13602#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:37:40,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {13602#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {13602#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:37:40,390 INFO L272 TraceCheckUtils]: 16: Hoare triple {13602#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13557#true} is VALID [2022-04-27 14:37:40,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {13557#true} ~cond := #in~cond; {13557#true} is VALID [2022-04-27 14:37:40,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {13557#true} assume !(0 == ~cond); {13557#true} is VALID [2022-04-27 14:37:40,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {13557#true} assume true; {13557#true} is VALID [2022-04-27 14:37:40,390 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13557#true} {13602#(and (= main_~y~0 1) (= main_~c~0 1))} #51#return; {13602#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:37:40,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {13602#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13627#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:37:40,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {13627#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13627#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:37:40,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {13627#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {13627#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:37:40,391 INFO L272 TraceCheckUtils]: 24: Hoare triple {13627#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13557#true} is VALID [2022-04-27 14:37:40,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {13557#true} ~cond := #in~cond; {13557#true} is VALID [2022-04-27 14:37:40,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {13557#true} assume !(0 == ~cond); {13557#true} is VALID [2022-04-27 14:37:40,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {13557#true} assume true; {13557#true} is VALID [2022-04-27 14:37:40,392 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {13557#true} {13627#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #51#return; {13627#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:37:40,392 INFO L290 TraceCheckUtils]: 29: Hoare triple {13627#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13652#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-27 14:37:40,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {13652#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13652#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-27 14:37:40,393 INFO L290 TraceCheckUtils]: 31: Hoare triple {13652#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {13652#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-27 14:37:40,393 INFO L272 TraceCheckUtils]: 32: Hoare triple {13652#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13557#true} is VALID [2022-04-27 14:37:40,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {13557#true} ~cond := #in~cond; {13557#true} is VALID [2022-04-27 14:37:40,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {13557#true} assume !(0 == ~cond); {13557#true} is VALID [2022-04-27 14:37:40,393 INFO L290 TraceCheckUtils]: 35: Hoare triple {13557#true} assume true; {13557#true} is VALID [2022-04-27 14:37:40,393 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13557#true} {13652#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #51#return; {13652#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-27 14:37:40,394 INFO L290 TraceCheckUtils]: 37: Hoare triple {13652#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13677#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-27 14:37:40,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {13677#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13677#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-27 14:37:40,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {13677#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {13677#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-27 14:37:40,395 INFO L272 TraceCheckUtils]: 40: Hoare triple {13677#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13557#true} is VALID [2022-04-27 14:37:40,395 INFO L290 TraceCheckUtils]: 41: Hoare triple {13557#true} ~cond := #in~cond; {13557#true} is VALID [2022-04-27 14:37:40,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {13557#true} assume !(0 == ~cond); {13557#true} is VALID [2022-04-27 14:37:40,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {13557#true} assume true; {13557#true} is VALID [2022-04-27 14:37:40,395 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13557#true} {13677#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #51#return; {13677#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-27 14:37:40,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {13677#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13702#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-27 14:37:40,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {13702#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13702#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-27 14:37:40,396 INFO L290 TraceCheckUtils]: 47: Hoare triple {13702#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} assume !!(#t~post5 < 100);havoc #t~post5; {13702#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-27 14:37:40,397 INFO L272 TraceCheckUtils]: 48: Hoare triple {13702#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13557#true} is VALID [2022-04-27 14:37:40,397 INFO L290 TraceCheckUtils]: 49: Hoare triple {13557#true} ~cond := #in~cond; {13557#true} is VALID [2022-04-27 14:37:40,397 INFO L290 TraceCheckUtils]: 50: Hoare triple {13557#true} assume !(0 == ~cond); {13557#true} is VALID [2022-04-27 14:37:40,397 INFO L290 TraceCheckUtils]: 51: Hoare triple {13557#true} assume true; {13557#true} is VALID [2022-04-27 14:37:40,397 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13557#true} {13702#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} #51#return; {13702#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-27 14:37:40,397 INFO L290 TraceCheckUtils]: 53: Hoare triple {13702#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13727#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-27 14:37:40,398 INFO L290 TraceCheckUtils]: 54: Hoare triple {13727#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13727#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-27 14:37:40,398 INFO L290 TraceCheckUtils]: 55: Hoare triple {13727#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {13727#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-27 14:37:40,398 INFO L272 TraceCheckUtils]: 56: Hoare triple {13727#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13557#true} is VALID [2022-04-27 14:37:40,398 INFO L290 TraceCheckUtils]: 57: Hoare triple {13557#true} ~cond := #in~cond; {13557#true} is VALID [2022-04-27 14:37:40,398 INFO L290 TraceCheckUtils]: 58: Hoare triple {13557#true} assume !(0 == ~cond); {13557#true} is VALID [2022-04-27 14:37:40,398 INFO L290 TraceCheckUtils]: 59: Hoare triple {13557#true} assume true; {13557#true} is VALID [2022-04-27 14:37:40,399 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13557#true} {13727#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} #51#return; {13727#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-27 14:37:40,399 INFO L290 TraceCheckUtils]: 61: Hoare triple {13727#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13752#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 14:37:40,399 INFO L290 TraceCheckUtils]: 62: Hoare triple {13752#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 6)) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13752#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 14:37:40,400 INFO L290 TraceCheckUtils]: 63: Hoare triple {13752#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 6)) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {13752#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 14:37:40,400 INFO L272 TraceCheckUtils]: 64: Hoare triple {13752#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13557#true} is VALID [2022-04-27 14:37:40,400 INFO L290 TraceCheckUtils]: 65: Hoare triple {13557#true} ~cond := #in~cond; {13557#true} is VALID [2022-04-27 14:37:40,400 INFO L290 TraceCheckUtils]: 66: Hoare triple {13557#true} assume !(0 == ~cond); {13557#true} is VALID [2022-04-27 14:37:40,400 INFO L290 TraceCheckUtils]: 67: Hoare triple {13557#true} assume true; {13557#true} is VALID [2022-04-27 14:37:40,400 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13557#true} {13752#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 6)) 1))} #51#return; {13752#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 14:37:40,401 INFO L290 TraceCheckUtils]: 69: Hoare triple {13752#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 6)) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13777#(and (= (+ main_~y~0 (- 7)) 1) (= main_~c~0 8))} is VALID [2022-04-27 14:37:40,401 INFO L290 TraceCheckUtils]: 70: Hoare triple {13777#(and (= (+ main_~y~0 (- 7)) 1) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13777#(and (= (+ main_~y~0 (- 7)) 1) (= main_~c~0 8))} is VALID [2022-04-27 14:37:40,401 INFO L290 TraceCheckUtils]: 71: Hoare triple {13777#(and (= (+ main_~y~0 (- 7)) 1) (= main_~c~0 8))} assume !!(#t~post5 < 100);havoc #t~post5; {13777#(and (= (+ main_~y~0 (- 7)) 1) (= main_~c~0 8))} is VALID [2022-04-27 14:37:40,401 INFO L272 TraceCheckUtils]: 72: Hoare triple {13777#(and (= (+ main_~y~0 (- 7)) 1) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13557#true} is VALID [2022-04-27 14:37:40,402 INFO L290 TraceCheckUtils]: 73: Hoare triple {13557#true} ~cond := #in~cond; {13557#true} is VALID [2022-04-27 14:37:40,402 INFO L290 TraceCheckUtils]: 74: Hoare triple {13557#true} assume !(0 == ~cond); {13557#true} is VALID [2022-04-27 14:37:40,402 INFO L290 TraceCheckUtils]: 75: Hoare triple {13557#true} assume true; {13557#true} is VALID [2022-04-27 14:37:40,402 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {13557#true} {13777#(and (= (+ main_~y~0 (- 7)) 1) (= main_~c~0 8))} #51#return; {13777#(and (= (+ main_~y~0 (- 7)) 1) (= main_~c~0 8))} is VALID [2022-04-27 14:37:40,402 INFO L290 TraceCheckUtils]: 77: Hoare triple {13777#(and (= (+ main_~y~0 (- 7)) 1) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13802#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:37:40,403 INFO L290 TraceCheckUtils]: 78: Hoare triple {13802#(and (= main_~y~0 9) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13802#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:37:40,403 INFO L290 TraceCheckUtils]: 79: Hoare triple {13802#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(#t~post5 < 100);havoc #t~post5; {13802#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:37:40,403 INFO L272 TraceCheckUtils]: 80: Hoare triple {13802#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13557#true} is VALID [2022-04-27 14:37:40,403 INFO L290 TraceCheckUtils]: 81: Hoare triple {13557#true} ~cond := #in~cond; {13557#true} is VALID [2022-04-27 14:37:40,403 INFO L290 TraceCheckUtils]: 82: Hoare triple {13557#true} assume !(0 == ~cond); {13557#true} is VALID [2022-04-27 14:37:40,403 INFO L290 TraceCheckUtils]: 83: Hoare triple {13557#true} assume true; {13557#true} is VALID [2022-04-27 14:37:40,404 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {13557#true} {13802#(and (= main_~y~0 9) (= main_~c~0 9))} #51#return; {13802#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:37:40,404 INFO L290 TraceCheckUtils]: 85: Hoare triple {13802#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13827#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:37:40,404 INFO L290 TraceCheckUtils]: 86: Hoare triple {13827#(and (= main_~y~0 10) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13827#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:37:40,405 INFO L290 TraceCheckUtils]: 87: Hoare triple {13827#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(#t~post5 < 100);havoc #t~post5; {13827#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:37:40,405 INFO L272 TraceCheckUtils]: 88: Hoare triple {13827#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13557#true} is VALID [2022-04-27 14:37:40,405 INFO L290 TraceCheckUtils]: 89: Hoare triple {13557#true} ~cond := #in~cond; {13557#true} is VALID [2022-04-27 14:37:40,405 INFO L290 TraceCheckUtils]: 90: Hoare triple {13557#true} assume !(0 == ~cond); {13557#true} is VALID [2022-04-27 14:37:40,405 INFO L290 TraceCheckUtils]: 91: Hoare triple {13557#true} assume true; {13557#true} is VALID [2022-04-27 14:37:40,405 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {13557#true} {13827#(and (= main_~y~0 10) (= main_~c~0 10))} #51#return; {13827#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:37:40,406 INFO L290 TraceCheckUtils]: 93: Hoare triple {13827#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13852#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 14:37:40,406 INFO L290 TraceCheckUtils]: 94: Hoare triple {13852#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13852#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 14:37:40,407 INFO L290 TraceCheckUtils]: 95: Hoare triple {13852#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !!(#t~post5 < 100);havoc #t~post5; {13852#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 14:37:40,407 INFO L272 TraceCheckUtils]: 96: Hoare triple {13852#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13557#true} is VALID [2022-04-27 14:37:40,407 INFO L290 TraceCheckUtils]: 97: Hoare triple {13557#true} ~cond := #in~cond; {13557#true} is VALID [2022-04-27 14:37:40,407 INFO L290 TraceCheckUtils]: 98: Hoare triple {13557#true} assume !(0 == ~cond); {13557#true} is VALID [2022-04-27 14:37:40,407 INFO L290 TraceCheckUtils]: 99: Hoare triple {13557#true} assume true; {13557#true} is VALID [2022-04-27 14:37:40,407 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {13557#true} {13852#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #51#return; {13852#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 14:37:40,408 INFO L290 TraceCheckUtils]: 101: Hoare triple {13852#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13877#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:37:40,408 INFO L290 TraceCheckUtils]: 102: Hoare triple {13877#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13877#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:37:40,408 INFO L290 TraceCheckUtils]: 103: Hoare triple {13877#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !!(#t~post5 < 100);havoc #t~post5; {13877#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:37:40,408 INFO L272 TraceCheckUtils]: 104: Hoare triple {13877#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13557#true} is VALID [2022-04-27 14:37:40,408 INFO L290 TraceCheckUtils]: 105: Hoare triple {13557#true} ~cond := #in~cond; {13557#true} is VALID [2022-04-27 14:37:40,408 INFO L290 TraceCheckUtils]: 106: Hoare triple {13557#true} assume !(0 == ~cond); {13557#true} is VALID [2022-04-27 14:37:40,408 INFO L290 TraceCheckUtils]: 107: Hoare triple {13557#true} assume true; {13557#true} is VALID [2022-04-27 14:37:40,409 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {13557#true} {13877#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #51#return; {13877#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:37:40,409 INFO L290 TraceCheckUtils]: 109: Hoare triple {13877#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13902#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:37:40,410 INFO L290 TraceCheckUtils]: 110: Hoare triple {13902#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13902#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:37:40,410 INFO L290 TraceCheckUtils]: 111: Hoare triple {13902#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !!(#t~post5 < 100);havoc #t~post5; {13902#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:37:40,410 INFO L272 TraceCheckUtils]: 112: Hoare triple {13902#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13557#true} is VALID [2022-04-27 14:37:40,410 INFO L290 TraceCheckUtils]: 113: Hoare triple {13557#true} ~cond := #in~cond; {13915#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:37:40,410 INFO L290 TraceCheckUtils]: 114: Hoare triple {13915#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13919#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:37:40,411 INFO L290 TraceCheckUtils]: 115: Hoare triple {13919#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13919#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:37:40,411 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {13919#(not (= |__VERIFIER_assert_#in~cond| 0))} {13902#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} #51#return; {13902#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:37:40,412 INFO L290 TraceCheckUtils]: 117: Hoare triple {13902#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !(~c~0 < ~k~0); {13929#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:37:40,412 INFO L272 TraceCheckUtils]: 118: Hoare triple {13929#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13933#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:37:40,413 INFO L290 TraceCheckUtils]: 119: Hoare triple {13933#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13937#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:37:40,413 INFO L290 TraceCheckUtils]: 120: Hoare triple {13937#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13558#false} is VALID [2022-04-27 14:37:40,413 INFO L290 TraceCheckUtils]: 121: Hoare triple {13558#false} assume !false; {13558#false} is VALID [2022-04-27 14:37:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 66 proven. 365 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-04-27 14:37:40,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:58,836 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0))))) (not (= (mod (+ (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* c_main_~y~0 c_main_~y~0) (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) is different from false [2022-04-27 14:38:00,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:00,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325259549] [2022-04-27 14:38:00,916 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:00,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936354449] [2022-04-27 14:38:00,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936354449] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:00,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:00,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-27 14:38:00,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150284229] [2022-04-27 14:38:00,917 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:00,917 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 122 [2022-04-27 14:38:00,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:00,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:38:00,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:38:00,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 14:38:00,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:00,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 14:38:00,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=539, Unknown=1, NotChecked=46, Total=650 [2022-04-27 14:38:00,986 INFO L87 Difference]: Start difference. First operand 189 states and 198 transitions. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:38:03,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:03,208 INFO L93 Difference]: Finished difference Result 194 states and 202 transitions. [2022-04-27 14:38:03,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 14:38:03,208 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 122 [2022-04-27 14:38:03,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:38:03,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 94 transitions. [2022-04-27 14:38:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:38:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 94 transitions. [2022-04-27 14:38:03,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 94 transitions. [2022-04-27 14:38:03,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:38:03,311 INFO L225 Difference]: With dead ends: 194 [2022-04-27 14:38:03,311 INFO L226 Difference]: Without dead ends: 189 [2022-04-27 14:38:03,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=84, Invalid=675, Unknown=1, NotChecked=52, Total=812 [2022-04-27 14:38:03,312 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:38:03,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 689 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 14:38:03,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-27 14:38:03,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-27 14:38:03,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:03,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0642857142857143) internal successors, (149), 140 states have internal predecessors, (149), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:38:03,429 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0642857142857143) internal successors, (149), 140 states have internal predecessors, (149), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:38:03,429 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0642857142857143) internal successors, (149), 140 states have internal predecessors, (149), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:38:03,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:03,432 INFO L93 Difference]: Finished difference Result 189 states and 197 transitions. [2022-04-27 14:38:03,432 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 197 transitions. [2022-04-27 14:38:03,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:03,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:03,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.0642857142857143) internal successors, (149), 140 states have internal predecessors, (149), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:38:03,433 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.0642857142857143) internal successors, (149), 140 states have internal predecessors, (149), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:38:03,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:03,436 INFO L93 Difference]: Finished difference Result 189 states and 197 transitions. [2022-04-27 14:38:03,436 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 197 transitions. [2022-04-27 14:38:03,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:03,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:03,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:03,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0642857142857143) internal successors, (149), 140 states have internal predecessors, (149), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:38:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 197 transitions. [2022-04-27 14:38:03,440 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 197 transitions. Word has length 122 [2022-04-27 14:38:03,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:03,441 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 197 transitions. [2022-04-27 14:38:03,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:38:03,441 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 197 transitions. [2022-04-27 14:38:03,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-27 14:38:03,442 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:03,442 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:38:03,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-27 14:38:03,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:03,648 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:03,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:03,649 INFO L85 PathProgramCache]: Analyzing trace with hash 467995857, now seen corresponding path program 14 times [2022-04-27 14:38:03,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:03,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238803152] [2022-04-27 14:38:03,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:03,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:03,662 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:03,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [279723143] [2022-04-27 14:38:03,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:38:03,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:03,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:03,664 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:38:03,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-27 14:38:04,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:38:04,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:04,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-27 14:38:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:04,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:05,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {14905#true} call ULTIMATE.init(); {14905#true} is VALID [2022-04-27 14:38:05,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {14905#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14905#true} is VALID [2022-04-27 14:38:05,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-27 14:38:05,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14905#true} {14905#true} #57#return; {14905#true} is VALID [2022-04-27 14:38:05,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {14905#true} call #t~ret6 := main(); {14905#true} is VALID [2022-04-27 14:38:05,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {14905#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {14925#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:05,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {14925#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14925#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:05,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {14925#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {14925#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:05,334 INFO L272 TraceCheckUtils]: 8: Hoare triple {14925#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14905#true} is VALID [2022-04-27 14:38:05,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-27 14:38:05,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-27 14:38:05,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-27 14:38:05,335 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {14905#true} {14925#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {14925#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:05,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {14925#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:38:05,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {14950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:38:05,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {14950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {14950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:38:05,336 INFO L272 TraceCheckUtils]: 16: Hoare triple {14950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14905#true} is VALID [2022-04-27 14:38:05,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-27 14:38:05,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-27 14:38:05,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-27 14:38:05,336 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {14905#true} {14950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #51#return; {14950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:38:05,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {14950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14975#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:38:05,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {14975#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14975#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:38:05,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {14975#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {14975#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:38:05,338 INFO L272 TraceCheckUtils]: 24: Hoare triple {14975#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14905#true} is VALID [2022-04-27 14:38:05,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-27 14:38:05,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-27 14:38:05,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-27 14:38:05,338 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {14905#true} {14975#(and (= main_~y~0 2) (= main_~c~0 2))} #51#return; {14975#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:38:05,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {14975#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15000#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:38:05,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {15000#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15000#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:38:05,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {15000#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {15000#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:38:05,339 INFO L272 TraceCheckUtils]: 32: Hoare triple {15000#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14905#true} is VALID [2022-04-27 14:38:05,339 INFO L290 TraceCheckUtils]: 33: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-27 14:38:05,339 INFO L290 TraceCheckUtils]: 34: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-27 14:38:05,339 INFO L290 TraceCheckUtils]: 35: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-27 14:38:05,340 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14905#true} {15000#(and (= main_~y~0 3) (= main_~c~0 3))} #51#return; {15000#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:38:05,340 INFO L290 TraceCheckUtils]: 37: Hoare triple {15000#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15025#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:05,341 INFO L290 TraceCheckUtils]: 38: Hoare triple {15025#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15025#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:05,341 INFO L290 TraceCheckUtils]: 39: Hoare triple {15025#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {15025#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:05,341 INFO L272 TraceCheckUtils]: 40: Hoare triple {15025#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14905#true} is VALID [2022-04-27 14:38:05,341 INFO L290 TraceCheckUtils]: 41: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-27 14:38:05,341 INFO L290 TraceCheckUtils]: 42: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-27 14:38:05,341 INFO L290 TraceCheckUtils]: 43: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-27 14:38:05,341 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14905#true} {15025#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #51#return; {15025#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:05,342 INFO L290 TraceCheckUtils]: 45: Hoare triple {15025#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15050#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:38:05,342 INFO L290 TraceCheckUtils]: 46: Hoare triple {15050#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15050#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:38:05,343 INFO L290 TraceCheckUtils]: 47: Hoare triple {15050#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !!(#t~post5 < 100);havoc #t~post5; {15050#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:38:05,343 INFO L272 TraceCheckUtils]: 48: Hoare triple {15050#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14905#true} is VALID [2022-04-27 14:38:05,343 INFO L290 TraceCheckUtils]: 49: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-27 14:38:05,343 INFO L290 TraceCheckUtils]: 50: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-27 14:38:05,343 INFO L290 TraceCheckUtils]: 51: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-27 14:38:05,343 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14905#true} {15050#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #51#return; {15050#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:38:05,343 INFO L290 TraceCheckUtils]: 53: Hoare triple {15050#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15075#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:38:05,344 INFO L290 TraceCheckUtils]: 54: Hoare triple {15075#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15075#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:38:05,344 INFO L290 TraceCheckUtils]: 55: Hoare triple {15075#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(#t~post5 < 100);havoc #t~post5; {15075#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:38:05,344 INFO L272 TraceCheckUtils]: 56: Hoare triple {15075#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14905#true} is VALID [2022-04-27 14:38:05,344 INFO L290 TraceCheckUtils]: 57: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-27 14:38:05,344 INFO L290 TraceCheckUtils]: 58: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-27 14:38:05,344 INFO L290 TraceCheckUtils]: 59: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-27 14:38:05,345 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14905#true} {15075#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #51#return; {15075#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:38:05,345 INFO L290 TraceCheckUtils]: 61: Hoare triple {15075#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15100#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:05,345 INFO L290 TraceCheckUtils]: 62: Hoare triple {15100#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15100#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:05,346 INFO L290 TraceCheckUtils]: 63: Hoare triple {15100#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {15100#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:05,346 INFO L272 TraceCheckUtils]: 64: Hoare triple {15100#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14905#true} is VALID [2022-04-27 14:38:05,346 INFO L290 TraceCheckUtils]: 65: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-27 14:38:05,346 INFO L290 TraceCheckUtils]: 66: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-27 14:38:05,346 INFO L290 TraceCheckUtils]: 67: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-27 14:38:05,347 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {14905#true} {15100#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #51#return; {15100#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:05,347 INFO L290 TraceCheckUtils]: 69: Hoare triple {15100#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15125#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:38:05,347 INFO L290 TraceCheckUtils]: 70: Hoare triple {15125#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15125#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:38:05,348 INFO L290 TraceCheckUtils]: 71: Hoare triple {15125#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} assume !!(#t~post5 < 100);havoc #t~post5; {15125#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:38:05,348 INFO L272 TraceCheckUtils]: 72: Hoare triple {15125#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14905#true} is VALID [2022-04-27 14:38:05,348 INFO L290 TraceCheckUtils]: 73: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-27 14:38:05,348 INFO L290 TraceCheckUtils]: 74: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-27 14:38:05,348 INFO L290 TraceCheckUtils]: 75: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-27 14:38:05,348 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {14905#true} {15125#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} #51#return; {15125#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:38:05,349 INFO L290 TraceCheckUtils]: 77: Hoare triple {15125#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15150#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:38:05,349 INFO L290 TraceCheckUtils]: 78: Hoare triple {15150#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ main_~c~0 (- 4))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15150#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:38:05,349 INFO L290 TraceCheckUtils]: 79: Hoare triple {15150#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ main_~c~0 (- 4))))} assume !!(#t~post5 < 100);havoc #t~post5; {15150#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:38:05,349 INFO L272 TraceCheckUtils]: 80: Hoare triple {15150#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14905#true} is VALID [2022-04-27 14:38:05,349 INFO L290 TraceCheckUtils]: 81: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-27 14:38:05,349 INFO L290 TraceCheckUtils]: 82: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-27 14:38:05,349 INFO L290 TraceCheckUtils]: 83: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-27 14:38:05,350 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {14905#true} {15150#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ main_~c~0 (- 4))))} #51#return; {15150#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:38:05,350 INFO L290 TraceCheckUtils]: 85: Hoare triple {15150#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15175#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10))} is VALID [2022-04-27 14:38:05,351 INFO L290 TraceCheckUtils]: 86: Hoare triple {15175#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15175#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10))} is VALID [2022-04-27 14:38:05,351 INFO L290 TraceCheckUtils]: 87: Hoare triple {15175#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10))} assume !!(#t~post5 < 100);havoc #t~post5; {15175#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10))} is VALID [2022-04-27 14:38:05,351 INFO L272 TraceCheckUtils]: 88: Hoare triple {15175#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14905#true} is VALID [2022-04-27 14:38:05,351 INFO L290 TraceCheckUtils]: 89: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-27 14:38:05,351 INFO L290 TraceCheckUtils]: 90: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-27 14:38:05,351 INFO L290 TraceCheckUtils]: 91: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-27 14:38:05,351 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {14905#true} {15175#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10))} #51#return; {15175#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10))} is VALID [2022-04-27 14:38:05,352 INFO L290 TraceCheckUtils]: 93: Hoare triple {15175#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15200#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:38:05,352 INFO L290 TraceCheckUtils]: 94: Hoare triple {15200#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15200#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:38:05,353 INFO L290 TraceCheckUtils]: 95: Hoare triple {15200#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10))} assume !!(#t~post5 < 100);havoc #t~post5; {15200#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:38:05,353 INFO L272 TraceCheckUtils]: 96: Hoare triple {15200#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14905#true} is VALID [2022-04-27 14:38:05,353 INFO L290 TraceCheckUtils]: 97: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-27 14:38:05,353 INFO L290 TraceCheckUtils]: 98: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-27 14:38:05,353 INFO L290 TraceCheckUtils]: 99: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-27 14:38:05,353 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {14905#true} {15200#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10))} #51#return; {15200#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:38:05,354 INFO L290 TraceCheckUtils]: 101: Hoare triple {15200#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15225#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 5))} is VALID [2022-04-27 14:38:05,354 INFO L290 TraceCheckUtils]: 102: Hoare triple {15225#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 5))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15225#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 5))} is VALID [2022-04-27 14:38:05,354 INFO L290 TraceCheckUtils]: 103: Hoare triple {15225#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 5))} assume !!(#t~post5 < 100);havoc #t~post5; {15225#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 5))} is VALID [2022-04-27 14:38:05,354 INFO L272 TraceCheckUtils]: 104: Hoare triple {15225#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14905#true} is VALID [2022-04-27 14:38:05,354 INFO L290 TraceCheckUtils]: 105: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-27 14:38:05,354 INFO L290 TraceCheckUtils]: 106: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-27 14:38:05,354 INFO L290 TraceCheckUtils]: 107: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-27 14:38:05,355 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {14905#true} {15225#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 5))} #51#return; {15225#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 5))} is VALID [2022-04-27 14:38:05,355 INFO L290 TraceCheckUtils]: 109: Hoare triple {15225#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15250#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:38:05,355 INFO L290 TraceCheckUtils]: 110: Hoare triple {15250#(and (= main_~c~0 13) (= main_~y~0 13))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15250#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:38:05,356 INFO L290 TraceCheckUtils]: 111: Hoare triple {15250#(and (= main_~c~0 13) (= main_~y~0 13))} assume !!(#t~post5 < 100);havoc #t~post5; {15250#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:38:05,356 INFO L272 TraceCheckUtils]: 112: Hoare triple {15250#(and (= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14905#true} is VALID [2022-04-27 14:38:05,356 INFO L290 TraceCheckUtils]: 113: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-27 14:38:05,356 INFO L290 TraceCheckUtils]: 114: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-27 14:38:05,356 INFO L290 TraceCheckUtils]: 115: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-27 14:38:05,356 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {14905#true} {15250#(and (= main_~c~0 13) (= main_~y~0 13))} #51#return; {15250#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:38:05,357 INFO L290 TraceCheckUtils]: 117: Hoare triple {15250#(and (= main_~c~0 13) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15275#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:38:05,357 INFO L290 TraceCheckUtils]: 118: Hoare triple {15275#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15275#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:38:05,357 INFO L290 TraceCheckUtils]: 119: Hoare triple {15275#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !!(#t~post5 < 100);havoc #t~post5; {15275#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:38:05,358 INFO L272 TraceCheckUtils]: 120: Hoare triple {15275#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14905#true} is VALID [2022-04-27 14:38:05,358 INFO L290 TraceCheckUtils]: 121: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-27 14:38:05,358 INFO L290 TraceCheckUtils]: 122: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-27 14:38:05,358 INFO L290 TraceCheckUtils]: 123: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-27 14:38:05,358 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {14905#true} {15275#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #51#return; {15275#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:38:05,359 INFO L290 TraceCheckUtils]: 125: Hoare triple {15275#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !(~c~0 < ~k~0); {15300#(and (< 13 main_~k~0) (<= main_~k~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:38:05,360 INFO L272 TraceCheckUtils]: 126: Hoare triple {15300#(and (< 13 main_~k~0) (<= main_~k~0 14) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15304#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:05,360 INFO L290 TraceCheckUtils]: 127: Hoare triple {15304#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15308#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:05,360 INFO L290 TraceCheckUtils]: 128: Hoare triple {15308#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14906#false} is VALID [2022-04-27 14:38:05,360 INFO L290 TraceCheckUtils]: 129: Hoare triple {14906#false} assume !false; {14906#false} is VALID [2022-04-27 14:38:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 30 proven. 420 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-27 14:38:05,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:05,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:05,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238803152] [2022-04-27 14:38:05,656 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:05,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279723143] [2022-04-27 14:38:05,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279723143] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:05,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:05,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-27 14:38:05,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985249400] [2022-04-27 14:38:05,657 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:05,657 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 130 [2022-04-27 14:38:05,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:05,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:38:05,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:38:05,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 14:38:05,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:05,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 14:38:05,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-27 14:38:05,733 INFO L87 Difference]: Start difference. First operand 189 states and 197 transitions. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:38:07,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:07,999 INFO L93 Difference]: Finished difference Result 194 states and 201 transitions. [2022-04-27 14:38:07,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 14:38:07,999 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 130 [2022-04-27 14:38:07,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:38:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 99 transitions. [2022-04-27 14:38:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:38:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 99 transitions. [2022-04-27 14:38:08,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 99 transitions. [2022-04-27 14:38:08,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:38:08,117 INFO L225 Difference]: With dead ends: 194 [2022-04-27 14:38:08,117 INFO L226 Difference]: Without dead ends: 189 [2022-04-27 14:38:08,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-04-27 14:38:08,118 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 2 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 14:38:08,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 828 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 14:38:08,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-27 14:38:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-27 14:38:08,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:08,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0571428571428572) internal successors, (148), 140 states have internal predecessors, (148), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:38:08,242 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0571428571428572) internal successors, (148), 140 states have internal predecessors, (148), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:38:08,242 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0571428571428572) internal successors, (148), 140 states have internal predecessors, (148), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:38:08,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:08,245 INFO L93 Difference]: Finished difference Result 189 states and 196 transitions. [2022-04-27 14:38:08,245 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 196 transitions. [2022-04-27 14:38:08,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:08,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:08,246 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.0571428571428572) internal successors, (148), 140 states have internal predecessors, (148), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:38:08,246 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.0571428571428572) internal successors, (148), 140 states have internal predecessors, (148), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:38:08,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:08,249 INFO L93 Difference]: Finished difference Result 189 states and 196 transitions. [2022-04-27 14:38:08,249 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 196 transitions. [2022-04-27 14:38:08,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:08,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:08,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:08,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0571428571428572) internal successors, (148), 140 states have internal predecessors, (148), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:38:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 196 transitions. [2022-04-27 14:38:08,253 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 196 transitions. Word has length 130 [2022-04-27 14:38:08,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:08,254 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 196 transitions. [2022-04-27 14:38:08,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:38:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 196 transitions. [2022-04-27 14:38:08,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-27 14:38:08,255 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:08,255 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:38:08,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-27 14:38:08,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-27 14:38:08,455 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:08,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:08,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1557719340, now seen corresponding path program 15 times [2022-04-27 14:38:08,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:08,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857359305] [2022-04-27 14:38:08,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:08,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:08,475 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:08,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [626006926] [2022-04-27 14:38:08,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:38:08,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:08,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:08,476 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:38:08,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-27 14:38:09,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-04-27 14:38:09,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:09,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-27 14:38:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:09,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:10,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {16272#true} call ULTIMATE.init(); {16272#true} is VALID [2022-04-27 14:38:10,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {16272#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16272#true} is VALID [2022-04-27 14:38:10,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-27 14:38:10,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16272#true} {16272#true} #57#return; {16272#true} is VALID [2022-04-27 14:38:10,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {16272#true} call #t~ret6 := main(); {16272#true} is VALID [2022-04-27 14:38:10,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {16272#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {16292#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:10,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {16292#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16292#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:10,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {16292#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {16292#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:10,210 INFO L272 TraceCheckUtils]: 8: Hoare triple {16292#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16272#true} is VALID [2022-04-27 14:38:10,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-27 14:38:10,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-27 14:38:10,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-27 14:38:10,210 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16272#true} {16292#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {16292#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:10,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {16292#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16317#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:38:10,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {16317#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16317#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:38:10,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {16317#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 100);havoc #t~post5; {16317#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:38:10,211 INFO L272 TraceCheckUtils]: 16: Hoare triple {16317#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16272#true} is VALID [2022-04-27 14:38:10,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-27 14:38:10,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-27 14:38:10,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-27 14:38:10,212 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16272#true} {16317#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} #51#return; {16317#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:38:10,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {16317#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< 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 + ~x~0; {16342#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:10,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {16342#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16342#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:10,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {16342#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {16342#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:10,214 INFO L272 TraceCheckUtils]: 24: Hoare triple {16342#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16272#true} is VALID [2022-04-27 14:38:10,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-27 14:38:10,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-27 14:38:10,214 INFO L290 TraceCheckUtils]: 27: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-27 14:38:10,215 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16272#true} {16342#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #51#return; {16342#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:10,215 INFO L290 TraceCheckUtils]: 29: Hoare triple {16342#(and (= (+ (- 1) main_~y~0) 1) (< 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 + ~x~0; {16367#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:38:10,216 INFO L290 TraceCheckUtils]: 30: Hoare triple {16367#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16367#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:38:10,216 INFO L290 TraceCheckUtils]: 31: Hoare triple {16367#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {16367#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:38:10,216 INFO L272 TraceCheckUtils]: 32: Hoare triple {16367#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16272#true} is VALID [2022-04-27 14:38:10,216 INFO L290 TraceCheckUtils]: 33: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-27 14:38:10,216 INFO L290 TraceCheckUtils]: 34: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-27 14:38:10,216 INFO L290 TraceCheckUtils]: 35: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-27 14:38:10,217 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16272#true} {16367#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} #51#return; {16367#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:38:10,217 INFO L290 TraceCheckUtils]: 37: Hoare triple {16367#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16392#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,218 INFO L290 TraceCheckUtils]: 38: Hoare triple {16392#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16392#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,218 INFO L290 TraceCheckUtils]: 39: Hoare triple {16392#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {16392#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,218 INFO L272 TraceCheckUtils]: 40: Hoare triple {16392#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16272#true} is VALID [2022-04-27 14:38:10,218 INFO L290 TraceCheckUtils]: 41: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-27 14:38:10,218 INFO L290 TraceCheckUtils]: 42: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-27 14:38:10,218 INFO L290 TraceCheckUtils]: 43: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-27 14:38:10,219 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16272#true} {16392#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} #51#return; {16392#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,219 INFO L290 TraceCheckUtils]: 45: Hoare triple {16392#(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 + ~x~0; {16417#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,220 INFO L290 TraceCheckUtils]: 46: Hoare triple {16417#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16417#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,220 INFO L290 TraceCheckUtils]: 47: Hoare triple {16417#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 0 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {16417#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,220 INFO L272 TraceCheckUtils]: 48: Hoare triple {16417#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16272#true} is VALID [2022-04-27 14:38:10,220 INFO L290 TraceCheckUtils]: 49: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-27 14:38:10,220 INFO L290 TraceCheckUtils]: 50: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-27 14:38:10,220 INFO L290 TraceCheckUtils]: 51: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-27 14:38:10,221 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16272#true} {16417#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 0 main_~k~0))} #51#return; {16417#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,221 INFO L290 TraceCheckUtils]: 53: Hoare triple {16417#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16442#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,221 INFO L290 TraceCheckUtils]: 54: Hoare triple {16442#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16442#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,222 INFO L290 TraceCheckUtils]: 55: Hoare triple {16442#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {16442#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,222 INFO L272 TraceCheckUtils]: 56: Hoare triple {16442#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16272#true} is VALID [2022-04-27 14:38:10,222 INFO L290 TraceCheckUtils]: 57: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-27 14:38:10,222 INFO L290 TraceCheckUtils]: 58: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-27 14:38:10,222 INFO L290 TraceCheckUtils]: 59: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-27 14:38:10,222 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16272#true} {16442#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} #51#return; {16442#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,223 INFO L290 TraceCheckUtils]: 61: Hoare triple {16442#(and (= main_~y~0 6) (= 4 (+ (- 2) 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 + ~x~0; {16467#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,223 INFO L290 TraceCheckUtils]: 62: Hoare triple {16467#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16467#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,223 INFO L290 TraceCheckUtils]: 63: Hoare triple {16467#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4) (< 0 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {16467#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,223 INFO L272 TraceCheckUtils]: 64: Hoare triple {16467#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16272#true} is VALID [2022-04-27 14:38:10,223 INFO L290 TraceCheckUtils]: 65: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-27 14:38:10,224 INFO L290 TraceCheckUtils]: 66: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-27 14:38:10,224 INFO L290 TraceCheckUtils]: 67: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-27 14:38:10,224 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {16272#true} {16467#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4) (< 0 main_~k~0))} #51#return; {16467#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,224 INFO L290 TraceCheckUtils]: 69: Hoare triple {16467#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16492#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,225 INFO L290 TraceCheckUtils]: 70: Hoare triple {16492#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16492#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,225 INFO L290 TraceCheckUtils]: 71: Hoare triple {16492#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {16492#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,225 INFO L272 TraceCheckUtils]: 72: Hoare triple {16492#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16272#true} is VALID [2022-04-27 14:38:10,225 INFO L290 TraceCheckUtils]: 73: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-27 14:38:10,225 INFO L290 TraceCheckUtils]: 74: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-27 14:38:10,225 INFO L290 TraceCheckUtils]: 75: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-27 14:38:10,226 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16272#true} {16492#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} #51#return; {16492#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,226 INFO L290 TraceCheckUtils]: 77: Hoare triple {16492#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16517#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,226 INFO L290 TraceCheckUtils]: 78: Hoare triple {16517#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16517#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,227 INFO L290 TraceCheckUtils]: 79: Hoare triple {16517#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {16517#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,227 INFO L272 TraceCheckUtils]: 80: Hoare triple {16517#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16272#true} is VALID [2022-04-27 14:38:10,227 INFO L290 TraceCheckUtils]: 81: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-27 14:38:10,227 INFO L290 TraceCheckUtils]: 82: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-27 14:38:10,227 INFO L290 TraceCheckUtils]: 83: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-27 14:38:10,227 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {16272#true} {16517#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} #51#return; {16517#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,228 INFO L290 TraceCheckUtils]: 85: Hoare triple {16517#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16542#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,228 INFO L290 TraceCheckUtils]: 86: Hoare triple {16542#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16542#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,229 INFO L290 TraceCheckUtils]: 87: Hoare triple {16542#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {16542#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,229 INFO L272 TraceCheckUtils]: 88: Hoare triple {16542#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16272#true} is VALID [2022-04-27 14:38:10,229 INFO L290 TraceCheckUtils]: 89: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-27 14:38:10,229 INFO L290 TraceCheckUtils]: 90: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-27 14:38:10,229 INFO L290 TraceCheckUtils]: 91: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-27 14:38:10,229 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {16272#true} {16542#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} #51#return; {16542#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,230 INFO L290 TraceCheckUtils]: 93: Hoare triple {16542#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16567#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,230 INFO L290 TraceCheckUtils]: 94: Hoare triple {16567#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16567#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,230 INFO L290 TraceCheckUtils]: 95: Hoare triple {16567#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {16567#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,230 INFO L272 TraceCheckUtils]: 96: Hoare triple {16567#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16272#true} is VALID [2022-04-27 14:38:10,230 INFO L290 TraceCheckUtils]: 97: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-27 14:38:10,230 INFO L290 TraceCheckUtils]: 98: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-27 14:38:10,230 INFO L290 TraceCheckUtils]: 99: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-27 14:38:10,231 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {16272#true} {16567#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} #51#return; {16567#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,231 INFO L290 TraceCheckUtils]: 101: Hoare triple {16567#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16592#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,232 INFO L290 TraceCheckUtils]: 102: Hoare triple {16592#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16592#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,232 INFO L290 TraceCheckUtils]: 103: Hoare triple {16592#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {16592#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,232 INFO L272 TraceCheckUtils]: 104: Hoare triple {16592#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16272#true} is VALID [2022-04-27 14:38:10,232 INFO L290 TraceCheckUtils]: 105: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-27 14:38:10,232 INFO L290 TraceCheckUtils]: 106: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-27 14:38:10,232 INFO L290 TraceCheckUtils]: 107: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-27 14:38:10,233 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {16272#true} {16592#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} #51#return; {16592#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:10,233 INFO L290 TraceCheckUtils]: 109: Hoare triple {16592#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16617#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-27 14:38:10,233 INFO L290 TraceCheckUtils]: 110: Hoare triple {16617#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= main_~y~0 13))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16617#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-27 14:38:10,234 INFO L290 TraceCheckUtils]: 111: Hoare triple {16617#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= main_~y~0 13))} assume !!(#t~post5 < 100);havoc #t~post5; {16617#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-27 14:38:10,234 INFO L272 TraceCheckUtils]: 112: Hoare triple {16617#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16272#true} is VALID [2022-04-27 14:38:10,234 INFO L290 TraceCheckUtils]: 113: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-27 14:38:10,234 INFO L290 TraceCheckUtils]: 114: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-27 14:38:10,234 INFO L290 TraceCheckUtils]: 115: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-27 14:38:10,234 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {16272#true} {16617#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= main_~y~0 13))} #51#return; {16617#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-27 14:38:10,235 INFO L290 TraceCheckUtils]: 117: Hoare triple {16617#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16642#(and (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:38:10,235 INFO L290 TraceCheckUtils]: 118: Hoare triple {16642#(and (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16642#(and (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:38:10,235 INFO L290 TraceCheckUtils]: 119: Hoare triple {16642#(and (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !!(#t~post5 < 100);havoc #t~post5; {16642#(and (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:38:10,236 INFO L272 TraceCheckUtils]: 120: Hoare triple {16642#(and (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16272#true} is VALID [2022-04-27 14:38:10,236 INFO L290 TraceCheckUtils]: 121: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-27 14:38:10,236 INFO L290 TraceCheckUtils]: 122: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-27 14:38:10,236 INFO L290 TraceCheckUtils]: 123: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-27 14:38:10,236 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {16272#true} {16642#(and (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} #51#return; {16642#(and (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:38:10,237 INFO L290 TraceCheckUtils]: 125: Hoare triple {16642#(and (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16667#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-27 14:38:10,237 INFO L290 TraceCheckUtils]: 126: Hoare triple {16667#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16667#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-27 14:38:10,237 INFO L290 TraceCheckUtils]: 127: Hoare triple {16667#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} assume !!(#t~post5 < 100);havoc #t~post5; {16667#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-27 14:38:10,237 INFO L272 TraceCheckUtils]: 128: Hoare triple {16667#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16272#true} is VALID [2022-04-27 14:38:10,237 INFO L290 TraceCheckUtils]: 129: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-27 14:38:10,237 INFO L290 TraceCheckUtils]: 130: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-27 14:38:10,238 INFO L290 TraceCheckUtils]: 131: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-27 14:38:10,238 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {16272#true} {16667#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} #51#return; {16667#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-27 14:38:10,238 INFO L290 TraceCheckUtils]: 133: Hoare triple {16667#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} assume !(~c~0 < ~k~0); {16692#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-27 14:38:10,239 INFO L272 TraceCheckUtils]: 134: Hoare triple {16692#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~k~0 15))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16696#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:10,239 INFO L290 TraceCheckUtils]: 135: Hoare triple {16696#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16700#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:10,240 INFO L290 TraceCheckUtils]: 136: Hoare triple {16700#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16273#false} is VALID [2022-04-27 14:38:10,240 INFO L290 TraceCheckUtils]: 137: Hoare triple {16273#false} assume !false; {16273#false} is VALID [2022-04-27 14:38:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 32 proven. 480 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-27 14:38:10,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:12,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:12,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857359305] [2022-04-27 14:38:12,143 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:12,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626006926] [2022-04-27 14:38:12,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626006926] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:12,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:12,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-27 14:38:12,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235166053] [2022-04-27 14:38:12,143 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:12,144 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Word has length 138 [2022-04-27 14:38:12,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:12,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:38:12,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:38:12,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 14:38:12,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:12,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 14:38:12,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1101, Unknown=0, NotChecked=0, Total=1406 [2022-04-27 14:38:12,226 INFO L87 Difference]: Start difference. First operand 189 states and 196 transitions. Second operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:38:15,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:15,045 INFO L93 Difference]: Finished difference Result 194 states and 200 transitions. [2022-04-27 14:38:15,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 14:38:15,045 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Word has length 138 [2022-04-27 14:38:15,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:38:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 104 transitions. [2022-04-27 14:38:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:38:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 104 transitions. [2022-04-27 14:38:15,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 104 transitions. [2022-04-27 14:38:15,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:38:15,159 INFO L225 Difference]: With dead ends: 194 [2022-04-27 14:38:15,159 INFO L226 Difference]: Without dead ends: 189 [2022-04-27 14:38:15,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 226 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=315, Invalid=1245, Unknown=0, NotChecked=0, Total=1560 [2022-04-27 14:38:15,160 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 2 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:38:15,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 912 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 14:38:15,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-27 14:38:15,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-27 14:38:15,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:15,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.05) internal successors, (147), 140 states have internal predecessors, (147), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:38:15,273 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.05) internal successors, (147), 140 states have internal predecessors, (147), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:38:15,273 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.05) internal successors, (147), 140 states have internal predecessors, (147), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:38:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:15,276 INFO L93 Difference]: Finished difference Result 189 states and 195 transitions. [2022-04-27 14:38:15,276 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 195 transitions. [2022-04-27 14:38:15,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:15,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:15,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.05) internal successors, (147), 140 states have internal predecessors, (147), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:38:15,277 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.05) internal successors, (147), 140 states have internal predecessors, (147), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:38:15,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:15,280 INFO L93 Difference]: Finished difference Result 189 states and 195 transitions. [2022-04-27 14:38:15,280 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 195 transitions. [2022-04-27 14:38:15,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:15,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:15,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:15,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:15,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.05) internal successors, (147), 140 states have internal predecessors, (147), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:38:15,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 195 transitions. [2022-04-27 14:38:15,284 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 195 transitions. Word has length 138 [2022-04-27 14:38:15,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:15,285 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 195 transitions. [2022-04-27 14:38:15,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:38:15,285 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 195 transitions. [2022-04-27 14:38:15,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-27 14:38:15,286 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:15,286 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:38:15,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-27 14:38:15,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-27 14:38:15,493 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:15,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:15,494 INFO L85 PathProgramCache]: Analyzing trace with hash 831286743, now seen corresponding path program 16 times [2022-04-27 14:38:15,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:15,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693466698] [2022-04-27 14:38:15,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:15,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:15,509 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:15,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [433907129] [2022-04-27 14:38:15,509 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:38:15,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:15,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:15,511 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:38:15,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-27 14:38:16,415 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:38:16,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:16,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-27 14:38:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:16,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:17,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {18014#true} call ULTIMATE.init(); {18014#true} is VALID [2022-04-27 14:38:17,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {18014#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18014#true} is VALID [2022-04-27 14:38:17,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {18014#true} assume true; {18014#true} is VALID [2022-04-27 14:38:17,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18014#true} {18014#true} #57#return; {18014#true} is VALID [2022-04-27 14:38:17,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {18014#true} call #t~ret6 := main(); {18014#true} is VALID [2022-04-27 14:38:17,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {18014#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {18034#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:17,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {18034#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18034#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:17,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {18034#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {18034#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:17,230 INFO L272 TraceCheckUtils]: 8: Hoare triple {18034#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18014#true} is VALID [2022-04-27 14:38:17,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {18014#true} ~cond := #in~cond; {18014#true} is VALID [2022-04-27 14:38:17,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {18014#true} assume !(0 == ~cond); {18014#true} is VALID [2022-04-27 14:38:17,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {18014#true} assume true; {18014#true} is VALID [2022-04-27 14:38:17,231 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {18014#true} {18034#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {18034#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:17,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {18034#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18059#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:17,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {18059#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18059#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:17,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {18059#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {18059#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:17,232 INFO L272 TraceCheckUtils]: 16: Hoare triple {18059#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18014#true} is VALID [2022-04-27 14:38:17,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {18014#true} ~cond := #in~cond; {18014#true} is VALID [2022-04-27 14:38:17,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {18014#true} assume !(0 == ~cond); {18014#true} is VALID [2022-04-27 14:38:17,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {18014#true} assume true; {18014#true} is VALID [2022-04-27 14:38:17,232 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {18014#true} {18059#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #51#return; {18059#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:17,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {18059#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18084#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:17,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {18084#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18084#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:17,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {18084#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {18084#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:17,233 INFO L272 TraceCheckUtils]: 24: Hoare triple {18084#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18014#true} is VALID [2022-04-27 14:38:17,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {18014#true} ~cond := #in~cond; {18014#true} is VALID [2022-04-27 14:38:17,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {18014#true} assume !(0 == ~cond); {18014#true} is VALID [2022-04-27 14:38:17,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {18014#true} assume true; {18014#true} is VALID [2022-04-27 14:38:17,234 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {18014#true} {18084#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #51#return; {18084#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:17,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {18084#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18109#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:38:17,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {18109#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18109#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:38:17,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {18109#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {18109#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:38:17,235 INFO L272 TraceCheckUtils]: 32: Hoare triple {18109#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18014#true} is VALID [2022-04-27 14:38:17,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {18014#true} ~cond := #in~cond; {18014#true} is VALID [2022-04-27 14:38:17,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {18014#true} assume !(0 == ~cond); {18014#true} is VALID [2022-04-27 14:38:17,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {18014#true} assume true; {18014#true} is VALID [2022-04-27 14:38:17,236 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18014#true} {18109#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #51#return; {18109#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:38:17,236 INFO L290 TraceCheckUtils]: 37: Hoare triple {18109#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18134#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:38:17,236 INFO L290 TraceCheckUtils]: 38: Hoare triple {18134#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18134#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:38:17,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {18134#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {18134#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:38:17,237 INFO L272 TraceCheckUtils]: 40: Hoare triple {18134#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18014#true} is VALID [2022-04-27 14:38:17,237 INFO L290 TraceCheckUtils]: 41: Hoare triple {18014#true} ~cond := #in~cond; {18014#true} is VALID [2022-04-27 14:38:17,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {18014#true} assume !(0 == ~cond); {18014#true} is VALID [2022-04-27 14:38:17,237 INFO L290 TraceCheckUtils]: 43: Hoare triple {18014#true} assume true; {18014#true} is VALID [2022-04-27 14:38:17,237 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {18014#true} {18134#(and (= main_~y~0 4) (= main_~c~0 4))} #51#return; {18134#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:38:17,238 INFO L290 TraceCheckUtils]: 45: Hoare triple {18134#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18159#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:38:17,238 INFO L290 TraceCheckUtils]: 46: Hoare triple {18159#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18159#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:38:17,238 INFO L290 TraceCheckUtils]: 47: Hoare triple {18159#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 100);havoc #t~post5; {18159#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:38:17,238 INFO L272 TraceCheckUtils]: 48: Hoare triple {18159#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18014#true} is VALID [2022-04-27 14:38:17,238 INFO L290 TraceCheckUtils]: 49: Hoare triple {18014#true} ~cond := #in~cond; {18014#true} is VALID [2022-04-27 14:38:17,238 INFO L290 TraceCheckUtils]: 50: Hoare triple {18014#true} assume !(0 == ~cond); {18014#true} is VALID [2022-04-27 14:38:17,239 INFO L290 TraceCheckUtils]: 51: Hoare triple {18014#true} assume true; {18014#true} is VALID [2022-04-27 14:38:17,239 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18014#true} {18159#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #51#return; {18159#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:38:17,239 INFO L290 TraceCheckUtils]: 53: Hoare triple {18159#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18184#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:17,240 INFO L290 TraceCheckUtils]: 54: Hoare triple {18184#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18184#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:17,240 INFO L290 TraceCheckUtils]: 55: Hoare triple {18184#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {18184#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:17,240 INFO L272 TraceCheckUtils]: 56: Hoare triple {18184#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18014#true} is VALID [2022-04-27 14:38:17,240 INFO L290 TraceCheckUtils]: 57: Hoare triple {18014#true} ~cond := #in~cond; {18014#true} is VALID [2022-04-27 14:38:17,240 INFO L290 TraceCheckUtils]: 58: Hoare triple {18014#true} assume !(0 == ~cond); {18014#true} is VALID [2022-04-27 14:38:17,240 INFO L290 TraceCheckUtils]: 59: Hoare triple {18014#true} assume true; {18014#true} is VALID [2022-04-27 14:38:17,241 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18014#true} {18184#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #51#return; {18184#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:17,241 INFO L290 TraceCheckUtils]: 61: Hoare triple {18184#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18209#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:17,241 INFO L290 TraceCheckUtils]: 62: Hoare triple {18209#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18209#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:17,242 INFO L290 TraceCheckUtils]: 63: Hoare triple {18209#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {18209#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:17,242 INFO L272 TraceCheckUtils]: 64: Hoare triple {18209#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18014#true} is VALID [2022-04-27 14:38:17,242 INFO L290 TraceCheckUtils]: 65: Hoare triple {18014#true} ~cond := #in~cond; {18014#true} is VALID [2022-04-27 14:38:17,242 INFO L290 TraceCheckUtils]: 66: Hoare triple {18014#true} assume !(0 == ~cond); {18014#true} is VALID [2022-04-27 14:38:17,242 INFO L290 TraceCheckUtils]: 67: Hoare triple {18014#true} assume true; {18014#true} is VALID [2022-04-27 14:38:17,242 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18014#true} {18209#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #51#return; {18209#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:17,243 INFO L290 TraceCheckUtils]: 69: Hoare triple {18209#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18234#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:38:17,243 INFO L290 TraceCheckUtils]: 70: Hoare triple {18234#(and (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18234#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:38:17,243 INFO L290 TraceCheckUtils]: 71: Hoare triple {18234#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 100);havoc #t~post5; {18234#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:38:17,243 INFO L272 TraceCheckUtils]: 72: Hoare triple {18234#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18014#true} is VALID [2022-04-27 14:38:17,243 INFO L290 TraceCheckUtils]: 73: Hoare triple {18014#true} ~cond := #in~cond; {18014#true} is VALID [2022-04-27 14:38:17,243 INFO L290 TraceCheckUtils]: 74: Hoare triple {18014#true} assume !(0 == ~cond); {18014#true} is VALID [2022-04-27 14:38:17,244 INFO L290 TraceCheckUtils]: 75: Hoare triple {18014#true} assume true; {18014#true} is VALID [2022-04-27 14:38:17,244 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {18014#true} {18234#(and (= main_~y~0 8) (= main_~c~0 8))} #51#return; {18234#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:38:17,245 INFO L290 TraceCheckUtils]: 77: Hoare triple {18234#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18259#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:38:17,245 INFO L290 TraceCheckUtils]: 78: Hoare triple {18259#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18259#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:38:17,245 INFO L290 TraceCheckUtils]: 79: Hoare triple {18259#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !!(#t~post5 < 100);havoc #t~post5; {18259#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:38:17,245 INFO L272 TraceCheckUtils]: 80: Hoare triple {18259#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18014#true} is VALID [2022-04-27 14:38:17,245 INFO L290 TraceCheckUtils]: 81: Hoare triple {18014#true} ~cond := #in~cond; {18014#true} is VALID [2022-04-27 14:38:17,245 INFO L290 TraceCheckUtils]: 82: Hoare triple {18014#true} assume !(0 == ~cond); {18014#true} is VALID [2022-04-27 14:38:17,245 INFO L290 TraceCheckUtils]: 83: Hoare triple {18014#true} assume true; {18014#true} is VALID [2022-04-27 14:38:17,246 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {18014#true} {18259#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #51#return; {18259#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:38:17,246 INFO L290 TraceCheckUtils]: 85: Hoare triple {18259#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18284#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-27 14:38:17,247 INFO L290 TraceCheckUtils]: 86: Hoare triple {18284#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18284#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-27 14:38:17,247 INFO L290 TraceCheckUtils]: 87: Hoare triple {18284#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !!(#t~post5 < 100);havoc #t~post5; {18284#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-27 14:38:17,247 INFO L272 TraceCheckUtils]: 88: Hoare triple {18284#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18014#true} is VALID [2022-04-27 14:38:17,247 INFO L290 TraceCheckUtils]: 89: Hoare triple {18014#true} ~cond := #in~cond; {18014#true} is VALID [2022-04-27 14:38:17,247 INFO L290 TraceCheckUtils]: 90: Hoare triple {18014#true} assume !(0 == ~cond); {18014#true} is VALID [2022-04-27 14:38:17,247 INFO L290 TraceCheckUtils]: 91: Hoare triple {18014#true} assume true; {18014#true} is VALID [2022-04-27 14:38:17,248 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {18014#true} {18284#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} #51#return; {18284#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-27 14:38:17,248 INFO L290 TraceCheckUtils]: 93: Hoare triple {18284#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18309#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:38:17,248 INFO L290 TraceCheckUtils]: 94: Hoare triple {18309#(and (= main_~c~0 11) (= main_~y~0 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18309#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:38:17,249 INFO L290 TraceCheckUtils]: 95: Hoare triple {18309#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(#t~post5 < 100);havoc #t~post5; {18309#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:38:17,249 INFO L272 TraceCheckUtils]: 96: Hoare triple {18309#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18014#true} is VALID [2022-04-27 14:38:17,249 INFO L290 TraceCheckUtils]: 97: Hoare triple {18014#true} ~cond := #in~cond; {18014#true} is VALID [2022-04-27 14:38:17,249 INFO L290 TraceCheckUtils]: 98: Hoare triple {18014#true} assume !(0 == ~cond); {18014#true} is VALID [2022-04-27 14:38:17,249 INFO L290 TraceCheckUtils]: 99: Hoare triple {18014#true} assume true; {18014#true} is VALID [2022-04-27 14:38:17,254 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {18014#true} {18309#(and (= main_~c~0 11) (= main_~y~0 11))} #51#return; {18309#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:38:17,254 INFO L290 TraceCheckUtils]: 101: Hoare triple {18309#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18334#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:38:17,254 INFO L290 TraceCheckUtils]: 102: Hoare triple {18334#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18334#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:38:17,255 INFO L290 TraceCheckUtils]: 103: Hoare triple {18334#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !!(#t~post5 < 100);havoc #t~post5; {18334#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:38:17,255 INFO L272 TraceCheckUtils]: 104: Hoare triple {18334#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18014#true} is VALID [2022-04-27 14:38:17,255 INFO L290 TraceCheckUtils]: 105: Hoare triple {18014#true} ~cond := #in~cond; {18014#true} is VALID [2022-04-27 14:38:17,255 INFO L290 TraceCheckUtils]: 106: Hoare triple {18014#true} assume !(0 == ~cond); {18014#true} is VALID [2022-04-27 14:38:17,255 INFO L290 TraceCheckUtils]: 107: Hoare triple {18014#true} assume true; {18014#true} is VALID [2022-04-27 14:38:17,255 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18014#true} {18334#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} #51#return; {18334#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:38:17,256 INFO L290 TraceCheckUtils]: 109: Hoare triple {18334#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18359#(and (= 11 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 14:38:17,256 INFO L290 TraceCheckUtils]: 110: Hoare triple {18359#(and (= 11 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18359#(and (= 11 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 14:38:17,256 INFO L290 TraceCheckUtils]: 111: Hoare triple {18359#(and (= 11 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 11))} assume !!(#t~post5 < 100);havoc #t~post5; {18359#(and (= 11 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 14:38:17,256 INFO L272 TraceCheckUtils]: 112: Hoare triple {18359#(and (= 11 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18014#true} is VALID [2022-04-27 14:38:17,256 INFO L290 TraceCheckUtils]: 113: Hoare triple {18014#true} ~cond := #in~cond; {18014#true} is VALID [2022-04-27 14:38:17,257 INFO L290 TraceCheckUtils]: 114: Hoare triple {18014#true} assume !(0 == ~cond); {18014#true} is VALID [2022-04-27 14:38:17,257 INFO L290 TraceCheckUtils]: 115: Hoare triple {18014#true} assume true; {18014#true} is VALID [2022-04-27 14:38:17,257 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {18014#true} {18359#(and (= 11 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 11))} #51#return; {18359#(and (= 11 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 14:38:17,257 INFO L290 TraceCheckUtils]: 117: Hoare triple {18359#(and (= 11 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18384#(and (= (+ main_~y~0 (- 3)) 11) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-27 14:38:17,258 INFO L290 TraceCheckUtils]: 118: Hoare triple {18384#(and (= (+ main_~y~0 (- 3)) 11) (= (+ main_~c~0 (- 3)) 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18384#(and (= (+ main_~y~0 (- 3)) 11) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-27 14:38:17,258 INFO L290 TraceCheckUtils]: 119: Hoare triple {18384#(and (= (+ main_~y~0 (- 3)) 11) (= (+ main_~c~0 (- 3)) 11))} assume !!(#t~post5 < 100);havoc #t~post5; {18384#(and (= (+ main_~y~0 (- 3)) 11) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-27 14:38:17,258 INFO L272 TraceCheckUtils]: 120: Hoare triple {18384#(and (= (+ main_~y~0 (- 3)) 11) (= (+ main_~c~0 (- 3)) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18014#true} is VALID [2022-04-27 14:38:17,258 INFO L290 TraceCheckUtils]: 121: Hoare triple {18014#true} ~cond := #in~cond; {18014#true} is VALID [2022-04-27 14:38:17,258 INFO L290 TraceCheckUtils]: 122: Hoare triple {18014#true} assume !(0 == ~cond); {18014#true} is VALID [2022-04-27 14:38:17,258 INFO L290 TraceCheckUtils]: 123: Hoare triple {18014#true} assume true; {18014#true} is VALID [2022-04-27 14:38:17,259 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {18014#true} {18384#(and (= (+ main_~y~0 (- 3)) 11) (= (+ main_~c~0 (- 3)) 11))} #51#return; {18384#(and (= (+ main_~y~0 (- 3)) 11) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-27 14:38:17,259 INFO L290 TraceCheckUtils]: 125: Hoare triple {18384#(and (= (+ main_~y~0 (- 3)) 11) (= (+ main_~c~0 (- 3)) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18409#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:38:17,259 INFO L290 TraceCheckUtils]: 126: Hoare triple {18409#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18409#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:38:17,260 INFO L290 TraceCheckUtils]: 127: Hoare triple {18409#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} assume !!(#t~post5 < 100);havoc #t~post5; {18409#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:38:17,260 INFO L272 TraceCheckUtils]: 128: Hoare triple {18409#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18014#true} is VALID [2022-04-27 14:38:17,260 INFO L290 TraceCheckUtils]: 129: Hoare triple {18014#true} ~cond := #in~cond; {18014#true} is VALID [2022-04-27 14:38:17,260 INFO L290 TraceCheckUtils]: 130: Hoare triple {18014#true} assume !(0 == ~cond); {18014#true} is VALID [2022-04-27 14:38:17,260 INFO L290 TraceCheckUtils]: 131: Hoare triple {18014#true} assume true; {18014#true} is VALID [2022-04-27 14:38:17,260 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {18014#true} {18409#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} #51#return; {18409#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:38:17,261 INFO L290 TraceCheckUtils]: 133: Hoare triple {18409#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18434#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 14:38:17,261 INFO L290 TraceCheckUtils]: 134: Hoare triple {18434#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18434#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 14:38:17,261 INFO L290 TraceCheckUtils]: 135: Hoare triple {18434#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !!(#t~post5 < 100);havoc #t~post5; {18434#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 14:38:17,261 INFO L272 TraceCheckUtils]: 136: Hoare triple {18434#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18014#true} is VALID [2022-04-27 14:38:17,261 INFO L290 TraceCheckUtils]: 137: Hoare triple {18014#true} ~cond := #in~cond; {18014#true} is VALID [2022-04-27 14:38:17,262 INFO L290 TraceCheckUtils]: 138: Hoare triple {18014#true} assume !(0 == ~cond); {18014#true} is VALID [2022-04-27 14:38:17,262 INFO L290 TraceCheckUtils]: 139: Hoare triple {18014#true} assume true; {18014#true} is VALID [2022-04-27 14:38:17,262 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {18014#true} {18434#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} #51#return; {18434#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 14:38:17,263 INFO L290 TraceCheckUtils]: 141: Hoare triple {18434#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !(~c~0 < ~k~0); {18459#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} is VALID [2022-04-27 14:38:17,264 INFO L272 TraceCheckUtils]: 142: Hoare triple {18459#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18463#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:17,264 INFO L290 TraceCheckUtils]: 143: Hoare triple {18463#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18467#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:17,265 INFO L290 TraceCheckUtils]: 144: Hoare triple {18467#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18015#false} is VALID [2022-04-27 14:38:17,265 INFO L290 TraceCheckUtils]: 145: Hoare triple {18015#false} assume !false; {18015#false} is VALID [2022-04-27 14:38:17,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 34 proven. 544 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-27 14:38:17,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:17,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:17,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693466698] [2022-04-27 14:38:17,642 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:17,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433907129] [2022-04-27 14:38:17,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433907129] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:17,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:17,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-04-27 14:38:17,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754322232] [2022-04-27 14:38:17,642 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:17,642 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 146 [2022-04-27 14:38:17,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:17,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:38:17,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:38:17,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 14:38:17,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:17,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 14:38:17,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-04-27 14:38:17,729 INFO L87 Difference]: Start difference. First operand 189 states and 195 transitions. Second operand has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:38:20,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:20,659 INFO L93 Difference]: Finished difference Result 194 states and 199 transitions. [2022-04-27 14:38:20,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 14:38:20,659 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 146 [2022-04-27 14:38:20,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:20,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:38:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 109 transitions. [2022-04-27 14:38:20,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:38:20,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 109 transitions. [2022-04-27 14:38:20,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 109 transitions. [2022-04-27 14:38:20,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:38:20,788 INFO L225 Difference]: With dead ends: 194 [2022-04-27 14:38:20,788 INFO L226 Difference]: Without dead ends: 189 [2022-04-27 14:38:20,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2022-04-27 14:38:20,789 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:38:20,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1000 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-27 14:38:20,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-27 14:38:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-27 14:38:20,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:20,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.042857142857143) internal successors, (146), 140 states have internal predecessors, (146), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:38:20,905 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.042857142857143) internal successors, (146), 140 states have internal predecessors, (146), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:38:20,905 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.042857142857143) internal successors, (146), 140 states have internal predecessors, (146), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:38:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:20,908 INFO L93 Difference]: Finished difference Result 189 states and 194 transitions. [2022-04-27 14:38:20,908 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 194 transitions. [2022-04-27 14:38:20,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:20,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:20,909 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.042857142857143) internal successors, (146), 140 states have internal predecessors, (146), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:38:20,909 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.042857142857143) internal successors, (146), 140 states have internal predecessors, (146), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:38:20,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:20,912 INFO L93 Difference]: Finished difference Result 189 states and 194 transitions. [2022-04-27 14:38:20,912 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 194 transitions. [2022-04-27 14:38:20,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:20,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:20,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:20,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:20,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.042857142857143) internal successors, (146), 140 states have internal predecessors, (146), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:38:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 194 transitions. [2022-04-27 14:38:20,916 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 194 transitions. Word has length 146 [2022-04-27 14:38:20,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:20,916 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 194 transitions. [2022-04-27 14:38:20,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:38:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 194 transitions. [2022-04-27 14:38:20,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-27 14:38:20,918 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:20,918 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:38:20,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-27 14:38:21,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:21,125 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:21,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:21,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1988619814, now seen corresponding path program 17 times [2022-04-27 14:38:21,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:21,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755732664] [2022-04-27 14:38:21,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:21,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:21,167 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:21,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1843361951] [2022-04-27 14:38:21,167 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:38:21,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:21,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:21,168 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:38:21,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process