/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:51:15,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:51:15,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:51:15,848 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:51:15,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:51:15,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:51:15,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:51:15,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:51:15,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:51:15,860 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:51:15,861 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:51:15,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:51:15,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:51:15,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:51:15,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:51:15,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:51:15,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:51:15,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:51:15,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:51:15,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:51:15,872 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:51:15,875 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:51:15,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:51:15,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:51:15,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:51:15,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:51:15,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:51:15,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:51:15,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:51:15,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:51:15,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:51:15,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:51:15,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:51:15,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:51:15,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:51:15,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:51:15,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:51:15,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:51:15,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:51:15,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:51:15,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:51:15,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:51:15,888 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:51:15,909 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:51:15,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:51:15,909 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:51:15,909 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:51:15,910 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:51:15,910 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:51:15,910 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:51:15,910 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:51:15,910 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:51:15,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:51:15,911 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:51:15,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:51:15,911 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:51:15,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:51:15,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:51:15,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:51:15,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:51:15,912 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:51:15,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:51:15,912 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:51:15,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:51:15,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:51:15,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:51:15,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:51:15,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:51:15,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:51:15,913 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:51:15,913 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:51:15,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:51:15,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:51:15,913 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:51:15,913 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:51:15,913 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:51:15,913 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:51:16,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:51:16,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:51:16,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:51:16,083 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:51:16,083 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:51:16,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound50.c [2022-04-27 14:51:16,129 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00efd3e43/7cea236523a343caa230fd89ce286ea4/FLAG0e75eff30 [2022-04-27 14:51:16,474 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:51:16,475 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound50.c [2022-04-27 14:51:16,487 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00efd3e43/7cea236523a343caa230fd89ce286ea4/FLAG0e75eff30 [2022-04-27 14:51:16,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00efd3e43/7cea236523a343caa230fd89ce286ea4 [2022-04-27 14:51:16,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:51:16,498 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:51:16,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:51:16,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:51:16,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:51:16,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:51:16" (1/1) ... [2022-04-27 14:51:16,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bc8317a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:51:16, skipping insertion in model container [2022-04-27 14:51:16,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:51:16" (1/1) ... [2022-04-27 14:51:16,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:51:16,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:51:16,623 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound50.c[458,471] [2022-04-27 14:51:16,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:51:16,650 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:51:16,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound50.c[458,471] [2022-04-27 14:51:16,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:51:16,672 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:51:16,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:51:16 WrapperNode [2022-04-27 14:51:16,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:51:16,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:51:16,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:51:16,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:51:16,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:51:16" (1/1) ... [2022-04-27 14:51:16,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:51:16" (1/1) ... [2022-04-27 14:51:16,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:51:16" (1/1) ... [2022-04-27 14:51:16,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:51:16" (1/1) ... [2022-04-27 14:51:16,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:51:16" (1/1) ... [2022-04-27 14:51:16,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:51:16" (1/1) ... [2022-04-27 14:51:16,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:51:16" (1/1) ... [2022-04-27 14:51:16,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:51:16,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:51:16,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:51:16,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:51:16,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:51:16" (1/1) ... [2022-04-27 14:51:16,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:51:16,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:51:16,725 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:51:16,739 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:51:16,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:51:16,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:51:16,756 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:51:16,756 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:51:16,756 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:51:16,757 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:51:16,757 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:51:16,757 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:51:16,757 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:51:16,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:51:16,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:51:16,757 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:51:16,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:51:16,757 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:51:16,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:51:16,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:51:16,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:51:16,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:51:16,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:51:16,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:51:16,800 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:51:16,801 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:51:16,894 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:51:16,899 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:51:16,899 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:51:16,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:51:16 BoogieIcfgContainer [2022-04-27 14:51:16,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:51:16,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:51:16,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:51:16,915 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:51:16,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:51:16" (1/3) ... [2022-04-27 14:51:16,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bdff0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:51:16, skipping insertion in model container [2022-04-27 14:51:16,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:51:16" (2/3) ... [2022-04-27 14:51:16,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bdff0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:51:16, skipping insertion in model container [2022-04-27 14:51:16,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:51:16" (3/3) ... [2022-04-27 14:51:16,917 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound50.c [2022-04-27 14:51:16,927 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:51:16,927 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:51:16,961 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:51:16,966 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@6609302, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1438c182 [2022-04-27 14:51:16,966 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:51:16,972 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:51:16,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:51:16,990 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:51:16,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:51:16,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:51:16,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:51:16,994 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-27 14:51:17,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:51:17,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406737718] [2022-04-27 14:51:17,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:17,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:51:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:17,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:51:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:17,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(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; {32#true} is VALID [2022-04-27 14:51:17,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:51:17,153 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-27 14:51:17,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:51:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:17,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:51:17,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:51:17,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:51:17,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:51:17,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:51:17,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(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; {32#true} is VALID [2022-04-27 14:51:17,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:51:17,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-27 14:51:17,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-27 14:51:17,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-27 14:51:17,170 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-27 14:51:17,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:51:17,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:51:17,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:51:17,171 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:51:17,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-27 14:51:17,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-27 14:51:17,172 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {33#false} is VALID [2022-04-27 14:51:17,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-27 14:51:17,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-27 14:51:17,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-27 14:51:17,174 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:51:17,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:51:17,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406737718] [2022-04-27 14:51:17,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406737718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:51:17,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:51:17,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:51:17,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56307939] [2022-04-27 14:51:17,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:51:17,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:51:17,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:51:17,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:51:17,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:17,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:51:17,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:51:17,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:51:17,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:51:17,237 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:51:17,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:17,583 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-27 14:51:17,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:51:17,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:51:17,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:51:17,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:51:17,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-27 14:51:17,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:51:17,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-27 14:51:17,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-27 14:51:17,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:17,659 INFO L225 Difference]: With dead ends: 50 [2022-04-27 14:51:17,659 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 14:51:17,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:51:17,663 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:51:17,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:51:17,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 14:51:17,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-27 14:51:17,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:51:17,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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:51:17,682 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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:51:17,683 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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:51:17,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:17,685 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 14:51:17,685 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 14:51:17,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:17,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:17,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 25 states. [2022-04-27 14:51:17,686 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 25 states. [2022-04-27 14:51:17,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:17,688 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 14:51:17,688 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 14:51:17,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:17,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:17,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:51:17,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:51:17,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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:51:17,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-27 14:51:17,692 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-27 14:51:17,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:51:17,692 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-27 14:51:17,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:51:17,692 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:51:17,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 14:51:17,693 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:51:17,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:51:17,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:51:17,693 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:51:17,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:51:17,694 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-27 14:51:17,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:51:17,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541249454] [2022-04-27 14:51:17,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:17,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:51:17,707 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:51:17,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1685082185] [2022-04-27 14:51:17,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:17,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:51:17,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:51:17,709 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:51:17,710 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:51:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:17,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 14:51:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:17,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:51:17,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2022-04-27 14:51:17,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#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; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:17,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#(<= ~counter~0 0)} assume true; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:17,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204#(<= ~counter~0 0)} {196#true} #61#return; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:17,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {204#(<= ~counter~0 0)} call #t~ret6 := main(); {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:17,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {204#(<= ~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; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:17,858 INFO L272 TraceCheckUtils]: 6: Hoare triple {204#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:17,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {204#(<= ~counter~0 0)} ~cond := #in~cond; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:17,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#(<= ~counter~0 0)} assume !(0 == ~cond); {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:17,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#(<= ~counter~0 0)} assume true; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:17,860 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {204#(<= ~counter~0 0)} {204#(<= ~counter~0 0)} #53#return; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:17,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {204#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:17,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {204#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {238#(<= |main_#t~post5| 0)} is VALID [2022-04-27 14:51:17,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {238#(<= |main_#t~post5| 0)} assume !(#t~post5 < 50);havoc #t~post5; {197#false} is VALID [2022-04-27 14:51:17,861 INFO L272 TraceCheckUtils]: 14: Hoare triple {197#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {197#false} is VALID [2022-04-27 14:51:17,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {197#false} ~cond := #in~cond; {197#false} is VALID [2022-04-27 14:51:17,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {197#false} assume 0 == ~cond; {197#false} is VALID [2022-04-27 14:51:17,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {197#false} assume !false; {197#false} is VALID [2022-04-27 14:51:17,862 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:51:17,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:51:17,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:51:17,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541249454] [2022-04-27 14:51:17,862 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:51:17,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685082185] [2022-04-27 14:51:17,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685082185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:51:17,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:51:17,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:51:17,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089581872] [2022-04-27 14:51:17,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:51:17,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 14:51:17,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:51:17,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:51:17,876 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:51:17,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 14:51:17,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:51:17,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 14:51:17,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:51:17,878 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:51:17,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:17,991 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 14:51:17,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 14:51:17,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 14:51:17,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:51:17,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:51:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 14:51:17,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:51:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 14:51:17,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-27 14:51:18,026 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:51:18,027 INFO L225 Difference]: With dead ends: 34 [2022-04-27 14:51:18,028 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 14:51:18,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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:51:18,029 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 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:51:18,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:51:18,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 14:51:18,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 14:51:18,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:51:18,035 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:51:18,035 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:51:18,035 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:51:18,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:18,037 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:51:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:51:18,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:18,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:18,038 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:51:18,038 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:51:18,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:18,039 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:51:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:51:18,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:18,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:18,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:51:18,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:51:18,040 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:51:18,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-27 14:51:18,042 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-27 14:51:18,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:51:18,042 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-27 14:51:18,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:51:18,042 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:51:18,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 14:51:18,042 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:51:18,042 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:51:18,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 14:51:18,255 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:51:18,255 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:51:18,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:51:18,256 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-27 14:51:18,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:51:18,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063960473] [2022-04-27 14:51:18,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:18,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:51:18,273 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:51:18,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [527905358] [2022-04-27 14:51:18,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:18,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:51:18,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:51:18,276 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:51:18,278 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:51:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:18,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:51:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:18,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:51:18,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {392#true} call ULTIMATE.init(); {392#true} is VALID [2022-04-27 14:51:18,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {392#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; {392#true} is VALID [2022-04-27 14:51:18,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {392#true} assume true; {392#true} is VALID [2022-04-27 14:51:18,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {392#true} {392#true} #61#return; {392#true} is VALID [2022-04-27 14:51:18,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {392#true} call #t~ret6 := main(); {392#true} is VALID [2022-04-27 14:51:18,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {392#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; {392#true} is VALID [2022-04-27 14:51:18,432 INFO L272 TraceCheckUtils]: 6: Hoare triple {392#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {392#true} is VALID [2022-04-27 14:51:18,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {392#true} ~cond := #in~cond; {392#true} is VALID [2022-04-27 14:51:18,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {392#true} assume !(0 == ~cond); {392#true} is VALID [2022-04-27 14:51:18,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {392#true} assume true; {392#true} is VALID [2022-04-27 14:51:18,436 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {392#true} {392#true} #53#return; {392#true} is VALID [2022-04-27 14:51:18,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {392#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {430#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:18,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {430#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {430#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:18,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {430#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {430#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:18,440 INFO L272 TraceCheckUtils]: 14: Hoare triple {430#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {440#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:51:18,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {440#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {444#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:51:18,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {444#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {393#false} is VALID [2022-04-27 14:51:18,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {393#false} assume !false; {393#false} is VALID [2022-04-27 14:51:18,441 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:51:18,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:51:18,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:51:18,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063960473] [2022-04-27 14:51:18,443 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:51:18,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527905358] [2022-04-27 14:51:18,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527905358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:51:18,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:51:18,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:51:18,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472116416] [2022-04-27 14:51:18,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:51:18,444 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), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 14:51:18,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:51:18,444 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:51:18,456 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:51:18,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:51:18,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:51:18,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:51:18,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:51:18,457 INFO L87 Difference]: Start difference. First operand 26 states and 29 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:51:18,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:18,577 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 14:51:18,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:51:18,577 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), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 14:51:18,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:51:18,578 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:51:18,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-27 14:51:18,582 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:51:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-27 14:51:18,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-27 14:51:18,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:18,627 INFO L225 Difference]: With dead ends: 36 [2022-04-27 14:51:18,627 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 14:51:18,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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:51:18,628 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:51:18,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:51:18,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 14:51:18,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 14:51:18,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:51:18,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:51:18,644 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:51:18,645 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:51:18,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:18,646 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-27 14:51:18,646 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 14:51:18,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:18,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:18,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-27 14:51:18,647 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-27 14:51:18,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:18,648 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-27 14:51:18,648 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 14:51:18,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:18,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:18,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:51:18,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:51:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:51:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-27 14:51:18,650 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-27 14:51:18,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:51:18,650 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-27 14:51:18,651 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:51:18,651 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 14:51:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 14:51:18,651 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:51:18,651 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:51:18,667 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:51:18,863 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:51:18,863 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:51:18,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:51:18,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-27 14:51:18,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:51:18,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126449445] [2022-04-27 14:51:18,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:18,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:51:18,883 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:51:18,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [963154529] [2022-04-27 14:51:18,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:18,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:51:18,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:51:18,884 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:51:18,914 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:51:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:18,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:51:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:18,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:51:19,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {614#true} call ULTIMATE.init(); {614#true} is VALID [2022-04-27 14:51:19,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#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; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:19,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#(<= ~counter~0 0)} assume true; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:19,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {622#(<= ~counter~0 0)} {614#true} #61#return; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:19,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {622#(<= ~counter~0 0)} call #t~ret6 := main(); {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:19,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {622#(<= ~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; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:19,068 INFO L272 TraceCheckUtils]: 6: Hoare triple {622#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:19,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {622#(<= ~counter~0 0)} ~cond := #in~cond; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:19,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {622#(<= ~counter~0 0)} assume !(0 == ~cond); {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:19,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {622#(<= ~counter~0 0)} assume true; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:19,070 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {622#(<= ~counter~0 0)} {622#(<= ~counter~0 0)} #53#return; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:19,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {622#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:19,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {622#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:19,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {656#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:19,071 INFO L272 TraceCheckUtils]: 14: Hoare triple {656#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:19,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {656#(<= ~counter~0 1)} ~cond := #in~cond; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:19,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {656#(<= ~counter~0 1)} assume !(0 == ~cond); {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:19,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {656#(<= ~counter~0 1)} assume true; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:19,080 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {656#(<= ~counter~0 1)} {656#(<= ~counter~0 1)} #55#return; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:19,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {656#(<= ~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 * ~y~0 * ~y~0 + ~x~0; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:19,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {656#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {681#(<= |main_#t~post5| 1)} is VALID [2022-04-27 14:51:19,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {681#(<= |main_#t~post5| 1)} assume !(#t~post5 < 50);havoc #t~post5; {615#false} is VALID [2022-04-27 14:51:19,081 INFO L272 TraceCheckUtils]: 22: Hoare triple {615#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {615#false} is VALID [2022-04-27 14:51:19,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {615#false} ~cond := #in~cond; {615#false} is VALID [2022-04-27 14:51:19,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {615#false} assume 0 == ~cond; {615#false} is VALID [2022-04-27 14:51:19,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {615#false} assume !false; {615#false} is VALID [2022-04-27 14:51:19,082 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:51:19,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:51:19,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {615#false} assume !false; {615#false} is VALID [2022-04-27 14:51:19,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {615#false} assume 0 == ~cond; {615#false} is VALID [2022-04-27 14:51:19,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {615#false} ~cond := #in~cond; {615#false} is VALID [2022-04-27 14:51:19,210 INFO L272 TraceCheckUtils]: 22: Hoare triple {615#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {615#false} is VALID [2022-04-27 14:51:19,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {709#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {615#false} is VALID [2022-04-27 14:51:19,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {713#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {709#(< |main_#t~post5| 50)} is VALID [2022-04-27 14:51:19,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {713#(< ~counter~0 50)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {713#(< ~counter~0 50)} is VALID [2022-04-27 14:51:19,211 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {614#true} {713#(< ~counter~0 50)} #55#return; {713#(< ~counter~0 50)} is VALID [2022-04-27 14:51:19,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#true} assume true; {614#true} is VALID [2022-04-27 14:51:19,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {614#true} assume !(0 == ~cond); {614#true} is VALID [2022-04-27 14:51:19,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {614#true} ~cond := #in~cond; {614#true} is VALID [2022-04-27 14:51:19,212 INFO L272 TraceCheckUtils]: 14: Hoare triple {713#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {614#true} is VALID [2022-04-27 14:51:19,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {713#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {713#(< ~counter~0 50)} is VALID [2022-04-27 14:51:19,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {738#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {713#(< ~counter~0 50)} is VALID [2022-04-27 14:51:19,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {738#(< ~counter~0 49)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {738#(< ~counter~0 49)} is VALID [2022-04-27 14:51:19,213 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {614#true} {738#(< ~counter~0 49)} #53#return; {738#(< ~counter~0 49)} is VALID [2022-04-27 14:51:19,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {614#true} assume true; {614#true} is VALID [2022-04-27 14:51:19,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {614#true} assume !(0 == ~cond); {614#true} is VALID [2022-04-27 14:51:19,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {614#true} ~cond := #in~cond; {614#true} is VALID [2022-04-27 14:51:19,214 INFO L272 TraceCheckUtils]: 6: Hoare triple {738#(< ~counter~0 49)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {614#true} is VALID [2022-04-27 14:51:19,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#(< ~counter~0 49)} 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; {738#(< ~counter~0 49)} is VALID [2022-04-27 14:51:19,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#(< ~counter~0 49)} call #t~ret6 := main(); {738#(< ~counter~0 49)} is VALID [2022-04-27 14:51:19,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#(< ~counter~0 49)} {614#true} #61#return; {738#(< ~counter~0 49)} is VALID [2022-04-27 14:51:19,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#(< ~counter~0 49)} assume true; {738#(< ~counter~0 49)} is VALID [2022-04-27 14:51:19,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#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; {738#(< ~counter~0 49)} is VALID [2022-04-27 14:51:19,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {614#true} call ULTIMATE.init(); {614#true} is VALID [2022-04-27 14:51:19,217 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:51:19,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:51:19,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126449445] [2022-04-27 14:51:19,218 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:51:19,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963154529] [2022-04-27 14:51:19,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963154529] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:51:19,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:51:19,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 14:51:19,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234122819] [2022-04-27 14:51:19,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:51:19,219 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2022-04-27 14:51:19,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:51:19,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:51:19,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:19,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:51:19,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:51:19,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:51:19,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:51:19,256 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:51:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:19,406 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-27 14:51:19,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:51:19,406 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2022-04-27 14:51:19,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:51:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:51:19,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-04-27 14:51:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:51:19,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-04-27 14:51:19,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 76 transitions. [2022-04-27 14:51:19,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:19,467 INFO L225 Difference]: With dead ends: 66 [2022-04-27 14:51:19,467 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 14:51:19,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 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:51:19,468 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:51:19,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:51:19,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 14:51:19,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2022-04-27 14:51:19,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:51:19,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:51:19,481 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:51:19,482 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:51:19,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:19,484 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-04-27 14:51:19,484 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-27 14:51:19,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:19,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:19,485 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 58 states. [2022-04-27 14:51:19,485 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 58 states. [2022-04-27 14:51:19,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:19,487 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-04-27 14:51:19,487 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-27 14:51:19,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:19,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:19,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:51:19,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:51:19,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:51:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-27 14:51:19,489 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 26 [2022-04-27 14:51:19,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:51:19,489 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-27 14:51:19,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:51:19,490 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 14:51:19,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 14:51:19,490 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:51:19,490 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:51:19,506 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:51:19,706 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:51:19,706 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:51:19,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:51:19,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-27 14:51:19,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:51:19,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332895601] [2022-04-27 14:51:19,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:19,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:51:19,718 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:51:19,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1702464172] [2022-04-27 14:51:19,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:19,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:51:19,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:51:19,719 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:51:19,720 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:51:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:19,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:51:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:19,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:51:19,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {1072#true} call ULTIMATE.init(); {1072#true} is VALID [2022-04-27 14:51:19,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#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; {1072#true} is VALID [2022-04-27 14:51:19,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:51:19,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1072#true} {1072#true} #61#return; {1072#true} is VALID [2022-04-27 14:51:19,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {1072#true} call #t~ret6 := main(); {1072#true} is VALID [2022-04-27 14:51:19,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {1072#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; {1072#true} is VALID [2022-04-27 14:51:19,883 INFO L272 TraceCheckUtils]: 6: Hoare triple {1072#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1072#true} is VALID [2022-04-27 14:51:19,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-27 14:51:19,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-27 14:51:19,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:51:19,884 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1072#true} {1072#true} #53#return; {1072#true} is VALID [2022-04-27 14:51:19,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {1072#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:19,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:19,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:19,886 INFO L272 TraceCheckUtils]: 14: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1072#true} is VALID [2022-04-27 14:51:19,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-27 14:51:19,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-27 14:51:19,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:51:19,891 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1072#true} {1110#(and (= main_~x~0 0) (= main_~y~0 0))} #55#return; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:19,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:51:19,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:51:19,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:51:19,893 INFO L272 TraceCheckUtils]: 22: Hoare triple {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:51:19,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1149#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:51:19,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1073#false} is VALID [2022-04-27 14:51:19,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {1073#false} assume !false; {1073#false} is VALID [2022-04-27 14:51:19,894 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:51:19,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:51:20,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {1073#false} assume !false; {1073#false} is VALID [2022-04-27 14:51:20,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1073#false} is VALID [2022-04-27 14:51:20,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1149#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:51:20,026 INFO L272 TraceCheckUtils]: 22: Hoare triple {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:51:20,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:51:20,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:51:20,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:51:20,141 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1072#true} {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #55#return; {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:51:20,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:51:20,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-27 14:51:20,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-27 14:51:20,141 INFO L272 TraceCheckUtils]: 14: Hoare triple {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1072#true} is VALID [2022-04-27 14:51:20,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:51:20,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:51:20,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {1072#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:51:20,143 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1072#true} {1072#true} #53#return; {1072#true} is VALID [2022-04-27 14:51:20,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:51:20,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-27 14:51:20,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-27 14:51:20,143 INFO L272 TraceCheckUtils]: 6: Hoare triple {1072#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1072#true} is VALID [2022-04-27 14:51:20,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {1072#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; {1072#true} is VALID [2022-04-27 14:51:20,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {1072#true} call #t~ret6 := main(); {1072#true} is VALID [2022-04-27 14:51:20,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1072#true} {1072#true} #61#return; {1072#true} is VALID [2022-04-27 14:51:20,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:51:20,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#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; {1072#true} is VALID [2022-04-27 14:51:20,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {1072#true} call ULTIMATE.init(); {1072#true} is VALID [2022-04-27 14:51:20,144 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:51:20,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:51:20,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332895601] [2022-04-27 14:51:20,144 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:51:20,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702464172] [2022-04-27 14:51:20,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702464172] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:51:20,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:51:20,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:51:20,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636617305] [2022-04-27 14:51:20,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:51:20,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 14:51:20,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:51:20,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:51:20,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:20,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:51:20,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:51:20,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:51:20,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:51:20,293 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:51:20,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:20,404 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-27 14:51:20,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:51:20,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 14:51:20,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:51:20,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:51:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:51:20,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:51:20,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:51:20,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-27 14:51:20,508 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:51:20,510 INFO L225 Difference]: With dead ends: 68 [2022-04-27 14:51:20,511 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 14:51:20,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 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:51:20,511 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:51:20,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:51:20,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 14:51:20,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-04-27 14:51:20,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:51:20,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:51:20,529 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:51:20,529 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:51:20,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:20,531 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-04-27 14:51:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-04-27 14:51:20,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:20,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:20,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 60 states. [2022-04-27 14:51:20,532 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 60 states. [2022-04-27 14:51:20,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:20,534 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-04-27 14:51:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-04-27 14:51:20,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:20,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:20,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:51:20,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:51:20,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:51:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-04-27 14:51:20,536 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 26 [2022-04-27 14:51:20,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:51:20,536 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-04-27 14:51:20,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:51:20,536 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-27 14:51:20,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 14:51:20,537 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:51:20,537 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:51:20,543 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:51:20,740 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:51:20,741 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:51:20,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:51:20,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-27 14:51:20,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:51:20,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060032752] [2022-04-27 14:51:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:20,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:51:20,751 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:51:20,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2026191200] [2022-04-27 14:51:20,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:20,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:51:20,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:51:20,752 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:51:20,753 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:51:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:20,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 14:51:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:20,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:51:21,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {1530#true} call ULTIMATE.init(); {1530#true} is VALID [2022-04-27 14:51:21,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {1530#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; {1530#true} is VALID [2022-04-27 14:51:21,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:51:21,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1530#true} {1530#true} #61#return; {1530#true} is VALID [2022-04-27 14:51:21,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {1530#true} call #t~ret6 := main(); {1530#true} is VALID [2022-04-27 14:51:21,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {1530#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; {1530#true} is VALID [2022-04-27 14:51:21,092 INFO L272 TraceCheckUtils]: 6: Hoare triple {1530#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1530#true} is VALID [2022-04-27 14:51:21,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-27 14:51:21,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-27 14:51:21,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:51:21,092 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1530#true} {1530#true} #53#return; {1530#true} is VALID [2022-04-27 14:51:21,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {1530#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:21,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:21,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:21,094 INFO L272 TraceCheckUtils]: 14: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1530#true} is VALID [2022-04-27 14:51:21,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-27 14:51:21,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-27 14:51:21,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:51:21,097 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1530#true} {1568#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:21,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:51:21,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:51:21,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:51:21,100 INFO L272 TraceCheckUtils]: 22: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1530#true} is VALID [2022-04-27 14:51:21,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-27 14:51:21,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-27 14:51:21,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:51:21,101 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1530#true} {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #55#return; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:51:21,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:51:21,101 INFO L272 TraceCheckUtils]: 28: Hoare triple {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1530#true} is VALID [2022-04-27 14:51:21,102 INFO L290 TraceCheckUtils]: 29: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-27 14:51:21,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-27 14:51:21,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:51:21,102 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1530#true} {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #57#return; {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:51:21,103 INFO L272 TraceCheckUtils]: 33: Hoare triple {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:51:21,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {1637#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:51:21,104 INFO L290 TraceCheckUtils]: 35: Hoare triple {1641#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1531#false} is VALID [2022-04-27 14:51:21,104 INFO L290 TraceCheckUtils]: 36: Hoare triple {1531#false} assume !false; {1531#false} is VALID [2022-04-27 14:51:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:51:21,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:51:21,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:51:21,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060032752] [2022-04-27 14:51:21,367 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:51:21,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026191200] [2022-04-27 14:51:21,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026191200] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:51:21,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:51:21,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 14:51:21,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511819440] [2022-04-27 14:51:21,367 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:51:21,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-27 14:51:21,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:51:21,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:51:21,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:21,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 14:51:21,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:51:21,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 14:51:21,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:51:21,390 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:51:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:21,580 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-04-27 14:51:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:51:21,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-27 14:51:21,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:51:21,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:51:21,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-27 14:51:21,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:51:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-27 14:51:21,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-27 14:51:21,611 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:51:21,612 INFO L225 Difference]: With dead ends: 59 [2022-04-27 14:51:21,612 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 14:51:21,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:51:21,613 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:51:21,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:51:21,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 14:51:21,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-27 14:51:21,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:51:21,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:51:21,639 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:51:21,639 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:51:21,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:21,640 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-27 14:51:21,640 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 14:51:21,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:21,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:21,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-27 14:51:21,641 INFO L87 Difference]: Start difference. First operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-27 14:51:21,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:21,642 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-27 14:51:21,642 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 14:51:21,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:21,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:21,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:51:21,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:51:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:51:21,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-04-27 14:51:21,644 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 37 [2022-04-27 14:51:21,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:51:21,644 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-04-27 14:51:21,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:51:21,644 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 14:51:21,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 14:51:21,645 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:51:21,645 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:51:21,663 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:51:21,859 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:51:21,859 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:51:21,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:51:21,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 2 times [2022-04-27 14:51:21,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:51:21,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719570322] [2022-04-27 14:51:21,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:21,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:51:21,869 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:51:21,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1102933770] [2022-04-27 14:51:21,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:51:21,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:51:21,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:51:21,870 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:51:21,871 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:51:21,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:51:21,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:51:21,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 14:51:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:21,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:51:22,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {1978#true} call ULTIMATE.init(); {1978#true} is VALID [2022-04-27 14:51:22,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {1978#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; {1978#true} is VALID [2022-04-27 14:51:22,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:51:22,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1978#true} {1978#true} #61#return; {1978#true} is VALID [2022-04-27 14:51:22,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {1978#true} call #t~ret6 := main(); {1978#true} is VALID [2022-04-27 14:51:22,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {1978#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; {1978#true} is VALID [2022-04-27 14:51:22,216 INFO L272 TraceCheckUtils]: 6: Hoare triple {1978#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1978#true} is VALID [2022-04-27 14:51:22,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:51:22,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:51:22,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:51:22,217 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1978#true} {1978#true} #53#return; {1978#true} is VALID [2022-04-27 14:51:22,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {1978#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:22,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:22,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:22,218 INFO L272 TraceCheckUtils]: 14: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1978#true} is VALID [2022-04-27 14:51:22,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:51:22,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:51:22,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:51:22,218 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1978#true} {2016#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:22,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:51:22,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:51:22,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:51:22,219 INFO L272 TraceCheckUtils]: 22: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1978#true} is VALID [2022-04-27 14:51:22,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:51:22,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:51:22,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:51:22,220 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1978#true} {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:51:22,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:51:22,221 INFO L290 TraceCheckUtils]: 28: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:51:22,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !!(#t~post5 < 50);havoc #t~post5; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:51:22,221 INFO L272 TraceCheckUtils]: 30: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1978#true} is VALID [2022-04-27 14:51:22,222 INFO L290 TraceCheckUtils]: 31: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:51:22,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:51:22,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:51:22,222 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1978#true} {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #55#return; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:51:22,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-27 14:51:22,223 INFO L272 TraceCheckUtils]: 36: Hoare triple {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1978#true} is VALID [2022-04-27 14:51:22,223 INFO L290 TraceCheckUtils]: 37: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:51:22,223 INFO L290 TraceCheckUtils]: 38: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:51:22,223 INFO L290 TraceCheckUtils]: 39: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:51:22,223 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1978#true} {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} #57#return; {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-27 14:51:22,228 INFO L272 TraceCheckUtils]: 41: Hoare triple {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2110#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:51:22,228 INFO L290 TraceCheckUtils]: 42: Hoare triple {2110#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2114#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:51:22,229 INFO L290 TraceCheckUtils]: 43: Hoare triple {2114#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1979#false} is VALID [2022-04-27 14:51:22,229 INFO L290 TraceCheckUtils]: 44: Hoare triple {1979#false} assume !false; {1979#false} is VALID [2022-04-27 14:51:22,230 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:51:22,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:51:22,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:51:22,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719570322] [2022-04-27 14:51:22,534 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:51:22,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102933770] [2022-04-27 14:51:22,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102933770] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:51:22,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:51:22,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 14:51:22,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255324288] [2022-04-27 14:51:22,535 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:51:22,535 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-27 14:51:22,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:51:22,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:51:22,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:22,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:51:22,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:51:22,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:51:22,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:51:22,560 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:51:22,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:22,839 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-04-27 14:51:22,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:51:22,840 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-27 14:51:22,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:51:22,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:51:22,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-27 14:51:22,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:51:22,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-27 14:51:22,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-27 14:51:22,877 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:51:22,877 INFO L225 Difference]: With dead ends: 58 [2022-04-27 14:51:22,877 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 14:51:22,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:51:22,878 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:51:22,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:51:22,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 14:51:22,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-27 14:51:22,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:51:22,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:51:22,899 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:51:22,899 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:51:22,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:22,901 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-27 14:51:22,901 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-27 14:51:22,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:22,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:22,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-27 14:51:22,903 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-27 14:51:22,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:22,904 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-27 14:51:22,904 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-27 14:51:22,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:22,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:22,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:51:22,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:51:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:51:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-27 14:51:22,905 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 45 [2022-04-27 14:51:22,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:51:22,906 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-27 14:51:22,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:51:22,906 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-27 14:51:22,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-27 14:51:22,907 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:51:22,907 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:51:22,913 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:51:23,113 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:51:23,114 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:51:23,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:51:23,114 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 3 times [2022-04-27 14:51:23,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:51:23,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205989048] [2022-04-27 14:51:23,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:23,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:51:23,127 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:51:23,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1914816383] [2022-04-27 14:51:23,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:51:23,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:51:23,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:51:23,143 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:51:23,144 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:51:23,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:51:23,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:51:23,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 14:51:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:23,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:51:23,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {2445#true} call ULTIMATE.init(); {2445#true} is VALID [2022-04-27 14:51:23,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {2445#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; {2445#true} is VALID [2022-04-27 14:51:23,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:51:23,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2445#true} {2445#true} #61#return; {2445#true} is VALID [2022-04-27 14:51:23,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {2445#true} call #t~ret6 := main(); {2445#true} is VALID [2022-04-27 14:51:23,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {2445#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; {2445#true} is VALID [2022-04-27 14:51:23,877 INFO L272 TraceCheckUtils]: 6: Hoare triple {2445#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2445#true} is VALID [2022-04-27 14:51:23,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:51:23,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:51:23,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:51:23,877 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2445#true} {2445#true} #53#return; {2445#true} is VALID [2022-04-27 14:51:23,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {2445#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:23,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {2483#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:23,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {2483#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:23,881 INFO L272 TraceCheckUtils]: 14: Hoare triple {2483#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2445#true} is VALID [2022-04-27 14:51:23,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:51:23,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:51:23,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:51:23,882 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2445#true} {2483#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:23,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {2483#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:51:23,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:51:23,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:51:23,883 INFO L272 TraceCheckUtils]: 22: Hoare triple {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2445#true} is VALID [2022-04-27 14:51:23,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:51:23,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:51:23,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:51:23,884 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2445#true} {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:51:23,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:51:23,885 INFO L290 TraceCheckUtils]: 28: Hoare triple {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:51:23,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:51:23,885 INFO L272 TraceCheckUtils]: 30: Hoare triple {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2445#true} is VALID [2022-04-27 14:51:23,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:51:23,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:51:23,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:51:23,886 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2445#true} {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #55#return; {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:51:23,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:51:23,886 INFO L290 TraceCheckUtils]: 36: Hoare triple {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:51:23,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} assume !!(#t~post5 < 50);havoc #t~post5; {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:51:23,887 INFO L272 TraceCheckUtils]: 38: Hoare triple {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2445#true} is VALID [2022-04-27 14:51:23,887 INFO L290 TraceCheckUtils]: 39: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:51:23,887 INFO L290 TraceCheckUtils]: 40: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:51:23,888 INFO L290 TraceCheckUtils]: 41: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:51:23,888 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2445#true} {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} #55#return; {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:51:23,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:51:23,889 INFO L272 TraceCheckUtils]: 44: Hoare triple {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2445#true} is VALID [2022-04-27 14:51:23,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:51:23,889 INFO L290 TraceCheckUtils]: 46: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:51:23,889 INFO L290 TraceCheckUtils]: 47: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:51:23,889 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2445#true} {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} #57#return; {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:51:23,890 INFO L272 TraceCheckUtils]: 49: Hoare triple {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2602#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:51:23,890 INFO L290 TraceCheckUtils]: 50: Hoare triple {2602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:51:23,890 INFO L290 TraceCheckUtils]: 51: Hoare triple {2606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2446#false} is VALID [2022-04-27 14:51:23,890 INFO L290 TraceCheckUtils]: 52: Hoare triple {2446#false} assume !false; {2446#false} is VALID [2022-04-27 14:51:23,891 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 14:51:23,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:51:24,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:51:24,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205989048] [2022-04-27 14:51:24,120 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:51:24,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914816383] [2022-04-27 14:51:24,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914816383] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:51:24,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:51:24,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 14:51:24,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641372255] [2022-04-27 14:51:24,121 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:51:24,121 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-27 14:51:24,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:51:24,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:51:24,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:24,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 14:51:24,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:51:24,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 14:51:24,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:51:24,152 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:51:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:24,479 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-27 14:51:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:51:24,479 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-27 14:51:24,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:51:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:51:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-27 14:51:24,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:51:24,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-27 14:51:24,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-27 14:51:24,526 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:51:24,526 INFO L225 Difference]: With dead ends: 60 [2022-04-27 14:51:24,527 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 14:51:24,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:51:24,527 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:51:24,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 221 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:51:24,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 14:51:24,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-27 14:51:24,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:51:24,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:51:24,546 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:51:24,546 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:51:24,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:24,548 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-27 14:51:24,548 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-27 14:51:24,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:24,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:24,548 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-27 14:51:24,548 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-27 14:51:24,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:24,549 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-27 14:51:24,549 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-27 14:51:24,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:24,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:24,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:51:24,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:51:24,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:51:24,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-27 14:51:24,551 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-27 14:51:24,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:51:24,551 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-27 14:51:24,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:51:24,551 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-27 14:51:24,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 14:51:24,552 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:51:24,552 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:51:24,560 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:51:24,756 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:51:24,756 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:51:24,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:51:24,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 1 times [2022-04-27 14:51:24,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:51:24,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329318911] [2022-04-27 14:51:24,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:24,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:51:24,766 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:51:24,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1754130015] [2022-04-27 14:51:24,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:24,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:51:24,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:51:24,767 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:51:24,768 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:51:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:24,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 14:51:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:24,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:51:25,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {2947#true} call ULTIMATE.init(); {2947#true} is VALID [2022-04-27 14:51:25,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {2947#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; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:25,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {2955#(<= ~counter~0 0)} assume true; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:25,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2955#(<= ~counter~0 0)} {2947#true} #61#return; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:25,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {2955#(<= ~counter~0 0)} call #t~ret6 := main(); {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:25,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {2955#(<= ~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; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:25,099 INFO L272 TraceCheckUtils]: 6: Hoare triple {2955#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:25,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {2955#(<= ~counter~0 0)} ~cond := #in~cond; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:25,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {2955#(<= ~counter~0 0)} assume !(0 == ~cond); {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:25,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {2955#(<= ~counter~0 0)} assume true; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:25,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2955#(<= ~counter~0 0)} {2955#(<= ~counter~0 0)} #53#return; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:25,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {2955#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:25,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {2955#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:25,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {2989#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:25,102 INFO L272 TraceCheckUtils]: 14: Hoare triple {2989#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:25,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {2989#(<= ~counter~0 1)} ~cond := #in~cond; {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:25,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {2989#(<= ~counter~0 1)} assume !(0 == ~cond); {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:25,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {2989#(<= ~counter~0 1)} assume true; {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:25,104 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2989#(<= ~counter~0 1)} {2989#(<= ~counter~0 1)} #55#return; {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:25,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {2989#(<= ~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 * ~y~0 * ~y~0 + ~x~0; {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:25,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {2989#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:51:25,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {3014#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:51:25,105 INFO L272 TraceCheckUtils]: 22: Hoare triple {3014#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:51:25,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {3014#(<= ~counter~0 2)} ~cond := #in~cond; {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:51:25,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {3014#(<= ~counter~0 2)} assume !(0 == ~cond); {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:51:25,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {3014#(<= ~counter~0 2)} assume true; {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:51:25,107 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3014#(<= ~counter~0 2)} {3014#(<= ~counter~0 2)} #55#return; {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:51:25,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {3014#(<= ~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 * ~y~0 * ~y~0 + ~x~0; {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:51:25,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {3014#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:51:25,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {3039#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:51:25,109 INFO L272 TraceCheckUtils]: 30: Hoare triple {3039#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:51:25,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {3039#(<= ~counter~0 3)} ~cond := #in~cond; {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:51:25,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {3039#(<= ~counter~0 3)} assume !(0 == ~cond); {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:51:25,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {3039#(<= ~counter~0 3)} assume true; {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:51:25,110 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3039#(<= ~counter~0 3)} {3039#(<= ~counter~0 3)} #55#return; {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:51:25,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {3039#(<= ~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 * ~y~0 * ~y~0 + ~x~0; {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:51:25,111 INFO L290 TraceCheckUtils]: 36: Hoare triple {3039#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:51:25,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {3064#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:51:25,112 INFO L272 TraceCheckUtils]: 38: Hoare triple {3064#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:51:25,112 INFO L290 TraceCheckUtils]: 39: Hoare triple {3064#(<= ~counter~0 4)} ~cond := #in~cond; {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:51:25,112 INFO L290 TraceCheckUtils]: 40: Hoare triple {3064#(<= ~counter~0 4)} assume !(0 == ~cond); {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:51:25,113 INFO L290 TraceCheckUtils]: 41: Hoare triple {3064#(<= ~counter~0 4)} assume true; {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:51:25,113 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3064#(<= ~counter~0 4)} {3064#(<= ~counter~0 4)} #55#return; {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:51:25,113 INFO L290 TraceCheckUtils]: 43: Hoare triple {3064#(<= ~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 * ~y~0 * ~y~0 + ~x~0; {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:51:25,114 INFO L290 TraceCheckUtils]: 44: Hoare triple {3064#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3089#(<= |main_#t~post5| 4)} is VALID [2022-04-27 14:51:25,114 INFO L290 TraceCheckUtils]: 45: Hoare triple {3089#(<= |main_#t~post5| 4)} assume !(#t~post5 < 50);havoc #t~post5; {2948#false} is VALID [2022-04-27 14:51:25,114 INFO L272 TraceCheckUtils]: 46: Hoare triple {2948#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2948#false} is VALID [2022-04-27 14:51:25,114 INFO L290 TraceCheckUtils]: 47: Hoare triple {2948#false} ~cond := #in~cond; {2948#false} is VALID [2022-04-27 14:51:25,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {2948#false} assume !(0 == ~cond); {2948#false} is VALID [2022-04-27 14:51:25,114 INFO L290 TraceCheckUtils]: 49: Hoare triple {2948#false} assume true; {2948#false} is VALID [2022-04-27 14:51:25,115 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2948#false} {2948#false} #57#return; {2948#false} is VALID [2022-04-27 14:51:25,115 INFO L272 TraceCheckUtils]: 51: Hoare triple {2948#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2948#false} is VALID [2022-04-27 14:51:25,115 INFO L290 TraceCheckUtils]: 52: Hoare triple {2948#false} ~cond := #in~cond; {2948#false} is VALID [2022-04-27 14:51:25,115 INFO L290 TraceCheckUtils]: 53: Hoare triple {2948#false} assume 0 == ~cond; {2948#false} is VALID [2022-04-27 14:51:25,115 INFO L290 TraceCheckUtils]: 54: Hoare triple {2948#false} assume !false; {2948#false} is VALID [2022-04-27 14:51:25,115 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 14:51:25,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:51:25,387 INFO L290 TraceCheckUtils]: 54: Hoare triple {2948#false} assume !false; {2948#false} is VALID [2022-04-27 14:51:25,388 INFO L290 TraceCheckUtils]: 53: Hoare triple {2948#false} assume 0 == ~cond; {2948#false} is VALID [2022-04-27 14:51:25,388 INFO L290 TraceCheckUtils]: 52: Hoare triple {2948#false} ~cond := #in~cond; {2948#false} is VALID [2022-04-27 14:51:25,388 INFO L272 TraceCheckUtils]: 51: Hoare triple {2948#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2948#false} is VALID [2022-04-27 14:51:25,391 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2947#true} {2948#false} #57#return; {2948#false} is VALID [2022-04-27 14:51:25,391 INFO L290 TraceCheckUtils]: 49: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-27 14:51:25,391 INFO L290 TraceCheckUtils]: 48: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-27 14:51:25,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-27 14:51:25,391 INFO L272 TraceCheckUtils]: 46: Hoare triple {2948#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2947#true} is VALID [2022-04-27 14:51:25,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {3147#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {2948#false} is VALID [2022-04-27 14:51:25,393 INFO L290 TraceCheckUtils]: 44: Hoare triple {3151#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3147#(< |main_#t~post5| 50)} is VALID [2022-04-27 14:51:25,393 INFO L290 TraceCheckUtils]: 43: Hoare triple {3151#(< ~counter~0 50)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3151#(< ~counter~0 50)} is VALID [2022-04-27 14:51:25,394 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2947#true} {3151#(< ~counter~0 50)} #55#return; {3151#(< ~counter~0 50)} is VALID [2022-04-27 14:51:25,394 INFO L290 TraceCheckUtils]: 41: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-27 14:51:25,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-27 14:51:25,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-27 14:51:25,394 INFO L272 TraceCheckUtils]: 38: Hoare triple {3151#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2947#true} is VALID [2022-04-27 14:51:25,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {3151#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {3151#(< ~counter~0 50)} is VALID [2022-04-27 14:51:25,396 INFO L290 TraceCheckUtils]: 36: Hoare triple {3176#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3151#(< ~counter~0 50)} is VALID [2022-04-27 14:51:25,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {3176#(< ~counter~0 49)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3176#(< ~counter~0 49)} is VALID [2022-04-27 14:51:25,397 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2947#true} {3176#(< ~counter~0 49)} #55#return; {3176#(< ~counter~0 49)} is VALID [2022-04-27 14:51:25,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-27 14:51:25,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-27 14:51:25,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-27 14:51:25,397 INFO L272 TraceCheckUtils]: 30: Hoare triple {3176#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2947#true} is VALID [2022-04-27 14:51:25,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {3176#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {3176#(< ~counter~0 49)} is VALID [2022-04-27 14:51:25,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {3201#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3176#(< ~counter~0 49)} is VALID [2022-04-27 14:51:25,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {3201#(< ~counter~0 48)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3201#(< ~counter~0 48)} is VALID [2022-04-27 14:51:25,403 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2947#true} {3201#(< ~counter~0 48)} #55#return; {3201#(< ~counter~0 48)} is VALID [2022-04-27 14:51:25,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-27 14:51:25,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-27 14:51:25,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-27 14:51:25,403 INFO L272 TraceCheckUtils]: 22: Hoare triple {3201#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2947#true} is VALID [2022-04-27 14:51:25,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {3201#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {3201#(< ~counter~0 48)} is VALID [2022-04-27 14:51:25,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {3226#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3201#(< ~counter~0 48)} is VALID [2022-04-27 14:51:25,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {3226#(< ~counter~0 47)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3226#(< ~counter~0 47)} is VALID [2022-04-27 14:51:25,405 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2947#true} {3226#(< ~counter~0 47)} #55#return; {3226#(< ~counter~0 47)} is VALID [2022-04-27 14:51:25,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-27 14:51:25,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-27 14:51:25,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-27 14:51:25,405 INFO L272 TraceCheckUtils]: 14: Hoare triple {3226#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2947#true} is VALID [2022-04-27 14:51:25,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {3226#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {3226#(< ~counter~0 47)} is VALID [2022-04-27 14:51:25,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {3251#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3226#(< ~counter~0 47)} is VALID [2022-04-27 14:51:25,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {3251#(< ~counter~0 46)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3251#(< ~counter~0 46)} is VALID [2022-04-27 14:51:25,406 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2947#true} {3251#(< ~counter~0 46)} #53#return; {3251#(< ~counter~0 46)} is VALID [2022-04-27 14:51:25,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-27 14:51:25,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-27 14:51:25,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-27 14:51:25,407 INFO L272 TraceCheckUtils]: 6: Hoare triple {3251#(< ~counter~0 46)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2947#true} is VALID [2022-04-27 14:51:25,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {3251#(< ~counter~0 46)} 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; {3251#(< ~counter~0 46)} is VALID [2022-04-27 14:51:25,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {3251#(< ~counter~0 46)} call #t~ret6 := main(); {3251#(< ~counter~0 46)} is VALID [2022-04-27 14:51:25,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3251#(< ~counter~0 46)} {2947#true} #61#return; {3251#(< ~counter~0 46)} is VALID [2022-04-27 14:51:25,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {3251#(< ~counter~0 46)} assume true; {3251#(< ~counter~0 46)} is VALID [2022-04-27 14:51:25,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {2947#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; {3251#(< ~counter~0 46)} is VALID [2022-04-27 14:51:25,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {2947#true} call ULTIMATE.init(); {2947#true} is VALID [2022-04-27 14:51:25,409 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 14:51:25,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:51:25,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329318911] [2022-04-27 14:51:25,409 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:51:25,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754130015] [2022-04-27 14:51:25,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754130015] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:51:25,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:51:25,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 14:51:25,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384325695] [2022-04-27 14:51:25,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:51:25,412 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) Word has length 55 [2022-04-27 14:51:25,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:51:25,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:51:25,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:25,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:51:25,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:51:25,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:51:25,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:51:25,487 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:51:25,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:25,935 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2022-04-27 14:51:25,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 14:51:25,936 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) Word has length 55 [2022-04-27 14:51:25,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:51:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:51:25,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 145 transitions. [2022-04-27 14:51:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:51:25,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 145 transitions. [2022-04-27 14:51:25,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 145 transitions. [2022-04-27 14:51:26,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:26,031 INFO L225 Difference]: With dead ends: 140 [2022-04-27 14:51:26,031 INFO L226 Difference]: Without dead ends: 130 [2022-04-27 14:51:26,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 97 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:51:26,032 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 134 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:51:26,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 152 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:51:26,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-27 14:51:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 105. [2022-04-27 14:51:26,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:51:26,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:51:26,086 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:51:26,086 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:51:26,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:26,088 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-04-27 14:51:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-04-27 14:51:26,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:26,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:26,089 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) Second operand 130 states. [2022-04-27 14:51:26,089 INFO L87 Difference]: Start difference. First operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) Second operand 130 states. [2022-04-27 14:51:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:26,092 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-04-27 14:51:26,092 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-04-27 14:51:26,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:26,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:26,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:51:26,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:51:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:51:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-04-27 14:51:26,095 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 55 [2022-04-27 14:51:26,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:51:26,095 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-04-27 14:51:26,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:51:26,095 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-04-27 14:51:26,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 14:51:26,096 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:51:26,096 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:51:26,114 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:51:26,312 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:51:26,312 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:51:26,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:51:26,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 4 times [2022-04-27 14:51:26,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:51:26,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150435740] [2022-04-27 14:51:26,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:26,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:51:26,322 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:51:26,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [945982204] [2022-04-27 14:51:26,322 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:51:26,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:51:26,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:51:26,323 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:51:26,324 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:51:26,357 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:51:26,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:51:26,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 14:51:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:26,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:51:26,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {3917#true} call ULTIMATE.init(); {3917#true} is VALID [2022-04-27 14:51:26,703 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:51:26,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:51:26,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3917#true} {3917#true} #61#return; {3917#true} is VALID [2022-04-27 14:51:26,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {3917#true} call #t~ret6 := main(); {3917#true} is VALID [2022-04-27 14:51:26,703 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; {3917#true} is VALID [2022-04-27 14:51:26,703 INFO L272 TraceCheckUtils]: 6: Hoare triple {3917#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:51:26,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:51:26,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:51:26,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:51:26,703 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3917#true} {3917#true} #53#return; {3917#true} is VALID [2022-04-27 14:51:26,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {3917#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3955#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:26,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {3955#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3955#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:26,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {3955#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {3955#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:26,704 INFO L272 TraceCheckUtils]: 14: Hoare triple {3955#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:51:26,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:51:26,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:51:26,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:51:26,705 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3917#true} {3955#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {3955#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:26,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {3955#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3980#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:51:26,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {3980#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3980#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:51:26,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {3980#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {3980#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:51:26,706 INFO L272 TraceCheckUtils]: 22: Hoare triple {3980#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:51:26,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:51:26,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:51:26,706 INFO L290 TraceCheckUtils]: 25: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:51:26,707 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3917#true} {3980#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {3980#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:51:26,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {3980#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:51:26,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:51:26,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 50);havoc #t~post5; {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:51:26,708 INFO L272 TraceCheckUtils]: 30: Hoare triple {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:51:26,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:51:26,708 INFO L290 TraceCheckUtils]: 32: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:51:26,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:51:26,709 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3917#true} {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #55#return; {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:51:26,709 INFO L290 TraceCheckUtils]: 35: Hoare triple {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:51:26,710 INFO L290 TraceCheckUtils]: 36: Hoare triple {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:51:26,710 INFO L290 TraceCheckUtils]: 37: Hoare triple {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} assume !!(#t~post5 < 50);havoc #t~post5; {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:51:26,710 INFO L272 TraceCheckUtils]: 38: Hoare triple {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:51:26,710 INFO L290 TraceCheckUtils]: 39: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:51:26,710 INFO L290 TraceCheckUtils]: 40: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:51:26,710 INFO L290 TraceCheckUtils]: 41: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:51:26,711 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3917#true} {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} #55#return; {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:51:26,711 INFO L290 TraceCheckUtils]: 43: Hoare triple {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:51:26,712 INFO L290 TraceCheckUtils]: 44: Hoare triple {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:51:26,712 INFO L290 TraceCheckUtils]: 45: Hoare triple {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 50);havoc #t~post5; {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:51:26,712 INFO L272 TraceCheckUtils]: 46: Hoare triple {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:51:26,712 INFO L290 TraceCheckUtils]: 47: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:51:26,712 INFO L290 TraceCheckUtils]: 48: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:51:26,712 INFO L290 TraceCheckUtils]: 49: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:51:26,713 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3917#true} {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #55#return; {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:51:26,713 INFO L290 TraceCheckUtils]: 51: Hoare triple {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {4080#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:51:26,713 INFO L272 TraceCheckUtils]: 52: Hoare triple {4080#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:51:26,713 INFO L290 TraceCheckUtils]: 53: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:51:26,713 INFO L290 TraceCheckUtils]: 54: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:51:26,713 INFO L290 TraceCheckUtils]: 55: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:51:26,714 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3917#true} {4080#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #57#return; {4080#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:51:26,714 INFO L272 TraceCheckUtils]: 57: Hoare triple {4080#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4099#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:51:26,714 INFO L290 TraceCheckUtils]: 58: Hoare triple {4099#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4103#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:51:26,715 INFO L290 TraceCheckUtils]: 59: Hoare triple {4103#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3918#false} is VALID [2022-04-27 14:51:26,715 INFO L290 TraceCheckUtils]: 60: Hoare triple {3918#false} assume !false; {3918#false} is VALID [2022-04-27 14:51:26,715 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 14:51:26,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:51:26,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:51:26,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150435740] [2022-04-27 14:51:26,992 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:51:26,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945982204] [2022-04-27 14:51:26,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945982204] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:51:26,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:51:26,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:51:26,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335223416] [2022-04-27 14:51:26,992 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:51:26,992 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-27 14:51:26,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:51:26,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:51:27,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:27,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:51:27,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:51:27,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:51:27,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:51:27,023 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:51:27,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:27,447 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-27 14:51:27,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:51:27,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-27 14:51:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:51:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:51:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-27 14:51:27,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:51:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-27 14:51:27,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-27 14:51:27,488 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:51:27,490 INFO L225 Difference]: With dead ends: 110 [2022-04-27 14:51:27,490 INFO L226 Difference]: Without dead ends: 104 [2022-04-27 14:51:27,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 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:51:27,491 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:51:27,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 267 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:51:27,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-27 14:51:27,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-04-27 14:51:27,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:51:27,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:51:27,537 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:51:27,537 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:51:27,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:27,539 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-04-27 14:51:27,539 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-04-27 14:51:27,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:27,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:27,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) Second operand 104 states. [2022-04-27 14:51:27,539 INFO L87 Difference]: Start difference. First operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) Second operand 104 states. [2022-04-27 14:51:27,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:27,541 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-04-27 14:51:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-04-27 14:51:27,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:27,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:27,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:51:27,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:51:27,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:51:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2022-04-27 14:51:27,543 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 61 [2022-04-27 14:51:27,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:51:27,543 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2022-04-27 14:51:27,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:51:27,544 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-04-27 14:51:27,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-27 14:51:27,544 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:51:27,544 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:51:27,560 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:51:27,755 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:51:27,755 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:51:27,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:51:27,756 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 5 times [2022-04-27 14:51:27,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:51:27,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696435419] [2022-04-27 14:51:27,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:27,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:51:27,767 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:51:27,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1296624128] [2022-04-27 14:51:27,767 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:51:27,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:51:27,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:51:27,780 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:51:27,796 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:51:28,181 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 14:51:28,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:51:28,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:51:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:28,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:51:28,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {4686#true} call ULTIMATE.init(); {4686#true} is VALID [2022-04-27 14:51:28,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {4686#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; {4686#true} is VALID [2022-04-27 14:51:28,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:51:28,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4686#true} {4686#true} #61#return; {4686#true} is VALID [2022-04-27 14:51:28,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {4686#true} call #t~ret6 := main(); {4686#true} is VALID [2022-04-27 14:51:28,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {4686#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; {4686#true} is VALID [2022-04-27 14:51:28,592 INFO L272 TraceCheckUtils]: 6: Hoare triple {4686#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4686#true} is VALID [2022-04-27 14:51:28,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:51:28,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:51:28,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:51:28,592 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4686#true} {4686#true} #53#return; {4686#true} is VALID [2022-04-27 14:51:28,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {4686#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4724#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:28,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {4724#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4724#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:28,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {4724#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {4724#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:28,593 INFO L272 TraceCheckUtils]: 14: Hoare triple {4724#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4686#true} is VALID [2022-04-27 14:51:28,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:51:28,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:51:28,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:51:28,594 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4686#true} {4724#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {4724#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:28,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {4724#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:51:28,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:51:28,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:51:28,595 INFO L272 TraceCheckUtils]: 22: Hoare triple {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4686#true} is VALID [2022-04-27 14:51:28,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:51:28,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:51:28,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:51:28,596 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4686#true} {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:51:28,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4774#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:51:28,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {4774#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4774#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:51:28,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {4774#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 50);havoc #t~post5; {4774#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:51:28,597 INFO L272 TraceCheckUtils]: 30: Hoare triple {4774#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4686#true} is VALID [2022-04-27 14:51:28,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:51:28,597 INFO L290 TraceCheckUtils]: 32: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:51:28,597 INFO L290 TraceCheckUtils]: 33: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:51:28,597 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4686#true} {4774#(and (= main_~y~0 2) (= main_~c~0 2))} #55#return; {4774#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:51:28,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {4774#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4799#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:51:28,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {4799#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4799#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:51:28,598 INFO L290 TraceCheckUtils]: 37: Hoare triple {4799#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 50);havoc #t~post5; {4799#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:51:28,599 INFO L272 TraceCheckUtils]: 38: Hoare triple {4799#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4686#true} is VALID [2022-04-27 14:51:28,599 INFO L290 TraceCheckUtils]: 39: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:51:28,599 INFO L290 TraceCheckUtils]: 40: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:51:28,599 INFO L290 TraceCheckUtils]: 41: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:51:28,599 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4686#true} {4799#(and (= main_~y~0 3) (= main_~c~0 3))} #55#return; {4799#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:51:28,600 INFO L290 TraceCheckUtils]: 43: Hoare triple {4799#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4824#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:51:28,600 INFO L290 TraceCheckUtils]: 44: Hoare triple {4824#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4824#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:51:28,600 INFO L290 TraceCheckUtils]: 45: Hoare triple {4824#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 50);havoc #t~post5; {4824#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:51:28,600 INFO L272 TraceCheckUtils]: 46: Hoare triple {4824#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4686#true} is VALID [2022-04-27 14:51:28,600 INFO L290 TraceCheckUtils]: 47: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:51:28,600 INFO L290 TraceCheckUtils]: 48: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:51:28,601 INFO L290 TraceCheckUtils]: 49: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:51:28,601 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4686#true} {4824#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {4824#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:51:28,601 INFO L290 TraceCheckUtils]: 51: Hoare triple {4824#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4849#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:51:28,602 INFO L290 TraceCheckUtils]: 52: Hoare triple {4849#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4849#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:51:28,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {4849#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !!(#t~post5 < 50);havoc #t~post5; {4849#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:51:28,602 INFO L272 TraceCheckUtils]: 54: Hoare triple {4849#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4686#true} is VALID [2022-04-27 14:51:28,602 INFO L290 TraceCheckUtils]: 55: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:51:28,602 INFO L290 TraceCheckUtils]: 56: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:51:28,602 INFO L290 TraceCheckUtils]: 57: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:51:28,603 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4686#true} {4849#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #55#return; {4849#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:51:28,603 INFO L290 TraceCheckUtils]: 59: Hoare triple {4849#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {4874#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:51:28,603 INFO L272 TraceCheckUtils]: 60: Hoare triple {4874#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4686#true} is VALID [2022-04-27 14:51:28,603 INFO L290 TraceCheckUtils]: 61: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:51:28,603 INFO L290 TraceCheckUtils]: 62: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:51:28,603 INFO L290 TraceCheckUtils]: 63: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:51:28,604 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4686#true} {4874#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #57#return; {4874#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:51:28,604 INFO L272 TraceCheckUtils]: 65: Hoare triple {4874#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4893#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:51:28,605 INFO L290 TraceCheckUtils]: 66: Hoare triple {4893#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4897#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:51:28,605 INFO L290 TraceCheckUtils]: 67: Hoare triple {4897#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4687#false} is VALID [2022-04-27 14:51:28,605 INFO L290 TraceCheckUtils]: 68: Hoare triple {4687#false} assume !false; {4687#false} is VALID [2022-04-27 14:51:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 60 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 14:51:28,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:51:28,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:51:28,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696435419] [2022-04-27 14:51:28,860 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:51:28,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296624128] [2022-04-27 14:51:28,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296624128] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:51:28,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:51:28,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 14:51:28,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794884555] [2022-04-27 14:51:28,860 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:51:28,861 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-27 14:51:28,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:51:28,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:51:28,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:28,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:51:28,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:51:28,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:51:28,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:51:28,899 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:51:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:29,419 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2022-04-27 14:51:29,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 14:51:29,420 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-27 14:51:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:51:29,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:51:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-27 14:51:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:51:29,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-27 14:51:29,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-27 14:51:29,468 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:51:29,469 INFO L225 Difference]: With dead ends: 109 [2022-04-27 14:51:29,470 INFO L226 Difference]: Without dead ends: 103 [2022-04-27 14:51:29,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 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:51:29,470 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:51:29,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 317 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:51:29,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-27 14:51:29,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-27 14:51:29,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:51:29,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:51:29,505 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:51:29,505 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:51:29,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:29,507 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2022-04-27 14:51:29,507 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2022-04-27 14:51:29,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:29,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:29,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) Second operand 103 states. [2022-04-27 14:51:29,507 INFO L87 Difference]: Start difference. First operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) Second operand 103 states. [2022-04-27 14:51:29,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:29,509 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2022-04-27 14:51:29,509 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2022-04-27 14:51:29,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:29,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:29,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:51:29,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:51:29,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:51:29,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2022-04-27 14:51:29,511 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 69 [2022-04-27 14:51:29,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:51:29,511 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2022-04-27 14:51:29,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:51:29,511 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2022-04-27 14:51:29,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-27 14:51:29,512 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:51:29,512 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:51:29,531 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:51:29,716 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:51:29,717 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:51:29,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:51:29,717 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 6 times [2022-04-27 14:51:29,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:51:29,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773899448] [2022-04-27 14:51:29,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:29,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:51:29,728 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:51:29,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1979257580] [2022-04-27 14:51:29,728 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:51:29,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:51:29,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:51:29,729 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:51:29,730 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:51:34,936 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 14:51:34,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:51:34,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-27 14:51:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:34,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:51:35,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {5474#true} call ULTIMATE.init(); {5474#true} is VALID [2022-04-27 14:51:35,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {5474#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; {5474#true} is VALID [2022-04-27 14:51:35,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {5474#true} assume true; {5474#true} is VALID [2022-04-27 14:51:35,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5474#true} {5474#true} #61#return; {5474#true} is VALID [2022-04-27 14:51:35,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {5474#true} call #t~ret6 := main(); {5474#true} is VALID [2022-04-27 14:51:35,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {5474#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; {5474#true} is VALID [2022-04-27 14:51:35,430 INFO L272 TraceCheckUtils]: 6: Hoare triple {5474#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5474#true} is VALID [2022-04-27 14:51:35,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2022-04-27 14:51:35,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2022-04-27 14:51:35,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {5474#true} assume true; {5474#true} is VALID [2022-04-27 14:51:35,431 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5474#true} {5474#true} #53#return; {5474#true} is VALID [2022-04-27 14:51:35,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {5474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5512#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:35,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {5512#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5512#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:35,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {5512#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {5512#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:35,432 INFO L272 TraceCheckUtils]: 14: Hoare triple {5512#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5474#true} is VALID [2022-04-27 14:51:35,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2022-04-27 14:51:35,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2022-04-27 14:51:35,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {5474#true} assume true; {5474#true} is VALID [2022-04-27 14:51:35,433 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5474#true} {5512#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {5512#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:35,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {5512#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5537#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:51:35,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {5537#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5537#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:51:35,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {5537#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {5537#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:51:35,434 INFO L272 TraceCheckUtils]: 22: Hoare triple {5537#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5474#true} is VALID [2022-04-27 14:51:35,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2022-04-27 14:51:35,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2022-04-27 14:51:35,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {5474#true} assume true; {5474#true} is VALID [2022-04-27 14:51:35,434 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5474#true} {5537#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #55#return; {5537#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:51:35,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {5537#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5562#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-27 14:51:35,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {5562#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5562#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-27 14:51:35,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {5562#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(#t~post5 < 50);havoc #t~post5; {5562#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-27 14:51:35,435 INFO L272 TraceCheckUtils]: 30: Hoare triple {5562#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5474#true} is VALID [2022-04-27 14:51:35,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2022-04-27 14:51:35,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2022-04-27 14:51:35,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {5474#true} assume true; {5474#true} is VALID [2022-04-27 14:51:35,436 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5474#true} {5562#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #55#return; {5562#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-27 14:51:35,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {5562#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5587#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:51:35,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {5587#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5587#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:51:35,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {5587#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 50);havoc #t~post5; {5587#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:51:35,437 INFO L272 TraceCheckUtils]: 38: Hoare triple {5587#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5474#true} is VALID [2022-04-27 14:51:35,437 INFO L290 TraceCheckUtils]: 39: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2022-04-27 14:51:35,437 INFO L290 TraceCheckUtils]: 40: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2022-04-27 14:51:35,437 INFO L290 TraceCheckUtils]: 41: Hoare triple {5474#true} assume true; {5474#true} is VALID [2022-04-27 14:51:35,437 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5474#true} {5587#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} #55#return; {5587#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:51:35,438 INFO L290 TraceCheckUtils]: 43: Hoare triple {5587#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5612#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:51:35,438 INFO L290 TraceCheckUtils]: 44: Hoare triple {5612#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5612#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:51:35,439 INFO L290 TraceCheckUtils]: 45: Hoare triple {5612#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 50);havoc #t~post5; {5612#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:51:35,439 INFO L272 TraceCheckUtils]: 46: Hoare triple {5612#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5474#true} is VALID [2022-04-27 14:51:35,439 INFO L290 TraceCheckUtils]: 47: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2022-04-27 14:51:35,439 INFO L290 TraceCheckUtils]: 48: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2022-04-27 14:51:35,439 INFO L290 TraceCheckUtils]: 49: Hoare triple {5474#true} assume true; {5474#true} is VALID [2022-04-27 14:51:35,439 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5474#true} {5612#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #55#return; {5612#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:51:35,440 INFO L290 TraceCheckUtils]: 51: Hoare triple {5612#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5637#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:51:35,440 INFO L290 TraceCheckUtils]: 52: Hoare triple {5637#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5637#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:51:35,440 INFO L290 TraceCheckUtils]: 53: Hoare triple {5637#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !!(#t~post5 < 50);havoc #t~post5; {5637#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:51:35,440 INFO L272 TraceCheckUtils]: 54: Hoare triple {5637#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5474#true} is VALID [2022-04-27 14:51:35,440 INFO L290 TraceCheckUtils]: 55: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2022-04-27 14:51:35,440 INFO L290 TraceCheckUtils]: 56: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2022-04-27 14:51:35,440 INFO L290 TraceCheckUtils]: 57: Hoare triple {5474#true} assume true; {5474#true} is VALID [2022-04-27 14:51:35,441 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5474#true} {5637#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} #55#return; {5637#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:51:35,441 INFO L290 TraceCheckUtils]: 59: Hoare triple {5637#(and (< 1 main_~k~0) (= (+ (- 2) 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 * ~y~0 * ~y~0 + ~x~0; {5662#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:51:35,442 INFO L290 TraceCheckUtils]: 60: Hoare triple {5662#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5662#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:51:35,442 INFO L290 TraceCheckUtils]: 61: Hoare triple {5662#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {5662#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:51:35,442 INFO L272 TraceCheckUtils]: 62: Hoare triple {5662#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5474#true} is VALID [2022-04-27 14:51:35,442 INFO L290 TraceCheckUtils]: 63: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2022-04-27 14:51:35,442 INFO L290 TraceCheckUtils]: 64: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2022-04-27 14:51:35,442 INFO L290 TraceCheckUtils]: 65: Hoare triple {5474#true} assume true; {5474#true} is VALID [2022-04-27 14:51:35,442 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5474#true} {5662#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #55#return; {5662#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:51:35,443 INFO L290 TraceCheckUtils]: 67: Hoare triple {5662#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {5687#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:51:35,443 INFO L272 TraceCheckUtils]: 68: Hoare triple {5687#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5474#true} is VALID [2022-04-27 14:51:35,443 INFO L290 TraceCheckUtils]: 69: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2022-04-27 14:51:35,443 INFO L290 TraceCheckUtils]: 70: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2022-04-27 14:51:35,443 INFO L290 TraceCheckUtils]: 71: Hoare triple {5474#true} assume true; {5474#true} is VALID [2022-04-27 14:51:35,444 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {5474#true} {5687#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #57#return; {5687#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:51:35,444 INFO L272 TraceCheckUtils]: 73: Hoare triple {5687#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5706#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:51:35,444 INFO L290 TraceCheckUtils]: 74: Hoare triple {5706#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5710#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:51:35,445 INFO L290 TraceCheckUtils]: 75: Hoare triple {5710#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5475#false} is VALID [2022-04-27 14:51:35,445 INFO L290 TraceCheckUtils]: 76: Hoare triple {5475#false} assume !false; {5475#false} is VALID [2022-04-27 14:51:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 14:51:35,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:51:36,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:51:36,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773899448] [2022-04-27 14:51:36,087 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:51:36,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979257580] [2022-04-27 14:51:36,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979257580] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:51:36,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:51:36,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 14:51:36,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773288753] [2022-04-27 14:51:36,087 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:51:36,087 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-27 14:51:36,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:51:36,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:51:36,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:36,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 14:51:36,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:51:36,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 14:51:36,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:51:36,126 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:51:36,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:36,736 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-04-27 14:51:36,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:51:36,736 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-27 14:51:36,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:51:36,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:51:36,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-27 14:51:36,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:51:36,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-27 14:51:36,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-27 14:51:36,787 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:51:36,789 INFO L225 Difference]: With dead ends: 108 [2022-04-27 14:51:36,789 INFO L226 Difference]: Without dead ends: 102 [2022-04-27 14:51:36,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-27 14:51:36,789 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:51:36,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 367 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:51:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-27 14:51:36,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-27 14:51:36,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:51:36,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:51:36,828 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:51:36,828 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:51:36,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:36,829 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-04-27 14:51:36,829 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-04-27 14:51:36,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:36,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:36,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 102 states. [2022-04-27 14:51:36,830 INFO L87 Difference]: Start difference. First operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 102 states. [2022-04-27 14:51:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:36,831 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-04-27 14:51:36,831 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-04-27 14:51:36,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:36,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:36,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:51:36,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:51:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:51:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2022-04-27 14:51:36,833 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 77 [2022-04-27 14:51:36,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:51:36,833 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2022-04-27 14:51:36,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:51:36,833 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-04-27 14:51:36,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-27 14:51:36,834 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:51:36,834 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:51:36,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-27 14:51:37,042 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:51:37,043 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:51:37,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:51:37,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 7 times [2022-04-27 14:51:37,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:51:37,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960086966] [2022-04-27 14:51:37,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:37,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:51:37,054 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:51:37,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2100682532] [2022-04-27 14:51:37,054 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:51:37,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:51:37,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:51:37,055 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:51:37,056 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:51:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:37,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-27 14:51:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:37,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:51:38,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {6381#true} call ULTIMATE.init(); {6381#true} is VALID [2022-04-27 14:51:38,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {6381#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; {6381#true} is VALID [2022-04-27 14:51:38,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:51:38,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6381#true} {6381#true} #61#return; {6381#true} is VALID [2022-04-27 14:51:38,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {6381#true} call #t~ret6 := main(); {6381#true} is VALID [2022-04-27 14:51:38,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {6381#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; {6381#true} is VALID [2022-04-27 14:51:38,150 INFO L272 TraceCheckUtils]: 6: Hoare triple {6381#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6381#true} is VALID [2022-04-27 14:51:38,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:51:38,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:51:38,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:51:38,150 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6381#true} {6381#true} #53#return; {6381#true} is VALID [2022-04-27 14:51:38,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {6381#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6419#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:38,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {6419#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6419#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:38,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {6419#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {6419#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:38,151 INFO L272 TraceCheckUtils]: 14: Hoare triple {6419#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6381#true} is VALID [2022-04-27 14:51:38,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:51:38,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:51:38,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:51:38,151 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6381#true} {6419#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {6419#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:38,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {6419#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:51:38,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {6444#(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; {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:51:38,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 50);havoc #t~post5; {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:51:38,153 INFO L272 TraceCheckUtils]: 22: Hoare triple {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6381#true} is VALID [2022-04-27 14:51:38,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:51:38,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:51:38,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:51:38,153 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6381#true} {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:51:38,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:51:38,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {6469#(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; {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:51:38,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:51:38,155 INFO L272 TraceCheckUtils]: 30: Hoare triple {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6381#true} is VALID [2022-04-27 14:51:38,155 INFO L290 TraceCheckUtils]: 31: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:51:38,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:51:38,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:51:38,168 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6381#true} {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #55#return; {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:51:38,168 INFO L290 TraceCheckUtils]: 35: Hoare triple {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:51:38,169 INFO L290 TraceCheckUtils]: 36: Hoare triple {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:51:38,169 INFO L290 TraceCheckUtils]: 37: Hoare triple {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(#t~post5 < 50);havoc #t~post5; {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:51:38,169 INFO L272 TraceCheckUtils]: 38: Hoare triple {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6381#true} is VALID [2022-04-27 14:51:38,169 INFO L290 TraceCheckUtils]: 39: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:51:38,169 INFO L290 TraceCheckUtils]: 40: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:51:38,169 INFO L290 TraceCheckUtils]: 41: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:51:38,170 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6381#true} {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #55#return; {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:51:38,170 INFO L290 TraceCheckUtils]: 43: Hoare triple {6494#(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 * ~y~0 * ~y~0 + ~x~0; {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:51:38,170 INFO L290 TraceCheckUtils]: 44: Hoare triple {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:51:38,171 INFO L290 TraceCheckUtils]: 45: Hoare triple {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} assume !!(#t~post5 < 50);havoc #t~post5; {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:51:38,171 INFO L272 TraceCheckUtils]: 46: Hoare triple {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6381#true} is VALID [2022-04-27 14:51:38,171 INFO L290 TraceCheckUtils]: 47: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:51:38,171 INFO L290 TraceCheckUtils]: 48: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:51:38,171 INFO L290 TraceCheckUtils]: 49: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:51:38,172 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6381#true} {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} #55#return; {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:51:38,172 INFO L290 TraceCheckUtils]: 51: Hoare triple {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:51:38,172 INFO L290 TraceCheckUtils]: 52: Hoare triple {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:51:38,173 INFO L290 TraceCheckUtils]: 53: Hoare triple {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} assume !!(#t~post5 < 50);havoc #t~post5; {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:51:38,173 INFO L272 TraceCheckUtils]: 54: Hoare triple {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6381#true} is VALID [2022-04-27 14:51:38,173 INFO L290 TraceCheckUtils]: 55: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:51:38,173 INFO L290 TraceCheckUtils]: 56: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:51:38,173 INFO L290 TraceCheckUtils]: 57: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:51:38,174 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6381#true} {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} #55#return; {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:51:38,174 INFO L290 TraceCheckUtils]: 59: Hoare triple {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:51:38,174 INFO L290 TraceCheckUtils]: 60: Hoare triple {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:51:38,175 INFO L290 TraceCheckUtils]: 61: Hoare triple {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} assume !!(#t~post5 < 50);havoc #t~post5; {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:51:38,175 INFO L272 TraceCheckUtils]: 62: Hoare triple {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6381#true} is VALID [2022-04-27 14:51:38,175 INFO L290 TraceCheckUtils]: 63: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:51:38,175 INFO L290 TraceCheckUtils]: 64: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:51:38,175 INFO L290 TraceCheckUtils]: 65: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:51:38,176 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6381#true} {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} #55#return; {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:51:38,176 INFO L290 TraceCheckUtils]: 67: Hoare triple {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:51:38,176 INFO L290 TraceCheckUtils]: 68: Hoare triple {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:51:38,177 INFO L290 TraceCheckUtils]: 69: Hoare triple {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !!(#t~post5 < 50);havoc #t~post5; {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:51:38,177 INFO L272 TraceCheckUtils]: 70: Hoare triple {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6381#true} is VALID [2022-04-27 14:51:38,177 INFO L290 TraceCheckUtils]: 71: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:51:38,177 INFO L290 TraceCheckUtils]: 72: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:51:38,177 INFO L290 TraceCheckUtils]: 73: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:51:38,177 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {6381#true} {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #55#return; {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:51:38,178 INFO L290 TraceCheckUtils]: 75: Hoare triple {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {6619#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:51:38,178 INFO L272 TraceCheckUtils]: 76: Hoare triple {6619#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6381#true} is VALID [2022-04-27 14:51:38,178 INFO L290 TraceCheckUtils]: 77: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:51:38,178 INFO L290 TraceCheckUtils]: 78: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:51:38,178 INFO L290 TraceCheckUtils]: 79: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:51:38,178 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6381#true} {6619#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #57#return; {6619#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:51:38,179 INFO L272 TraceCheckUtils]: 81: Hoare triple {6619#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {6638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:51:38,179 INFO L290 TraceCheckUtils]: 82: Hoare triple {6638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:51:38,179 INFO L290 TraceCheckUtils]: 83: Hoare triple {6642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6382#false} is VALID [2022-04-27 14:51:38,180 INFO L290 TraceCheckUtils]: 84: Hoare triple {6382#false} assume !false; {6382#false} is VALID [2022-04-27 14:51:38,180 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 18 proven. 112 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-27 14:51:38,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:51:38,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:51:38,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960086966] [2022-04-27 14:51:38,939 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:51:38,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100682532] [2022-04-27 14:51:38,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100682532] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:51:38,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:51:38,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 14:51:38,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511573327] [2022-04-27 14:51:38,940 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:51:38,940 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-27 14:51:38,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:51:38,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:51:38,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:38,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 14:51:38,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:51:38,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 14:51:38,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2022-04-27 14:51:38,983 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:51:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:39,741 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2022-04-27 14:51:39,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:51:39,741 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-27 14:51:39,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:51:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:51:39,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-27 14:51:39,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:51:39,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-27 14:51:39,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2022-04-27 14:51:39,804 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:51:39,805 INFO L225 Difference]: With dead ends: 107 [2022-04-27 14:51:39,805 INFO L226 Difference]: Without dead ends: 101 [2022-04-27 14:51:39,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2022-04-27 14:51:39,806 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:51:39,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 423 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:51:39,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-27 14:51:39,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-04-27 14:51:39,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:51:39,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:51:39,873 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:51:39,874 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:51:39,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:39,875 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-04-27 14:51:39,875 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-27 14:51:39,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:39,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:39,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 101 states. [2022-04-27 14:51:39,876 INFO L87 Difference]: Start difference. First operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 101 states. [2022-04-27 14:51:39,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:39,877 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-04-27 14:51:39,877 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-27 14:51:39,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:39,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:39,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:51:39,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:51:39,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:51:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2022-04-27 14:51:39,879 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 85 [2022-04-27 14:51:39,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:51:39,879 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2022-04-27 14:51:39,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:51:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-27 14:51:39,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-27 14:51:39,880 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:51:39,880 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:51:39,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-27 14:51:40,085 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:51:40,085 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:51:40,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:51:40,086 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 8 times [2022-04-27 14:51:40,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:51:40,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955647616] [2022-04-27 14:51:40,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:40,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:51:40,104 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:51:40,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1999213748] [2022-04-27 14:51:40,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:51:40,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:51:40,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:51:40,106 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:51:40,106 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:51:40,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:51:40,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:51:40,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 14:51:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:41,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:51:41,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {7357#true} call ULTIMATE.init(); {7357#true} is VALID [2022-04-27 14:51:41,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {7357#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; {7357#true} is VALID [2022-04-27 14:51:41,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:51:41,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7357#true} {7357#true} #61#return; {7357#true} is VALID [2022-04-27 14:51:41,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {7357#true} call #t~ret6 := main(); {7357#true} is VALID [2022-04-27 14:51:41,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {7357#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; {7357#true} is VALID [2022-04-27 14:51:41,451 INFO L272 TraceCheckUtils]: 6: Hoare triple {7357#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7357#true} is VALID [2022-04-27 14:51:41,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:51:41,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:51:41,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:51:41,451 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7357#true} {7357#true} #53#return; {7357#true} is VALID [2022-04-27 14:51:41,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {7357#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7395#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:41,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {7395#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7395#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:41,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {7395#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {7395#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:41,452 INFO L272 TraceCheckUtils]: 14: Hoare triple {7395#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7357#true} is VALID [2022-04-27 14:51:41,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:51:41,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:51:41,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:51:41,453 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7357#true} {7395#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {7395#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:41,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {7395#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:51:41,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:51:41,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:51:41,454 INFO L272 TraceCheckUtils]: 22: Hoare triple {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7357#true} is VALID [2022-04-27 14:51:41,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:51:41,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:51:41,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:51:41,454 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7357#true} {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:51:41,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7445#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:51:41,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {7445#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7445#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:51:41,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {7445#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 50);havoc #t~post5; {7445#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:51:41,455 INFO L272 TraceCheckUtils]: 30: Hoare triple {7445#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7357#true} is VALID [2022-04-27 14:51:41,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:51:41,455 INFO L290 TraceCheckUtils]: 32: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:51:41,456 INFO L290 TraceCheckUtils]: 33: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:51:41,456 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7357#true} {7445#(and (= main_~y~0 2) (= main_~c~0 2))} #55#return; {7445#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:51:41,456 INFO L290 TraceCheckUtils]: 35: Hoare triple {7445#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:51:41,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:51:41,457 INFO L290 TraceCheckUtils]: 37: Hoare triple {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 50);havoc #t~post5; {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:51:41,457 INFO L272 TraceCheckUtils]: 38: Hoare triple {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7357#true} is VALID [2022-04-27 14:51:41,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:51:41,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:51:41,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:51:41,458 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7357#true} {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:51:41,458 INFO L290 TraceCheckUtils]: 43: Hoare triple {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7495#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:51:41,459 INFO L290 TraceCheckUtils]: 44: Hoare triple {7495#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7495#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:51:41,459 INFO L290 TraceCheckUtils]: 45: Hoare triple {7495#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 50);havoc #t~post5; {7495#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:51:41,459 INFO L272 TraceCheckUtils]: 46: Hoare triple {7495#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7357#true} is VALID [2022-04-27 14:51:41,459 INFO L290 TraceCheckUtils]: 47: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:51:41,459 INFO L290 TraceCheckUtils]: 48: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:51:41,459 INFO L290 TraceCheckUtils]: 49: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:51:41,460 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7357#true} {7495#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {7495#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:51:41,460 INFO L290 TraceCheckUtils]: 51: Hoare triple {7495#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:51:41,460 INFO L290 TraceCheckUtils]: 52: Hoare triple {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:51:41,461 INFO L290 TraceCheckUtils]: 53: Hoare triple {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(#t~post5 < 50);havoc #t~post5; {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:51:41,461 INFO L272 TraceCheckUtils]: 54: Hoare triple {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7357#true} is VALID [2022-04-27 14:51:41,461 INFO L290 TraceCheckUtils]: 55: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:51:41,461 INFO L290 TraceCheckUtils]: 56: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:51:41,461 INFO L290 TraceCheckUtils]: 57: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:51:41,461 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7357#true} {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #55#return; {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:51:41,462 INFO L290 TraceCheckUtils]: 59: Hoare triple {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7545#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:51:41,462 INFO L290 TraceCheckUtils]: 60: Hoare triple {7545#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7545#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:51:41,462 INFO L290 TraceCheckUtils]: 61: Hoare triple {7545#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {7545#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:51:41,462 INFO L272 TraceCheckUtils]: 62: Hoare triple {7545#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7357#true} is VALID [2022-04-27 14:51:41,463 INFO L290 TraceCheckUtils]: 63: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:51:41,463 INFO L290 TraceCheckUtils]: 64: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:51:41,463 INFO L290 TraceCheckUtils]: 65: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:51:41,471 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7357#true} {7545#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {7545#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:51:41,472 INFO L290 TraceCheckUtils]: 67: Hoare triple {7545#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:51:41,472 INFO L290 TraceCheckUtils]: 68: Hoare triple {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:51:41,473 INFO L290 TraceCheckUtils]: 69: Hoare triple {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(#t~post5 < 50);havoc #t~post5; {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:51:41,473 INFO L272 TraceCheckUtils]: 70: Hoare triple {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7357#true} is VALID [2022-04-27 14:51:41,473 INFO L290 TraceCheckUtils]: 71: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:51:41,473 INFO L290 TraceCheckUtils]: 72: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:51:41,473 INFO L290 TraceCheckUtils]: 73: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:51:41,473 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {7357#true} {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} #55#return; {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:51:41,474 INFO L290 TraceCheckUtils]: 75: Hoare triple {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:51:41,474 INFO L290 TraceCheckUtils]: 76: Hoare triple {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:51:41,474 INFO L290 TraceCheckUtils]: 77: Hoare triple {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !!(#t~post5 < 50);havoc #t~post5; {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:51:41,475 INFO L272 TraceCheckUtils]: 78: Hoare triple {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7357#true} is VALID [2022-04-27 14:51:41,475 INFO L290 TraceCheckUtils]: 79: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:51:41,475 INFO L290 TraceCheckUtils]: 80: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:51:41,475 INFO L290 TraceCheckUtils]: 81: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:51:41,475 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {7357#true} {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #55#return; {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:51:41,476 INFO L290 TraceCheckUtils]: 83: Hoare triple {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {7620#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 14:51:41,476 INFO L272 TraceCheckUtils]: 84: Hoare triple {7620#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7357#true} is VALID [2022-04-27 14:51:41,476 INFO L290 TraceCheckUtils]: 85: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:51:41,476 INFO L290 TraceCheckUtils]: 86: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:51:41,476 INFO L290 TraceCheckUtils]: 87: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:51:41,476 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {7357#true} {7620#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #57#return; {7620#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 14:51:41,477 INFO L272 TraceCheckUtils]: 89: Hoare triple {7620#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7639#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:51:41,477 INFO L290 TraceCheckUtils]: 90: Hoare triple {7639#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7643#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:51:41,478 INFO L290 TraceCheckUtils]: 91: Hoare triple {7643#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7358#false} is VALID [2022-04-27 14:51:41,478 INFO L290 TraceCheckUtils]: 92: Hoare triple {7358#false} assume !false; {7358#false} is VALID [2022-04-27 14:51:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 20 proven. 144 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 14:51:41,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:51:41,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:51:41,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955647616] [2022-04-27 14:51:41,793 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:51:41,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999213748] [2022-04-27 14:51:41,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999213748] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:51:41,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:51:41,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 14:51:41,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82514415] [2022-04-27 14:51:41,794 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:51:41,794 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-27 14:51:41,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:51:41,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:51:41,839 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:51:41,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:51:41,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:51:41,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:51:41,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:51:41,840 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:51:42,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:42,737 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2022-04-27 14:51:42,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 14:51:42,737 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-27 14:51:42,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:51:42,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:51:42,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-27 14:51:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:51:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-27 14:51:42,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions. [2022-04-27 14:51:42,805 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:51:42,806 INFO L225 Difference]: With dead ends: 106 [2022-04-27 14:51:42,806 INFO L226 Difference]: Without dead ends: 100 [2022-04-27 14:51:42,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 95 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:51:42,807 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:51:42,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 491 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:51:42,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-27 14:51:42,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-27 14:51:42,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:51:42,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:51:42,853 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:51:42,853 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:51:42,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:42,855 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-27 14:51:42,855 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-27 14:51:42,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:42,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:42,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-27 14:51:42,855 INFO L87 Difference]: Start difference. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-27 14:51:42,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:42,857 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-27 14:51:42,857 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-27 14:51:42,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:42,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:42,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:51:42,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:51:42,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:51:42,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-04-27 14:51:42,858 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 93 [2022-04-27 14:51:42,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:51:42,858 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-04-27 14:51:42,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:51:42,859 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-27 14:51:42,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-27 14:51:42,859 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:51:42,859 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:51:42,869 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:51:43,064 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:51:43,065 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:51:43,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:51:43,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 9 times [2022-04-27 14:51:43,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:51:43,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29213833] [2022-04-27 14:51:43,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:43,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:51:43,077 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:51:43,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1206718174] [2022-04-27 14:51:43,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:51:43,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:51:43,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:51:43,078 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:51:43,079 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:51:44,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-04-27 14:51:44,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:51:44,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-27 14:51:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:44,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:51:44,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {8202#true} call ULTIMATE.init(); {8202#true} is VALID [2022-04-27 14:51:44,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {8202#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; {8202#true} is VALID [2022-04-27 14:51:44,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:51:44,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8202#true} {8202#true} #61#return; {8202#true} is VALID [2022-04-27 14:51:44,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {8202#true} call #t~ret6 := main(); {8202#true} is VALID [2022-04-27 14:51:44,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {8202#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; {8202#true} is VALID [2022-04-27 14:51:44,777 INFO L272 TraceCheckUtils]: 6: Hoare triple {8202#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8202#true} is VALID [2022-04-27 14:51:44,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:51:44,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:51:44,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:51:44,777 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8202#true} {8202#true} #53#return; {8202#true} is VALID [2022-04-27 14:51:44,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {8202#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8240#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:44,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {8240#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8240#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:44,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {8240#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {8240#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:44,778 INFO L272 TraceCheckUtils]: 14: Hoare triple {8240#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8202#true} is VALID [2022-04-27 14:51:44,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:51:44,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:51:44,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:51:44,781 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8202#true} {8240#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {8240#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:44,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {8240#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8265#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:51:44,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {8265#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8265#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:51:44,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {8265#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {8265#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:51:44,782 INFO L272 TraceCheckUtils]: 22: Hoare triple {8265#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8202#true} is VALID [2022-04-27 14:51:44,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:51:44,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:51:44,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:51:44,782 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8202#true} {8265#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {8265#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:51:44,783 INFO L290 TraceCheckUtils]: 27: Hoare triple {8265#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8290#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:51:44,783 INFO L290 TraceCheckUtils]: 28: Hoare triple {8290#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8290#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:51:44,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {8290#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {8290#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:51:44,784 INFO L272 TraceCheckUtils]: 30: Hoare triple {8290#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8202#true} is VALID [2022-04-27 14:51:44,784 INFO L290 TraceCheckUtils]: 31: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:51:44,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:51:44,784 INFO L290 TraceCheckUtils]: 33: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:51:44,784 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8202#true} {8290#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #55#return; {8290#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:51:44,784 INFO L290 TraceCheckUtils]: 35: Hoare triple {8290#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8315#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:51:44,785 INFO L290 TraceCheckUtils]: 36: Hoare triple {8315#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8315#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:51:44,785 INFO L290 TraceCheckUtils]: 37: Hoare triple {8315#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(#t~post5 < 50);havoc #t~post5; {8315#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:51:44,785 INFO L272 TraceCheckUtils]: 38: Hoare triple {8315#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8202#true} is VALID [2022-04-27 14:51:44,785 INFO L290 TraceCheckUtils]: 39: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:51:44,785 INFO L290 TraceCheckUtils]: 40: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:51:44,785 INFO L290 TraceCheckUtils]: 41: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:51:44,786 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8202#true} {8315#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #55#return; {8315#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:51:44,786 INFO L290 TraceCheckUtils]: 43: Hoare triple {8315#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8340#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-27 14:51:44,786 INFO L290 TraceCheckUtils]: 44: Hoare triple {8340#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8340#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-27 14:51:44,787 INFO L290 TraceCheckUtils]: 45: Hoare triple {8340#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} assume !!(#t~post5 < 50);havoc #t~post5; {8340#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-27 14:51:44,787 INFO L272 TraceCheckUtils]: 46: Hoare triple {8340#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8202#true} is VALID [2022-04-27 14:51:44,787 INFO L290 TraceCheckUtils]: 47: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:51:44,787 INFO L290 TraceCheckUtils]: 48: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:51:44,787 INFO L290 TraceCheckUtils]: 49: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:51:44,791 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8202#true} {8340#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} #55#return; {8340#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-27 14:51:44,792 INFO L290 TraceCheckUtils]: 51: Hoare triple {8340#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8365#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:51:44,792 INFO L290 TraceCheckUtils]: 52: Hoare triple {8365#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8365#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:51:44,793 INFO L290 TraceCheckUtils]: 53: Hoare triple {8365#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 50);havoc #t~post5; {8365#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:51:44,793 INFO L272 TraceCheckUtils]: 54: Hoare triple {8365#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8202#true} is VALID [2022-04-27 14:51:44,793 INFO L290 TraceCheckUtils]: 55: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:51:44,793 INFO L290 TraceCheckUtils]: 56: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:51:44,793 INFO L290 TraceCheckUtils]: 57: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:51:44,793 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8202#true} {8365#(and (= 5 main_~c~0) (= 5 main_~y~0))} #55#return; {8365#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:51:44,794 INFO L290 TraceCheckUtils]: 59: Hoare triple {8365#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8390#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:51:44,794 INFO L290 TraceCheckUtils]: 60: Hoare triple {8390#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8390#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:51:44,795 INFO L290 TraceCheckUtils]: 61: Hoare triple {8390#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {8390#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:51:44,795 INFO L272 TraceCheckUtils]: 62: Hoare triple {8390#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8202#true} is VALID [2022-04-27 14:51:44,795 INFO L290 TraceCheckUtils]: 63: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:51:44,795 INFO L290 TraceCheckUtils]: 64: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:51:44,795 INFO L290 TraceCheckUtils]: 65: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:51:44,795 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8202#true} {8390#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #55#return; {8390#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:51:44,796 INFO L290 TraceCheckUtils]: 67: Hoare triple {8390#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8415#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:51:44,796 INFO L290 TraceCheckUtils]: 68: Hoare triple {8415#(and (= 7 main_~y~0) (= 7 main_~c~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8415#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:51:44,796 INFO L290 TraceCheckUtils]: 69: Hoare triple {8415#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(#t~post5 < 50);havoc #t~post5; {8415#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:51:44,796 INFO L272 TraceCheckUtils]: 70: Hoare triple {8415#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8202#true} is VALID [2022-04-27 14:51:44,796 INFO L290 TraceCheckUtils]: 71: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:51:44,797 INFO L290 TraceCheckUtils]: 72: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:51:44,797 INFO L290 TraceCheckUtils]: 73: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:51:44,797 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8202#true} {8415#(and (= 7 main_~y~0) (= 7 main_~c~0))} #55#return; {8415#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:51:44,797 INFO L290 TraceCheckUtils]: 75: Hoare triple {8415#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8440#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:51:44,798 INFO L290 TraceCheckUtils]: 76: Hoare triple {8440#(and (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8440#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:51:44,798 INFO L290 TraceCheckUtils]: 77: Hoare triple {8440#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 50);havoc #t~post5; {8440#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:51:44,798 INFO L272 TraceCheckUtils]: 78: Hoare triple {8440#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8202#true} is VALID [2022-04-27 14:51:44,798 INFO L290 TraceCheckUtils]: 79: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:51:44,798 INFO L290 TraceCheckUtils]: 80: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:51:44,798 INFO L290 TraceCheckUtils]: 81: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:51:44,799 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {8202#true} {8440#(and (= main_~y~0 8) (= main_~c~0 8))} #55#return; {8440#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:51:44,799 INFO L290 TraceCheckUtils]: 83: Hoare triple {8440#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8465#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:51:44,800 INFO L290 TraceCheckUtils]: 84: Hoare triple {8465#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8465#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:51:44,800 INFO L290 TraceCheckUtils]: 85: Hoare triple {8465#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !!(#t~post5 < 50);havoc #t~post5; {8465#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:51:44,800 INFO L272 TraceCheckUtils]: 86: Hoare triple {8465#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8202#true} is VALID [2022-04-27 14:51:44,800 INFO L290 TraceCheckUtils]: 87: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:51:44,800 INFO L290 TraceCheckUtils]: 88: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:51:44,800 INFO L290 TraceCheckUtils]: 89: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:51:44,801 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {8202#true} {8465#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #55#return; {8465#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:51:44,802 INFO L290 TraceCheckUtils]: 91: Hoare triple {8465#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {8490#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-27 14:51:44,802 INFO L272 TraceCheckUtils]: 92: Hoare triple {8490#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8202#true} is VALID [2022-04-27 14:51:44,802 INFO L290 TraceCheckUtils]: 93: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:51:44,802 INFO L290 TraceCheckUtils]: 94: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:51:44,802 INFO L290 TraceCheckUtils]: 95: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:51:44,802 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {8202#true} {8490#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} #57#return; {8490#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-27 14:51:44,803 INFO L272 TraceCheckUtils]: 97: Hoare triple {8490#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8509#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:51:44,803 INFO L290 TraceCheckUtils]: 98: Hoare triple {8509#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8513#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:51:44,804 INFO L290 TraceCheckUtils]: 99: Hoare triple {8513#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8203#false} is VALID [2022-04-27 14:51:44,804 INFO L290 TraceCheckUtils]: 100: Hoare triple {8203#false} assume !false; {8203#false} is VALID [2022-04-27 14:51:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 22 proven. 180 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-27 14:51:44,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:51:45,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:51:45,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29213833] [2022-04-27 14:51:45,098 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:51:45,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206718174] [2022-04-27 14:51:45,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206718174] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:51:45,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:51:45,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-27 14:51:45,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389837117] [2022-04-27 14:51:45,098 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:51:45,098 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 101 [2022-04-27 14:51:45,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:51:45,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 14:51:45,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:45,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 14:51:45,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:51:45,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 14:51:45,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:51:45,148 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 14:51:46,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:46,220 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2022-04-27 14:51:46,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 14:51:46,220 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 101 [2022-04-27 14:51:46,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:51:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 14:51:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-27 14:51:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 14:51:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-27 14:51:46,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 84 transitions. [2022-04-27 14:51:46,280 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:51:46,283 INFO L225 Difference]: With dead ends: 108 [2022-04-27 14:51:46,284 INFO L226 Difference]: Without dead ends: 102 [2022-04-27 14:51:46,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-27 14:51:46,286 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:51:46,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 559 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 14:51:46,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-27 14:51:46,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-27 14:51:46,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:51:46,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:51:46,342 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:51:46,342 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:51:46,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:46,344 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-27 14:51:46,344 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-27 14:51:46,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:46,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:46,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 102 states. [2022-04-27 14:51:46,344 INFO L87 Difference]: Start difference. First operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 102 states. [2022-04-27 14:51:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:46,345 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-27 14:51:46,345 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-27 14:51:46,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:46,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:46,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:51:46,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:51:46,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:51:46,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2022-04-27 14:51:46,347 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 101 [2022-04-27 14:51:46,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:51:46,347 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2022-04-27 14:51:46,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 14:51:46,348 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-27 14:51:46,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-27 14:51:46,348 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:51:46,348 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:51:46,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 14:51:46,554 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:51:46,554 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:51:46,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:51:46,554 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 2 times [2022-04-27 14:51:46,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:51:46,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288671229] [2022-04-27 14:51:46,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:46,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:51:46,568 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:51:46,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1817094244] [2022-04-27 14:51:46,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:51:46,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:51:46,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:51:46,569 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:51:46,580 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:51:46,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:51:46,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:51:46,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 14:51:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:46,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:51:47,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {9082#true} call ULTIMATE.init(); {9082#true} is VALID [2022-04-27 14:51:47,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {9082#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; {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:47,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {9090#(<= ~counter~0 0)} assume true; {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:47,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9090#(<= ~counter~0 0)} {9082#true} #61#return; {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:47,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {9090#(<= ~counter~0 0)} call #t~ret6 := main(); {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:47,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {9090#(<= ~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; {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:47,124 INFO L272 TraceCheckUtils]: 6: Hoare triple {9090#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:47,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {9090#(<= ~counter~0 0)} ~cond := #in~cond; {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:47,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {9090#(<= ~counter~0 0)} assume !(0 == ~cond); {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:47,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {9090#(<= ~counter~0 0)} assume true; {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:47,125 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9090#(<= ~counter~0 0)} {9090#(<= ~counter~0 0)} #53#return; {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:47,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {9090#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:51:47,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {9090#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9124#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:47,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {9124#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {9124#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:47,126 INFO L272 TraceCheckUtils]: 14: Hoare triple {9124#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9124#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:47,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {9124#(<= ~counter~0 1)} ~cond := #in~cond; {9124#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:47,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {9124#(<= ~counter~0 1)} assume !(0 == ~cond); {9124#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:47,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {9124#(<= ~counter~0 1)} assume true; {9124#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:47,127 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9124#(<= ~counter~0 1)} {9124#(<= ~counter~0 1)} #55#return; {9124#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:47,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {9124#(<= ~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 * ~y~0 * ~y~0 + ~x~0; {9124#(<= ~counter~0 1)} is VALID [2022-04-27 14:51:47,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {9124#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9149#(<= ~counter~0 2)} is VALID [2022-04-27 14:51:47,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {9149#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {9149#(<= ~counter~0 2)} is VALID [2022-04-27 14:51:47,129 INFO L272 TraceCheckUtils]: 22: Hoare triple {9149#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9149#(<= ~counter~0 2)} is VALID [2022-04-27 14:51:47,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {9149#(<= ~counter~0 2)} ~cond := #in~cond; {9149#(<= ~counter~0 2)} is VALID [2022-04-27 14:51:47,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {9149#(<= ~counter~0 2)} assume !(0 == ~cond); {9149#(<= ~counter~0 2)} is VALID [2022-04-27 14:51:47,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {9149#(<= ~counter~0 2)} assume true; {9149#(<= ~counter~0 2)} is VALID [2022-04-27 14:51:47,130 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9149#(<= ~counter~0 2)} {9149#(<= ~counter~0 2)} #55#return; {9149#(<= ~counter~0 2)} is VALID [2022-04-27 14:51:47,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {9149#(<= ~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 * ~y~0 * ~y~0 + ~x~0; {9149#(<= ~counter~0 2)} is VALID [2022-04-27 14:51:47,130 INFO L290 TraceCheckUtils]: 28: Hoare triple {9149#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9174#(<= ~counter~0 3)} is VALID [2022-04-27 14:51:47,131 INFO L290 TraceCheckUtils]: 29: Hoare triple {9174#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {9174#(<= ~counter~0 3)} is VALID [2022-04-27 14:51:47,131 INFO L272 TraceCheckUtils]: 30: Hoare triple {9174#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9174#(<= ~counter~0 3)} is VALID [2022-04-27 14:51:47,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {9174#(<= ~counter~0 3)} ~cond := #in~cond; {9174#(<= ~counter~0 3)} is VALID [2022-04-27 14:51:47,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {9174#(<= ~counter~0 3)} assume !(0 == ~cond); {9174#(<= ~counter~0 3)} is VALID [2022-04-27 14:51:47,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {9174#(<= ~counter~0 3)} assume true; {9174#(<= ~counter~0 3)} is VALID [2022-04-27 14:51:47,132 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9174#(<= ~counter~0 3)} {9174#(<= ~counter~0 3)} #55#return; {9174#(<= ~counter~0 3)} is VALID [2022-04-27 14:51:47,132 INFO L290 TraceCheckUtils]: 35: Hoare triple {9174#(<= ~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 * ~y~0 * ~y~0 + ~x~0; {9174#(<= ~counter~0 3)} is VALID [2022-04-27 14:51:47,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {9174#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9199#(<= ~counter~0 4)} is VALID [2022-04-27 14:51:47,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {9199#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {9199#(<= ~counter~0 4)} is VALID [2022-04-27 14:51:47,133 INFO L272 TraceCheckUtils]: 38: Hoare triple {9199#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9199#(<= ~counter~0 4)} is VALID [2022-04-27 14:51:47,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {9199#(<= ~counter~0 4)} ~cond := #in~cond; {9199#(<= ~counter~0 4)} is VALID [2022-04-27 14:51:47,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {9199#(<= ~counter~0 4)} assume !(0 == ~cond); {9199#(<= ~counter~0 4)} is VALID [2022-04-27 14:51:47,134 INFO L290 TraceCheckUtils]: 41: Hoare triple {9199#(<= ~counter~0 4)} assume true; {9199#(<= ~counter~0 4)} is VALID [2022-04-27 14:51:47,135 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9199#(<= ~counter~0 4)} {9199#(<= ~counter~0 4)} #55#return; {9199#(<= ~counter~0 4)} is VALID [2022-04-27 14:51:47,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {9199#(<= ~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 * ~y~0 * ~y~0 + ~x~0; {9199#(<= ~counter~0 4)} is VALID [2022-04-27 14:51:47,135 INFO L290 TraceCheckUtils]: 44: Hoare triple {9199#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9224#(<= ~counter~0 5)} is VALID [2022-04-27 14:51:47,135 INFO L290 TraceCheckUtils]: 45: Hoare triple {9224#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {9224#(<= ~counter~0 5)} is VALID [2022-04-27 14:51:47,136 INFO L272 TraceCheckUtils]: 46: Hoare triple {9224#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9224#(<= ~counter~0 5)} is VALID [2022-04-27 14:51:47,136 INFO L290 TraceCheckUtils]: 47: Hoare triple {9224#(<= ~counter~0 5)} ~cond := #in~cond; {9224#(<= ~counter~0 5)} is VALID [2022-04-27 14:51:47,136 INFO L290 TraceCheckUtils]: 48: Hoare triple {9224#(<= ~counter~0 5)} assume !(0 == ~cond); {9224#(<= ~counter~0 5)} is VALID [2022-04-27 14:51:47,136 INFO L290 TraceCheckUtils]: 49: Hoare triple {9224#(<= ~counter~0 5)} assume true; {9224#(<= ~counter~0 5)} is VALID [2022-04-27 14:51:47,137 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9224#(<= ~counter~0 5)} {9224#(<= ~counter~0 5)} #55#return; {9224#(<= ~counter~0 5)} is VALID [2022-04-27 14:51:47,137 INFO L290 TraceCheckUtils]: 51: Hoare triple {9224#(<= ~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 * ~y~0 * ~y~0 + ~x~0; {9224#(<= ~counter~0 5)} is VALID [2022-04-27 14:51:47,138 INFO L290 TraceCheckUtils]: 52: Hoare triple {9224#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9249#(<= ~counter~0 6)} is VALID [2022-04-27 14:51:47,138 INFO L290 TraceCheckUtils]: 53: Hoare triple {9249#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {9249#(<= ~counter~0 6)} is VALID [2022-04-27 14:51:47,138 INFO L272 TraceCheckUtils]: 54: Hoare triple {9249#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9249#(<= ~counter~0 6)} is VALID [2022-04-27 14:51:47,138 INFO L290 TraceCheckUtils]: 55: Hoare triple {9249#(<= ~counter~0 6)} ~cond := #in~cond; {9249#(<= ~counter~0 6)} is VALID [2022-04-27 14:51:47,139 INFO L290 TraceCheckUtils]: 56: Hoare triple {9249#(<= ~counter~0 6)} assume !(0 == ~cond); {9249#(<= ~counter~0 6)} is VALID [2022-04-27 14:51:47,139 INFO L290 TraceCheckUtils]: 57: Hoare triple {9249#(<= ~counter~0 6)} assume true; {9249#(<= ~counter~0 6)} is VALID [2022-04-27 14:51:47,139 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9249#(<= ~counter~0 6)} {9249#(<= ~counter~0 6)} #55#return; {9249#(<= ~counter~0 6)} is VALID [2022-04-27 14:51:47,140 INFO L290 TraceCheckUtils]: 59: Hoare triple {9249#(<= ~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 * ~y~0 * ~y~0 + ~x~0; {9249#(<= ~counter~0 6)} is VALID [2022-04-27 14:51:47,140 INFO L290 TraceCheckUtils]: 60: Hoare triple {9249#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9274#(<= ~counter~0 7)} is VALID [2022-04-27 14:51:47,140 INFO L290 TraceCheckUtils]: 61: Hoare triple {9274#(<= ~counter~0 7)} assume !!(#t~post5 < 50);havoc #t~post5; {9274#(<= ~counter~0 7)} is VALID [2022-04-27 14:51:47,141 INFO L272 TraceCheckUtils]: 62: Hoare triple {9274#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9274#(<= ~counter~0 7)} is VALID [2022-04-27 14:51:47,141 INFO L290 TraceCheckUtils]: 63: Hoare triple {9274#(<= ~counter~0 7)} ~cond := #in~cond; {9274#(<= ~counter~0 7)} is VALID [2022-04-27 14:51:47,141 INFO L290 TraceCheckUtils]: 64: Hoare triple {9274#(<= ~counter~0 7)} assume !(0 == ~cond); {9274#(<= ~counter~0 7)} is VALID [2022-04-27 14:51:47,141 INFO L290 TraceCheckUtils]: 65: Hoare triple {9274#(<= ~counter~0 7)} assume true; {9274#(<= ~counter~0 7)} is VALID [2022-04-27 14:51:47,155 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9274#(<= ~counter~0 7)} {9274#(<= ~counter~0 7)} #55#return; {9274#(<= ~counter~0 7)} is VALID [2022-04-27 14:51:47,155 INFO L290 TraceCheckUtils]: 67: Hoare triple {9274#(<= ~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 * ~y~0 * ~y~0 + ~x~0; {9274#(<= ~counter~0 7)} is VALID [2022-04-27 14:51:47,156 INFO L290 TraceCheckUtils]: 68: Hoare triple {9274#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9299#(<= ~counter~0 8)} is VALID [2022-04-27 14:51:47,156 INFO L290 TraceCheckUtils]: 69: Hoare triple {9299#(<= ~counter~0 8)} assume !!(#t~post5 < 50);havoc #t~post5; {9299#(<= ~counter~0 8)} is VALID [2022-04-27 14:51:47,157 INFO L272 TraceCheckUtils]: 70: Hoare triple {9299#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9299#(<= ~counter~0 8)} is VALID [2022-04-27 14:51:47,157 INFO L290 TraceCheckUtils]: 71: Hoare triple {9299#(<= ~counter~0 8)} ~cond := #in~cond; {9299#(<= ~counter~0 8)} is VALID [2022-04-27 14:51:47,157 INFO L290 TraceCheckUtils]: 72: Hoare triple {9299#(<= ~counter~0 8)} assume !(0 == ~cond); {9299#(<= ~counter~0 8)} is VALID [2022-04-27 14:51:47,158 INFO L290 TraceCheckUtils]: 73: Hoare triple {9299#(<= ~counter~0 8)} assume true; {9299#(<= ~counter~0 8)} is VALID [2022-04-27 14:51:47,158 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9299#(<= ~counter~0 8)} {9299#(<= ~counter~0 8)} #55#return; {9299#(<= ~counter~0 8)} is VALID [2022-04-27 14:51:47,158 INFO L290 TraceCheckUtils]: 75: Hoare triple {9299#(<= ~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 * ~y~0 * ~y~0 + ~x~0; {9299#(<= ~counter~0 8)} is VALID [2022-04-27 14:51:47,159 INFO L290 TraceCheckUtils]: 76: Hoare triple {9299#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:51:47,159 INFO L290 TraceCheckUtils]: 77: Hoare triple {9324#(<= ~counter~0 9)} assume !!(#t~post5 < 50);havoc #t~post5; {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:51:47,159 INFO L272 TraceCheckUtils]: 78: Hoare triple {9324#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:51:47,160 INFO L290 TraceCheckUtils]: 79: Hoare triple {9324#(<= ~counter~0 9)} ~cond := #in~cond; {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:51:47,160 INFO L290 TraceCheckUtils]: 80: Hoare triple {9324#(<= ~counter~0 9)} assume !(0 == ~cond); {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:51:47,160 INFO L290 TraceCheckUtils]: 81: Hoare triple {9324#(<= ~counter~0 9)} assume true; {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:51:47,160 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {9324#(<= ~counter~0 9)} {9324#(<= ~counter~0 9)} #55#return; {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:51:47,161 INFO L290 TraceCheckUtils]: 83: Hoare triple {9324#(<= ~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 * ~y~0 * ~y~0 + ~x~0; {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:51:47,161 INFO L290 TraceCheckUtils]: 84: Hoare triple {9324#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9349#(<= ~counter~0 10)} is VALID [2022-04-27 14:51:47,161 INFO L290 TraceCheckUtils]: 85: Hoare triple {9349#(<= ~counter~0 10)} assume !!(#t~post5 < 50);havoc #t~post5; {9349#(<= ~counter~0 10)} is VALID [2022-04-27 14:51:47,162 INFO L272 TraceCheckUtils]: 86: Hoare triple {9349#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9349#(<= ~counter~0 10)} is VALID [2022-04-27 14:51:47,162 INFO L290 TraceCheckUtils]: 87: Hoare triple {9349#(<= ~counter~0 10)} ~cond := #in~cond; {9349#(<= ~counter~0 10)} is VALID [2022-04-27 14:51:47,162 INFO L290 TraceCheckUtils]: 88: Hoare triple {9349#(<= ~counter~0 10)} assume !(0 == ~cond); {9349#(<= ~counter~0 10)} is VALID [2022-04-27 14:51:47,162 INFO L290 TraceCheckUtils]: 89: Hoare triple {9349#(<= ~counter~0 10)} assume true; {9349#(<= ~counter~0 10)} is VALID [2022-04-27 14:51:47,163 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {9349#(<= ~counter~0 10)} {9349#(<= ~counter~0 10)} #55#return; {9349#(<= ~counter~0 10)} is VALID [2022-04-27 14:51:47,163 INFO L290 TraceCheckUtils]: 91: Hoare triple {9349#(<= ~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 * ~y~0 * ~y~0 + ~x~0; {9349#(<= ~counter~0 10)} is VALID [2022-04-27 14:51:47,163 INFO L290 TraceCheckUtils]: 92: Hoare triple {9349#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9374#(<= |main_#t~post5| 10)} is VALID [2022-04-27 14:51:47,164 INFO L290 TraceCheckUtils]: 93: Hoare triple {9374#(<= |main_#t~post5| 10)} assume !(#t~post5 < 50);havoc #t~post5; {9083#false} is VALID [2022-04-27 14:51:47,164 INFO L272 TraceCheckUtils]: 94: Hoare triple {9083#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9083#false} is VALID [2022-04-27 14:51:47,164 INFO L290 TraceCheckUtils]: 95: Hoare triple {9083#false} ~cond := #in~cond; {9083#false} is VALID [2022-04-27 14:51:47,164 INFO L290 TraceCheckUtils]: 96: Hoare triple {9083#false} assume !(0 == ~cond); {9083#false} is VALID [2022-04-27 14:51:47,164 INFO L290 TraceCheckUtils]: 97: Hoare triple {9083#false} assume true; {9083#false} is VALID [2022-04-27 14:51:47,164 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {9083#false} {9083#false} #57#return; {9083#false} is VALID [2022-04-27 14:51:47,164 INFO L272 TraceCheckUtils]: 99: Hoare triple {9083#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {9083#false} is VALID [2022-04-27 14:51:47,164 INFO L290 TraceCheckUtils]: 100: Hoare triple {9083#false} ~cond := #in~cond; {9083#false} is VALID [2022-04-27 14:51:47,164 INFO L290 TraceCheckUtils]: 101: Hoare triple {9083#false} assume 0 == ~cond; {9083#false} is VALID [2022-04-27 14:51:47,164 INFO L290 TraceCheckUtils]: 102: Hoare triple {9083#false} assume !false; {9083#false} is VALID [2022-04-27 14:51:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 60 proven. 380 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 14:51:47,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:51:47,712 INFO L290 TraceCheckUtils]: 102: Hoare triple {9083#false} assume !false; {9083#false} is VALID [2022-04-27 14:51:47,712 INFO L290 TraceCheckUtils]: 101: Hoare triple {9083#false} assume 0 == ~cond; {9083#false} is VALID [2022-04-27 14:51:47,713 INFO L290 TraceCheckUtils]: 100: Hoare triple {9083#false} ~cond := #in~cond; {9083#false} is VALID [2022-04-27 14:51:47,713 INFO L272 TraceCheckUtils]: 99: Hoare triple {9083#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {9083#false} is VALID [2022-04-27 14:51:47,713 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {9082#true} {9083#false} #57#return; {9083#false} is VALID [2022-04-27 14:51:47,713 INFO L290 TraceCheckUtils]: 97: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:51:47,713 INFO L290 TraceCheckUtils]: 96: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:51:47,713 INFO L290 TraceCheckUtils]: 95: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:51:47,713 INFO L272 TraceCheckUtils]: 94: Hoare triple {9083#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:51:47,713 INFO L290 TraceCheckUtils]: 93: Hoare triple {9432#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {9083#false} is VALID [2022-04-27 14:51:47,713 INFO L290 TraceCheckUtils]: 92: Hoare triple {9436#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9432#(< |main_#t~post5| 50)} is VALID [2022-04-27 14:51:47,714 INFO L290 TraceCheckUtils]: 91: Hoare triple {9436#(< ~counter~0 50)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9436#(< ~counter~0 50)} is VALID [2022-04-27 14:51:47,714 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {9082#true} {9436#(< ~counter~0 50)} #55#return; {9436#(< ~counter~0 50)} is VALID [2022-04-27 14:51:47,714 INFO L290 TraceCheckUtils]: 89: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:51:47,714 INFO L290 TraceCheckUtils]: 88: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:51:47,714 INFO L290 TraceCheckUtils]: 87: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:51:47,714 INFO L272 TraceCheckUtils]: 86: Hoare triple {9436#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:51:47,714 INFO L290 TraceCheckUtils]: 85: Hoare triple {9436#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {9436#(< ~counter~0 50)} is VALID [2022-04-27 14:51:47,715 INFO L290 TraceCheckUtils]: 84: Hoare triple {9461#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9436#(< ~counter~0 50)} is VALID [2022-04-27 14:51:47,715 INFO L290 TraceCheckUtils]: 83: Hoare triple {9461#(< ~counter~0 49)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9461#(< ~counter~0 49)} is VALID [2022-04-27 14:51:47,716 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {9082#true} {9461#(< ~counter~0 49)} #55#return; {9461#(< ~counter~0 49)} is VALID [2022-04-27 14:51:47,716 INFO L290 TraceCheckUtils]: 81: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:51:47,716 INFO L290 TraceCheckUtils]: 80: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:51:47,716 INFO L290 TraceCheckUtils]: 79: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:51:47,716 INFO L272 TraceCheckUtils]: 78: Hoare triple {9461#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:51:47,716 INFO L290 TraceCheckUtils]: 77: Hoare triple {9461#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {9461#(< ~counter~0 49)} is VALID [2022-04-27 14:51:47,717 INFO L290 TraceCheckUtils]: 76: Hoare triple {9486#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9461#(< ~counter~0 49)} is VALID [2022-04-27 14:51:47,717 INFO L290 TraceCheckUtils]: 75: Hoare triple {9486#(< ~counter~0 48)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9486#(< ~counter~0 48)} is VALID [2022-04-27 14:51:47,717 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9082#true} {9486#(< ~counter~0 48)} #55#return; {9486#(< ~counter~0 48)} is VALID [2022-04-27 14:51:47,718 INFO L290 TraceCheckUtils]: 73: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:51:47,718 INFO L290 TraceCheckUtils]: 72: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:51:47,718 INFO L290 TraceCheckUtils]: 71: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:51:47,718 INFO L272 TraceCheckUtils]: 70: Hoare triple {9486#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:51:47,718 INFO L290 TraceCheckUtils]: 69: Hoare triple {9486#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {9486#(< ~counter~0 48)} is VALID [2022-04-27 14:51:47,718 INFO L290 TraceCheckUtils]: 68: Hoare triple {9511#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9486#(< ~counter~0 48)} is VALID [2022-04-27 14:51:47,719 INFO L290 TraceCheckUtils]: 67: Hoare triple {9511#(< ~counter~0 47)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9511#(< ~counter~0 47)} is VALID [2022-04-27 14:51:47,719 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9082#true} {9511#(< ~counter~0 47)} #55#return; {9511#(< ~counter~0 47)} is VALID [2022-04-27 14:51:47,719 INFO L290 TraceCheckUtils]: 65: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:51:47,719 INFO L290 TraceCheckUtils]: 64: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:51:47,719 INFO L290 TraceCheckUtils]: 63: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:51:47,719 INFO L272 TraceCheckUtils]: 62: Hoare triple {9511#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:51:47,719 INFO L290 TraceCheckUtils]: 61: Hoare triple {9511#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {9511#(< ~counter~0 47)} is VALID [2022-04-27 14:51:47,720 INFO L290 TraceCheckUtils]: 60: Hoare triple {9536#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9511#(< ~counter~0 47)} is VALID [2022-04-27 14:51:47,720 INFO L290 TraceCheckUtils]: 59: Hoare triple {9536#(< ~counter~0 46)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9536#(< ~counter~0 46)} is VALID [2022-04-27 14:51:47,720 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9082#true} {9536#(< ~counter~0 46)} #55#return; {9536#(< ~counter~0 46)} is VALID [2022-04-27 14:51:47,721 INFO L290 TraceCheckUtils]: 57: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:51:47,721 INFO L290 TraceCheckUtils]: 56: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:51:47,721 INFO L290 TraceCheckUtils]: 55: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:51:47,721 INFO L272 TraceCheckUtils]: 54: Hoare triple {9536#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:51:47,721 INFO L290 TraceCheckUtils]: 53: Hoare triple {9536#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {9536#(< ~counter~0 46)} is VALID [2022-04-27 14:51:47,721 INFO L290 TraceCheckUtils]: 52: Hoare triple {9561#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9536#(< ~counter~0 46)} is VALID [2022-04-27 14:51:47,722 INFO L290 TraceCheckUtils]: 51: Hoare triple {9561#(< ~counter~0 45)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9561#(< ~counter~0 45)} is VALID [2022-04-27 14:51:47,722 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9082#true} {9561#(< ~counter~0 45)} #55#return; {9561#(< ~counter~0 45)} is VALID [2022-04-27 14:51:47,722 INFO L290 TraceCheckUtils]: 49: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:51:47,722 INFO L290 TraceCheckUtils]: 48: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:51:47,722 INFO L290 TraceCheckUtils]: 47: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:51:47,722 INFO L272 TraceCheckUtils]: 46: Hoare triple {9561#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:51:47,722 INFO L290 TraceCheckUtils]: 45: Hoare triple {9561#(< ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {9561#(< ~counter~0 45)} is VALID [2022-04-27 14:51:47,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {9586#(< ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9561#(< ~counter~0 45)} is VALID [2022-04-27 14:51:47,723 INFO L290 TraceCheckUtils]: 43: Hoare triple {9586#(< ~counter~0 44)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9586#(< ~counter~0 44)} is VALID [2022-04-27 14:51:47,724 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9082#true} {9586#(< ~counter~0 44)} #55#return; {9586#(< ~counter~0 44)} is VALID [2022-04-27 14:51:47,724 INFO L290 TraceCheckUtils]: 41: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:51:47,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:51:47,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:51:47,724 INFO L272 TraceCheckUtils]: 38: Hoare triple {9586#(< ~counter~0 44)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:51:47,724 INFO L290 TraceCheckUtils]: 37: Hoare triple {9586#(< ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {9586#(< ~counter~0 44)} is VALID [2022-04-27 14:51:47,724 INFO L290 TraceCheckUtils]: 36: Hoare triple {9611#(< ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9586#(< ~counter~0 44)} is VALID [2022-04-27 14:51:47,725 INFO L290 TraceCheckUtils]: 35: Hoare triple {9611#(< ~counter~0 43)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9611#(< ~counter~0 43)} is VALID [2022-04-27 14:51:47,725 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9082#true} {9611#(< ~counter~0 43)} #55#return; {9611#(< ~counter~0 43)} is VALID [2022-04-27 14:51:47,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:51:47,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:51:47,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:51:47,725 INFO L272 TraceCheckUtils]: 30: Hoare triple {9611#(< ~counter~0 43)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:51:47,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {9611#(< ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {9611#(< ~counter~0 43)} is VALID [2022-04-27 14:51:47,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {9636#(< ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9611#(< ~counter~0 43)} is VALID [2022-04-27 14:51:47,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {9636#(< ~counter~0 42)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9636#(< ~counter~0 42)} is VALID [2022-04-27 14:51:47,727 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9082#true} {9636#(< ~counter~0 42)} #55#return; {9636#(< ~counter~0 42)} is VALID [2022-04-27 14:51:47,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:51:47,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:51:47,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:51:47,727 INFO L272 TraceCheckUtils]: 22: Hoare triple {9636#(< ~counter~0 42)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:51:47,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {9636#(< ~counter~0 42)} assume !!(#t~post5 < 50);havoc #t~post5; {9636#(< ~counter~0 42)} is VALID [2022-04-27 14:51:47,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {9661#(< ~counter~0 41)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9636#(< ~counter~0 42)} is VALID [2022-04-27 14:51:47,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {9661#(< ~counter~0 41)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9661#(< ~counter~0 41)} is VALID [2022-04-27 14:51:47,728 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9082#true} {9661#(< ~counter~0 41)} #55#return; {9661#(< ~counter~0 41)} is VALID [2022-04-27 14:51:47,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:51:47,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:51:47,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:51:47,728 INFO L272 TraceCheckUtils]: 14: Hoare triple {9661#(< ~counter~0 41)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:51:47,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {9661#(< ~counter~0 41)} assume !!(#t~post5 < 50);havoc #t~post5; {9661#(< ~counter~0 41)} is VALID [2022-04-27 14:51:47,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {9686#(< ~counter~0 40)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9661#(< ~counter~0 41)} is VALID [2022-04-27 14:51:47,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {9686#(< ~counter~0 40)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9686#(< ~counter~0 40)} is VALID [2022-04-27 14:51:47,730 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9082#true} {9686#(< ~counter~0 40)} #53#return; {9686#(< ~counter~0 40)} is VALID [2022-04-27 14:51:47,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:51:47,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:51:47,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:51:47,730 INFO L272 TraceCheckUtils]: 6: Hoare triple {9686#(< ~counter~0 40)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:51:47,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {9686#(< ~counter~0 40)} 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; {9686#(< ~counter~0 40)} is VALID [2022-04-27 14:51:47,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {9686#(< ~counter~0 40)} call #t~ret6 := main(); {9686#(< ~counter~0 40)} is VALID [2022-04-27 14:51:47,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9686#(< ~counter~0 40)} {9082#true} #61#return; {9686#(< ~counter~0 40)} is VALID [2022-04-27 14:51:47,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {9686#(< ~counter~0 40)} assume true; {9686#(< ~counter~0 40)} is VALID [2022-04-27 14:51:47,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {9082#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; {9686#(< ~counter~0 40)} is VALID [2022-04-27 14:51:47,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {9082#true} call ULTIMATE.init(); {9082#true} is VALID [2022-04-27 14:51:47,732 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 22 proven. 200 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-27 14:51:47,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:51:47,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288671229] [2022-04-27 14:51:47,732 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:51:47,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817094244] [2022-04-27 14:51:47,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817094244] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:51:47,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:51:47,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-27 14:51:47,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345534010] [2022-04-27 14:51:47,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:51:47,733 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.461538461538462) internal successors, (116), 26 states have internal predecessors, (116), 24 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (26), 23 states have call predecessors, (26), 24 states have call successors, (26) Word has length 103 [2022-04-27 14:51:47,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:51:47,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 4.461538461538462) internal successors, (116), 26 states have internal predecessors, (116), 24 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (26), 23 states have call predecessors, (26), 24 states have call successors, (26) [2022-04-27 14:51:47,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:47,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 14:51:47,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:51:47,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 14:51:47,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-27 14:51:47,851 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand has 26 states, 26 states have (on average 4.461538461538462) internal successors, (116), 26 states have internal predecessors, (116), 24 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (26), 23 states have call predecessors, (26), 24 states have call successors, (26) [2022-04-27 14:51:49,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:49,067 INFO L93 Difference]: Finished difference Result 272 states and 296 transitions. [2022-04-27 14:51:49,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-27 14:51:49,068 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.461538461538462) internal successors, (116), 26 states have internal predecessors, (116), 24 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (26), 23 states have call predecessors, (26), 24 states have call successors, (26) Word has length 103 [2022-04-27 14:51:49,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:51:49,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.461538461538462) internal successors, (116), 26 states have internal predecessors, (116), 24 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (26), 23 states have call predecessors, (26), 24 states have call successors, (26) [2022-04-27 14:51:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 283 transitions. [2022-04-27 14:51:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.461538461538462) internal successors, (116), 26 states have internal predecessors, (116), 24 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (26), 23 states have call predecessors, (26), 24 states have call successors, (26) [2022-04-27 14:51:49,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 283 transitions. [2022-04-27 14:51:49,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 283 transitions. [2022-04-27 14:51:49,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:49,261 INFO L225 Difference]: With dead ends: 272 [2022-04-27 14:51:49,261 INFO L226 Difference]: Without dead ends: 262 [2022-04-27 14:51:49,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 181 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:51:49,262 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 314 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:51:49,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 251 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:51:49,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-04-27 14:51:49,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 207. [2022-04-27 14:51:49,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:51:49,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand has 207 states, 144 states have (on average 1.0902777777777777) internal successors, (157), 155 states have internal predecessors, (157), 38 states have call successors, (38), 26 states have call predecessors, (38), 24 states have return successors, (36), 25 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 14:51:49,342 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand has 207 states, 144 states have (on average 1.0902777777777777) internal successors, (157), 155 states have internal predecessors, (157), 38 states have call successors, (38), 26 states have call predecessors, (38), 24 states have return successors, (36), 25 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 14:51:49,342 INFO L87 Difference]: Start difference. First operand 262 states. Second operand has 207 states, 144 states have (on average 1.0902777777777777) internal successors, (157), 155 states have internal predecessors, (157), 38 states have call successors, (38), 26 states have call predecessors, (38), 24 states have return successors, (36), 25 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 14:51:49,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:49,347 INFO L93 Difference]: Finished difference Result 262 states and 275 transitions. [2022-04-27 14:51:49,347 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 275 transitions. [2022-04-27 14:51:49,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:49,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:49,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 144 states have (on average 1.0902777777777777) internal successors, (157), 155 states have internal predecessors, (157), 38 states have call successors, (38), 26 states have call predecessors, (38), 24 states have return successors, (36), 25 states have call predecessors, (36), 36 states have call successors, (36) Second operand 262 states. [2022-04-27 14:51:49,347 INFO L87 Difference]: Start difference. First operand has 207 states, 144 states have (on average 1.0902777777777777) internal successors, (157), 155 states have internal predecessors, (157), 38 states have call successors, (38), 26 states have call predecessors, (38), 24 states have return successors, (36), 25 states have call predecessors, (36), 36 states have call successors, (36) Second operand 262 states. [2022-04-27 14:51:49,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:49,352 INFO L93 Difference]: Finished difference Result 262 states and 275 transitions. [2022-04-27 14:51:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 275 transitions. [2022-04-27 14:51:49,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:49,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:49,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:51:49,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:51:49,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 144 states have (on average 1.0902777777777777) internal successors, (157), 155 states have internal predecessors, (157), 38 states have call successors, (38), 26 states have call predecessors, (38), 24 states have return successors, (36), 25 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 14:51:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 231 transitions. [2022-04-27 14:51:49,356 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 231 transitions. Word has length 103 [2022-04-27 14:51:49,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:51:49,356 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 231 transitions. [2022-04-27 14:51:49,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.461538461538462) internal successors, (116), 26 states have internal predecessors, (116), 24 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (26), 23 states have call predecessors, (26), 24 states have call successors, (26) [2022-04-27 14:51:49,356 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 231 transitions. [2022-04-27 14:51:49,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-27 14:51:49,357 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:51:49,357 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:51:49,376 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:51:49,571 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:51:49,571 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:51:49,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:51:49,572 INFO L85 PathProgramCache]: Analyzing trace with hash -324109488, now seen corresponding path program 10 times [2022-04-27 14:51:49,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:51:49,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186596339] [2022-04-27 14:51:49,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:49,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:51:49,585 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:51:49,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1870465235] [2022-04-27 14:51:49,585 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:51:49,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:51:49,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:51:49,586 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:51:49,587 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:51:49,630 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:51:49,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:51:49,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-27 14:51:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:49,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:51:50,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {10970#true} call ULTIMATE.init(); {10970#true} is VALID [2022-04-27 14:51:50,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {10970#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; {10970#true} is VALID [2022-04-27 14:51:50,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {10970#true} assume true; {10970#true} is VALID [2022-04-27 14:51:50,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10970#true} {10970#true} #61#return; {10970#true} is VALID [2022-04-27 14:51:50,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {10970#true} call #t~ret6 := main(); {10970#true} is VALID [2022-04-27 14:51:50,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {10970#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; {10970#true} is VALID [2022-04-27 14:51:50,118 INFO L272 TraceCheckUtils]: 6: Hoare triple {10970#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10970#true} is VALID [2022-04-27 14:51:50,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {10970#true} ~cond := #in~cond; {10970#true} is VALID [2022-04-27 14:51:50,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {10970#true} assume !(0 == ~cond); {10970#true} is VALID [2022-04-27 14:51:50,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {10970#true} assume true; {10970#true} is VALID [2022-04-27 14:51:50,118 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10970#true} {10970#true} #53#return; {10970#true} is VALID [2022-04-27 14:51:50,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {10970#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11008#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:50,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {11008#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11008#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:50,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {11008#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {11008#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:50,119 INFO L272 TraceCheckUtils]: 14: Hoare triple {11008#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10970#true} is VALID [2022-04-27 14:51:50,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {10970#true} ~cond := #in~cond; {10970#true} is VALID [2022-04-27 14:51:50,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {10970#true} assume !(0 == ~cond); {10970#true} is VALID [2022-04-27 14:51:50,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {10970#true} assume true; {10970#true} is VALID [2022-04-27 14:51:50,120 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10970#true} {11008#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {11008#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:50,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {11008#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11033#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:51:50,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {11033#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11033#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:51:50,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {11033#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {11033#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:51:50,123 INFO L272 TraceCheckUtils]: 22: Hoare triple {11033#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10970#true} is VALID [2022-04-27 14:51:50,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {10970#true} ~cond := #in~cond; {10970#true} is VALID [2022-04-27 14:51:50,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {10970#true} assume !(0 == ~cond); {10970#true} is VALID [2022-04-27 14:51:50,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {10970#true} assume true; {10970#true} is VALID [2022-04-27 14:51:50,123 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10970#true} {11033#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #55#return; {11033#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:51:50,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {11033#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11058#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:51:50,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {11058#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11058#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:51:50,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {11058#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {11058#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:51:50,124 INFO L272 TraceCheckUtils]: 30: Hoare triple {11058#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10970#true} is VALID [2022-04-27 14:51:50,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {10970#true} ~cond := #in~cond; {10970#true} is VALID [2022-04-27 14:51:50,124 INFO L290 TraceCheckUtils]: 32: Hoare triple {10970#true} assume !(0 == ~cond); {10970#true} is VALID [2022-04-27 14:51:50,124 INFO L290 TraceCheckUtils]: 33: Hoare triple {10970#true} assume true; {10970#true} is VALID [2022-04-27 14:51:50,125 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10970#true} {11058#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #55#return; {11058#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:51:50,125 INFO L290 TraceCheckUtils]: 35: Hoare triple {11058#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11083#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:51:50,125 INFO L290 TraceCheckUtils]: 36: Hoare triple {11083#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11083#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:51:50,126 INFO L290 TraceCheckUtils]: 37: Hoare triple {11083#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {11083#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:51:50,126 INFO L272 TraceCheckUtils]: 38: Hoare triple {11083#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10970#true} is VALID [2022-04-27 14:51:50,126 INFO L290 TraceCheckUtils]: 39: Hoare triple {10970#true} ~cond := #in~cond; {10970#true} is VALID [2022-04-27 14:51:50,126 INFO L290 TraceCheckUtils]: 40: Hoare triple {10970#true} assume !(0 == ~cond); {10970#true} is VALID [2022-04-27 14:51:50,126 INFO L290 TraceCheckUtils]: 41: Hoare triple {10970#true} assume true; {10970#true} is VALID [2022-04-27 14:51:50,126 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10970#true} {11083#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #55#return; {11083#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:51:50,127 INFO L290 TraceCheckUtils]: 43: Hoare triple {11083#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11108#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:51:50,127 INFO L290 TraceCheckUtils]: 44: Hoare triple {11108#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11108#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:51:50,127 INFO L290 TraceCheckUtils]: 45: Hoare triple {11108#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 50);havoc #t~post5; {11108#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:51:50,127 INFO L272 TraceCheckUtils]: 46: Hoare triple {11108#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10970#true} is VALID [2022-04-27 14:51:50,127 INFO L290 TraceCheckUtils]: 47: Hoare triple {10970#true} ~cond := #in~cond; {10970#true} is VALID [2022-04-27 14:51:50,127 INFO L290 TraceCheckUtils]: 48: Hoare triple {10970#true} assume !(0 == ~cond); {10970#true} is VALID [2022-04-27 14:51:50,128 INFO L290 TraceCheckUtils]: 49: Hoare triple {10970#true} assume true; {10970#true} is VALID [2022-04-27 14:51:50,128 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10970#true} {11108#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {11108#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:51:50,128 INFO L290 TraceCheckUtils]: 51: Hoare triple {11108#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11133#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:51:50,129 INFO L290 TraceCheckUtils]: 52: Hoare triple {11133#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11133#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:51:50,129 INFO L290 TraceCheckUtils]: 53: Hoare triple {11133#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 50);havoc #t~post5; {11133#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:51:50,129 INFO L272 TraceCheckUtils]: 54: Hoare triple {11133#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10970#true} is VALID [2022-04-27 14:51:50,129 INFO L290 TraceCheckUtils]: 55: Hoare triple {10970#true} ~cond := #in~cond; {10970#true} is VALID [2022-04-27 14:51:50,129 INFO L290 TraceCheckUtils]: 56: Hoare triple {10970#true} assume !(0 == ~cond); {10970#true} is VALID [2022-04-27 14:51:50,129 INFO L290 TraceCheckUtils]: 57: Hoare triple {10970#true} assume true; {10970#true} is VALID [2022-04-27 14:51:50,129 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10970#true} {11133#(and (= 5 main_~c~0) (= 5 main_~y~0))} #55#return; {11133#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:51:50,130 INFO L290 TraceCheckUtils]: 59: Hoare triple {11133#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11158#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:51:50,134 INFO L290 TraceCheckUtils]: 60: Hoare triple {11158#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11158#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:51:50,134 INFO L290 TraceCheckUtils]: 61: Hoare triple {11158#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {11158#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:51:50,134 INFO L272 TraceCheckUtils]: 62: Hoare triple {11158#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10970#true} is VALID [2022-04-27 14:51:50,134 INFO L290 TraceCheckUtils]: 63: Hoare triple {10970#true} ~cond := #in~cond; {10970#true} is VALID [2022-04-27 14:51:50,134 INFO L290 TraceCheckUtils]: 64: Hoare triple {10970#true} assume !(0 == ~cond); {10970#true} is VALID [2022-04-27 14:51:50,134 INFO L290 TraceCheckUtils]: 65: Hoare triple {10970#true} assume true; {10970#true} is VALID [2022-04-27 14:51:50,134 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10970#true} {11158#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #55#return; {11158#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:51:50,135 INFO L290 TraceCheckUtils]: 67: Hoare triple {11158#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11183#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:51:50,135 INFO L290 TraceCheckUtils]: 68: Hoare triple {11183#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11183#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:51:50,135 INFO L290 TraceCheckUtils]: 69: Hoare triple {11183#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(#t~post5 < 50);havoc #t~post5; {11183#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:51:50,136 INFO L272 TraceCheckUtils]: 70: Hoare triple {11183#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10970#true} is VALID [2022-04-27 14:51:50,136 INFO L290 TraceCheckUtils]: 71: Hoare triple {10970#true} ~cond := #in~cond; {10970#true} is VALID [2022-04-27 14:51:50,136 INFO L290 TraceCheckUtils]: 72: Hoare triple {10970#true} assume !(0 == ~cond); {10970#true} is VALID [2022-04-27 14:51:50,136 INFO L290 TraceCheckUtils]: 73: Hoare triple {10970#true} assume true; {10970#true} is VALID [2022-04-27 14:51:50,136 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10970#true} {11183#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #55#return; {11183#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:51:50,136 INFO L290 TraceCheckUtils]: 75: Hoare triple {11183#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11208#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:51:50,137 INFO L290 TraceCheckUtils]: 76: Hoare triple {11208#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11208#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:51:50,137 INFO L290 TraceCheckUtils]: 77: Hoare triple {11208#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {11208#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:51:50,137 INFO L272 TraceCheckUtils]: 78: Hoare triple {11208#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10970#true} is VALID [2022-04-27 14:51:50,137 INFO L290 TraceCheckUtils]: 79: Hoare triple {10970#true} ~cond := #in~cond; {10970#true} is VALID [2022-04-27 14:51:50,137 INFO L290 TraceCheckUtils]: 80: Hoare triple {10970#true} assume !(0 == ~cond); {10970#true} is VALID [2022-04-27 14:51:50,137 INFO L290 TraceCheckUtils]: 81: Hoare triple {10970#true} assume true; {10970#true} is VALID [2022-04-27 14:51:50,138 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10970#true} {11208#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} #55#return; {11208#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:51:50,138 INFO L290 TraceCheckUtils]: 83: Hoare triple {11208#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11233#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-27 14:51:50,138 INFO L290 TraceCheckUtils]: 84: Hoare triple {11233#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11233#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-27 14:51:50,139 INFO L290 TraceCheckUtils]: 85: Hoare triple {11233#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} assume !!(#t~post5 < 50);havoc #t~post5; {11233#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-27 14:51:50,139 INFO L272 TraceCheckUtils]: 86: Hoare triple {11233#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10970#true} is VALID [2022-04-27 14:51:50,139 INFO L290 TraceCheckUtils]: 87: Hoare triple {10970#true} ~cond := #in~cond; {10970#true} is VALID [2022-04-27 14:51:50,139 INFO L290 TraceCheckUtils]: 88: Hoare triple {10970#true} assume !(0 == ~cond); {10970#true} is VALID [2022-04-27 14:51:50,139 INFO L290 TraceCheckUtils]: 89: Hoare triple {10970#true} assume true; {10970#true} is VALID [2022-04-27 14:51:50,139 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {10970#true} {11233#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} #55#return; {11233#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-27 14:51:50,140 INFO L290 TraceCheckUtils]: 91: Hoare triple {11233#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11258#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:51:50,140 INFO L290 TraceCheckUtils]: 92: Hoare triple {11258#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11258#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:51:50,140 INFO L290 TraceCheckUtils]: 93: Hoare triple {11258#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !!(#t~post5 < 50);havoc #t~post5; {11258#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:51:50,140 INFO L272 TraceCheckUtils]: 94: Hoare triple {11258#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10970#true} is VALID [2022-04-27 14:51:50,140 INFO L290 TraceCheckUtils]: 95: Hoare triple {10970#true} ~cond := #in~cond; {10970#true} is VALID [2022-04-27 14:51:50,140 INFO L290 TraceCheckUtils]: 96: Hoare triple {10970#true} assume !(0 == ~cond); {10970#true} is VALID [2022-04-27 14:51:50,140 INFO L290 TraceCheckUtils]: 97: Hoare triple {10970#true} assume true; {10970#true} is VALID [2022-04-27 14:51:50,141 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {10970#true} {11258#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} #55#return; {11258#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:51:50,141 INFO L290 TraceCheckUtils]: 99: Hoare triple {11258#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {11283#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:51:50,142 INFO L272 TraceCheckUtils]: 100: Hoare triple {11283#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10970#true} is VALID [2022-04-27 14:51:50,142 INFO L290 TraceCheckUtils]: 101: Hoare triple {10970#true} ~cond := #in~cond; {10970#true} is VALID [2022-04-27 14:51:50,142 INFO L290 TraceCheckUtils]: 102: Hoare triple {10970#true} assume !(0 == ~cond); {10970#true} is VALID [2022-04-27 14:51:50,142 INFO L290 TraceCheckUtils]: 103: Hoare triple {10970#true} assume true; {10970#true} is VALID [2022-04-27 14:51:50,142 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {10970#true} {11283#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} #57#return; {11283#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:51:50,143 INFO L272 TraceCheckUtils]: 105: Hoare triple {11283#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {11302#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:51:50,143 INFO L290 TraceCheckUtils]: 106: Hoare triple {11302#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11306#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:51:50,143 INFO L290 TraceCheckUtils]: 107: Hoare triple {11306#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10971#false} is VALID [2022-04-27 14:51:50,143 INFO L290 TraceCheckUtils]: 108: Hoare triple {10971#false} assume !false; {10971#false} is VALID [2022-04-27 14:51:50,144 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 24 proven. 220 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-27 14:51:50,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:51:50,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:51:50,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186596339] [2022-04-27 14:51:50,384 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:51:50,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870465235] [2022-04-27 14:51:50,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870465235] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:51:50,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:51:50,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-27 14:51:50,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244812880] [2022-04-27 14:51:50,385 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:51:50,385 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 109 [2022-04-27 14:51:50,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:51:50,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 14:51:50,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:50,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 14:51:50,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:51:50,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 14:51:50,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:51:50,439 INFO L87 Difference]: Start difference. First operand 207 states and 231 transitions. Second operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 14:51:51,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:51,740 INFO L93 Difference]: Finished difference Result 212 states and 235 transitions. [2022-04-27 14:51:51,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 14:51:51,741 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 109 [2022-04-27 14:51:51,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:51:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 14:51:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2022-04-27 14:51:51,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 14:51:51,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2022-04-27 14:51:51,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 89 transitions. [2022-04-27 14:51:51,814 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:51:51,817 INFO L225 Difference]: With dead ends: 212 [2022-04-27 14:51:51,817 INFO L226 Difference]: Without dead ends: 206 [2022-04-27 14:51:51,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 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:51:51,818 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 14:51:51,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 627 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 14:51:51,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-04-27 14:51:51,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-04-27 14:51:51,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:51:51,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 206 states, 144 states have (on average 1.0833333333333333) internal successors, (156), 154 states have internal predecessors, (156), 37 states have call successors, (37), 26 states have call predecessors, (37), 24 states have return successors, (35), 25 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 14:51:51,915 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 206 states, 144 states have (on average 1.0833333333333333) internal successors, (156), 154 states have internal predecessors, (156), 37 states have call successors, (37), 26 states have call predecessors, (37), 24 states have return successors, (35), 25 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 14:51:51,915 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 206 states, 144 states have (on average 1.0833333333333333) internal successors, (156), 154 states have internal predecessors, (156), 37 states have call successors, (37), 26 states have call predecessors, (37), 24 states have return successors, (35), 25 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 14:51:51,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:51,920 INFO L93 Difference]: Finished difference Result 206 states and 228 transitions. [2022-04-27 14:51:51,920 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 228 transitions. [2022-04-27 14:51:51,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:51,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:51,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 144 states have (on average 1.0833333333333333) internal successors, (156), 154 states have internal predecessors, (156), 37 states have call successors, (37), 26 states have call predecessors, (37), 24 states have return successors, (35), 25 states have call predecessors, (35), 35 states have call successors, (35) Second operand 206 states. [2022-04-27 14:51:51,921 INFO L87 Difference]: Start difference. First operand has 206 states, 144 states have (on average 1.0833333333333333) internal successors, (156), 154 states have internal predecessors, (156), 37 states have call successors, (37), 26 states have call predecessors, (37), 24 states have return successors, (35), 25 states have call predecessors, (35), 35 states have call successors, (35) Second operand 206 states. [2022-04-27 14:51:51,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:51,929 INFO L93 Difference]: Finished difference Result 206 states and 228 transitions. [2022-04-27 14:51:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 228 transitions. [2022-04-27 14:51:51,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:51,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:51,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:51:51,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:51:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 144 states have (on average 1.0833333333333333) internal successors, (156), 154 states have internal predecessors, (156), 37 states have call successors, (37), 26 states have call predecessors, (37), 24 states have return successors, (35), 25 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 14:51:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 228 transitions. [2022-04-27 14:51:51,935 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 228 transitions. Word has length 109 [2022-04-27 14:51:51,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:51:51,935 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 228 transitions. [2022-04-27 14:51:51,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 14:51:51,935 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 228 transitions. [2022-04-27 14:51:51,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-27 14:51:51,936 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:51:51,936 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:51:51,973 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:51:52,158 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:51:52,158 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:51:52,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:51:52,159 INFO L85 PathProgramCache]: Analyzing trace with hash 988557105, now seen corresponding path program 11 times [2022-04-27 14:51:52,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:51:52,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705962171] [2022-04-27 14:51:52,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:52,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:51:52,180 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:51:52,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1063857574] [2022-04-27 14:51:52,180 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:51:52,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:51:52,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:51:52,182 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:51:52,193 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:53:59,395 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-04-27 14:53:59,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:53:59,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-27 14:53:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:59,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:00,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {12381#true} call ULTIMATE.init(); {12381#true} is VALID [2022-04-27 14:54:00,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {12381#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; {12381#true} is VALID [2022-04-27 14:54:00,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {12381#true} assume true; {12381#true} is VALID [2022-04-27 14:54:00,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12381#true} {12381#true} #61#return; {12381#true} is VALID [2022-04-27 14:54:00,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {12381#true} call #t~ret6 := main(); {12381#true} is VALID [2022-04-27 14:54:00,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {12381#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; {12381#true} is VALID [2022-04-27 14:54:00,062 INFO L272 TraceCheckUtils]: 6: Hoare triple {12381#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12381#true} is VALID [2022-04-27 14:54:00,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {12381#true} ~cond := #in~cond; {12381#true} is VALID [2022-04-27 14:54:00,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {12381#true} assume !(0 == ~cond); {12381#true} is VALID [2022-04-27 14:54:00,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {12381#true} assume true; {12381#true} is VALID [2022-04-27 14:54:00,062 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12381#true} {12381#true} #53#return; {12381#true} is VALID [2022-04-27 14:54:00,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {12381#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12419#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:00,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {12419#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12419#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:00,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {12419#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {12419#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:00,063 INFO L272 TraceCheckUtils]: 14: Hoare triple {12419#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12381#true} is VALID [2022-04-27 14:54:00,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {12381#true} ~cond := #in~cond; {12381#true} is VALID [2022-04-27 14:54:00,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {12381#true} assume !(0 == ~cond); {12381#true} is VALID [2022-04-27 14:54:00,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {12381#true} assume true; {12381#true} is VALID [2022-04-27 14:54:00,064 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12381#true} {12419#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {12419#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:00,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {12419#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:00,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {12444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:00,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {12444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {12444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:00,065 INFO L272 TraceCheckUtils]: 22: Hoare triple {12444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12381#true} is VALID [2022-04-27 14:54:00,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {12381#true} ~cond := #in~cond; {12381#true} is VALID [2022-04-27 14:54:00,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {12381#true} assume !(0 == ~cond); {12381#true} is VALID [2022-04-27 14:54:00,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {12381#true} assume true; {12381#true} is VALID [2022-04-27 14:54:00,065 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12381#true} {12444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {12444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:00,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {12444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12469#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:54:00,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {12469#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12469#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:54:00,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {12469#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 50);havoc #t~post5; {12469#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:54:00,067 INFO L272 TraceCheckUtils]: 30: Hoare triple {12469#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12381#true} is VALID [2022-04-27 14:54:00,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {12381#true} ~cond := #in~cond; {12381#true} is VALID [2022-04-27 14:54:00,067 INFO L290 TraceCheckUtils]: 32: Hoare triple {12381#true} assume !(0 == ~cond); {12381#true} is VALID [2022-04-27 14:54:00,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {12381#true} assume true; {12381#true} is VALID [2022-04-27 14:54:00,067 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12381#true} {12469#(and (= main_~y~0 2) (= main_~c~0 2))} #55#return; {12469#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:54:00,067 INFO L290 TraceCheckUtils]: 35: Hoare triple {12469#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12494#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:54:00,068 INFO L290 TraceCheckUtils]: 36: Hoare triple {12494#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12494#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:54:00,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {12494#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 50);havoc #t~post5; {12494#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:54:00,068 INFO L272 TraceCheckUtils]: 38: Hoare triple {12494#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12381#true} is VALID [2022-04-27 14:54:00,068 INFO L290 TraceCheckUtils]: 39: Hoare triple {12381#true} ~cond := #in~cond; {12381#true} is VALID [2022-04-27 14:54:00,068 INFO L290 TraceCheckUtils]: 40: Hoare triple {12381#true} assume !(0 == ~cond); {12381#true} is VALID [2022-04-27 14:54:00,068 INFO L290 TraceCheckUtils]: 41: Hoare triple {12381#true} assume true; {12381#true} is VALID [2022-04-27 14:54:00,069 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12381#true} {12494#(and (= main_~y~0 3) (= main_~c~0 3))} #55#return; {12494#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:54:00,069 INFO L290 TraceCheckUtils]: 43: Hoare triple {12494#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:54:00,069 INFO L290 TraceCheckUtils]: 44: Hoare triple {12519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:54:00,070 INFO L290 TraceCheckUtils]: 45: Hoare triple {12519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(#t~post5 < 50);havoc #t~post5; {12519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:54:00,070 INFO L272 TraceCheckUtils]: 46: Hoare triple {12519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12381#true} is VALID [2022-04-27 14:54:00,070 INFO L290 TraceCheckUtils]: 47: Hoare triple {12381#true} ~cond := #in~cond; {12381#true} is VALID [2022-04-27 14:54:00,070 INFO L290 TraceCheckUtils]: 48: Hoare triple {12381#true} assume !(0 == ~cond); {12381#true} is VALID [2022-04-27 14:54:00,070 INFO L290 TraceCheckUtils]: 49: Hoare triple {12381#true} assume true; {12381#true} is VALID [2022-04-27 14:54:00,070 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12381#true} {12519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #55#return; {12519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:54:00,071 INFO L290 TraceCheckUtils]: 51: Hoare triple {12519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:54:00,071 INFO L290 TraceCheckUtils]: 52: Hoare triple {12544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:54:00,071 INFO L290 TraceCheckUtils]: 53: Hoare triple {12544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 50);havoc #t~post5; {12544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:54:00,071 INFO L272 TraceCheckUtils]: 54: Hoare triple {12544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12381#true} is VALID [2022-04-27 14:54:00,071 INFO L290 TraceCheckUtils]: 55: Hoare triple {12381#true} ~cond := #in~cond; {12381#true} is VALID [2022-04-27 14:54:00,071 INFO L290 TraceCheckUtils]: 56: Hoare triple {12381#true} assume !(0 == ~cond); {12381#true} is VALID [2022-04-27 14:54:00,071 INFO L290 TraceCheckUtils]: 57: Hoare triple {12381#true} assume true; {12381#true} is VALID [2022-04-27 14:54:00,072 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12381#true} {12544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #55#return; {12544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:54:00,072 INFO L290 TraceCheckUtils]: 59: Hoare triple {12544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12569#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:54:00,072 INFO L290 TraceCheckUtils]: 60: Hoare triple {12569#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12569#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:54:00,073 INFO L290 TraceCheckUtils]: 61: Hoare triple {12569#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {12569#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:54:00,073 INFO L272 TraceCheckUtils]: 62: Hoare triple {12569#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12381#true} is VALID [2022-04-27 14:54:00,073 INFO L290 TraceCheckUtils]: 63: Hoare triple {12381#true} ~cond := #in~cond; {12381#true} is VALID [2022-04-27 14:54:00,073 INFO L290 TraceCheckUtils]: 64: Hoare triple {12381#true} assume !(0 == ~cond); {12381#true} is VALID [2022-04-27 14:54:00,073 INFO L290 TraceCheckUtils]: 65: Hoare triple {12381#true} assume true; {12381#true} is VALID [2022-04-27 14:54:00,073 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12381#true} {12569#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {12569#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:54:00,074 INFO L290 TraceCheckUtils]: 67: Hoare triple {12569#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12594#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:54:00,074 INFO L290 TraceCheckUtils]: 68: Hoare triple {12594#(and (= 7 main_~y~0) (= 7 main_~c~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12594#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:54:00,074 INFO L290 TraceCheckUtils]: 69: Hoare triple {12594#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(#t~post5 < 50);havoc #t~post5; {12594#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:54:00,074 INFO L272 TraceCheckUtils]: 70: Hoare triple {12594#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12381#true} is VALID [2022-04-27 14:54:00,074 INFO L290 TraceCheckUtils]: 71: Hoare triple {12381#true} ~cond := #in~cond; {12381#true} is VALID [2022-04-27 14:54:00,074 INFO L290 TraceCheckUtils]: 72: Hoare triple {12381#true} assume !(0 == ~cond); {12381#true} is VALID [2022-04-27 14:54:00,074 INFO L290 TraceCheckUtils]: 73: Hoare triple {12381#true} assume true; {12381#true} is VALID [2022-04-27 14:54:00,075 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12381#true} {12594#(and (= 7 main_~y~0) (= 7 main_~c~0))} #55#return; {12594#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:54:00,075 INFO L290 TraceCheckUtils]: 75: Hoare triple {12594#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12619#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:54:00,075 INFO L290 TraceCheckUtils]: 76: Hoare triple {12619#(and (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12619#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:54:00,076 INFO L290 TraceCheckUtils]: 77: Hoare triple {12619#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 50);havoc #t~post5; {12619#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:54:00,076 INFO L272 TraceCheckUtils]: 78: Hoare triple {12619#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12381#true} is VALID [2022-04-27 14:54:00,076 INFO L290 TraceCheckUtils]: 79: Hoare triple {12381#true} ~cond := #in~cond; {12381#true} is VALID [2022-04-27 14:54:00,076 INFO L290 TraceCheckUtils]: 80: Hoare triple {12381#true} assume !(0 == ~cond); {12381#true} is VALID [2022-04-27 14:54:00,076 INFO L290 TraceCheckUtils]: 81: Hoare triple {12381#true} assume true; {12381#true} is VALID [2022-04-27 14:54:00,076 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12381#true} {12619#(and (= main_~y~0 8) (= main_~c~0 8))} #55#return; {12619#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:54:00,077 INFO L290 TraceCheckUtils]: 83: Hoare triple {12619#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12644#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:54:00,077 INFO L290 TraceCheckUtils]: 84: Hoare triple {12644#(and (= main_~y~0 9) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12644#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:54:00,077 INFO L290 TraceCheckUtils]: 85: Hoare triple {12644#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(#t~post5 < 50);havoc #t~post5; {12644#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:54:00,077 INFO L272 TraceCheckUtils]: 86: Hoare triple {12644#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12381#true} is VALID [2022-04-27 14:54:00,077 INFO L290 TraceCheckUtils]: 87: Hoare triple {12381#true} ~cond := #in~cond; {12381#true} is VALID [2022-04-27 14:54:00,077 INFO L290 TraceCheckUtils]: 88: Hoare triple {12381#true} assume !(0 == ~cond); {12381#true} is VALID [2022-04-27 14:54:00,078 INFO L290 TraceCheckUtils]: 89: Hoare triple {12381#true} assume true; {12381#true} is VALID [2022-04-27 14:54:00,078 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12381#true} {12644#(and (= main_~y~0 9) (= main_~c~0 9))} #55#return; {12644#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:54:00,078 INFO L290 TraceCheckUtils]: 91: Hoare triple {12644#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12669#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:54:00,079 INFO L290 TraceCheckUtils]: 92: Hoare triple {12669#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12669#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:54:00,079 INFO L290 TraceCheckUtils]: 93: Hoare triple {12669#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !!(#t~post5 < 50);havoc #t~post5; {12669#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:54:00,079 INFO L272 TraceCheckUtils]: 94: Hoare triple {12669#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12381#true} is VALID [2022-04-27 14:54:00,079 INFO L290 TraceCheckUtils]: 95: Hoare triple {12381#true} ~cond := #in~cond; {12381#true} is VALID [2022-04-27 14:54:00,079 INFO L290 TraceCheckUtils]: 96: Hoare triple {12381#true} assume !(0 == ~cond); {12381#true} is VALID [2022-04-27 14:54:00,079 INFO L290 TraceCheckUtils]: 97: Hoare triple {12381#true} assume true; {12381#true} is VALID [2022-04-27 14:54:00,079 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {12381#true} {12669#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #55#return; {12669#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:54:00,080 INFO L290 TraceCheckUtils]: 99: Hoare triple {12669#(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 * ~y~0 * ~y~0 + ~x~0; {12694#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:54:00,080 INFO L290 TraceCheckUtils]: 100: Hoare triple {12694#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12694#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:54:00,080 INFO L290 TraceCheckUtils]: 101: Hoare triple {12694#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !!(#t~post5 < 50);havoc #t~post5; {12694#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:54:00,081 INFO L272 TraceCheckUtils]: 102: Hoare triple {12694#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12381#true} is VALID [2022-04-27 14:54:00,081 INFO L290 TraceCheckUtils]: 103: Hoare triple {12381#true} ~cond := #in~cond; {12381#true} is VALID [2022-04-27 14:54:00,081 INFO L290 TraceCheckUtils]: 104: Hoare triple {12381#true} assume !(0 == ~cond); {12381#true} is VALID [2022-04-27 14:54:00,081 INFO L290 TraceCheckUtils]: 105: Hoare triple {12381#true} assume true; {12381#true} is VALID [2022-04-27 14:54:00,081 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {12381#true} {12694#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} #55#return; {12694#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:54:00,081 INFO L290 TraceCheckUtils]: 107: Hoare triple {12694#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !(~c~0 < ~k~0); {12719#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} is VALID [2022-04-27 14:54:00,082 INFO L272 TraceCheckUtils]: 108: Hoare triple {12719#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12381#true} is VALID [2022-04-27 14:54:00,082 INFO L290 TraceCheckUtils]: 109: Hoare triple {12381#true} ~cond := #in~cond; {12381#true} is VALID [2022-04-27 14:54:00,082 INFO L290 TraceCheckUtils]: 110: Hoare triple {12381#true} assume !(0 == ~cond); {12381#true} is VALID [2022-04-27 14:54:00,082 INFO L290 TraceCheckUtils]: 111: Hoare triple {12381#true} assume true; {12381#true} is VALID [2022-04-27 14:54:00,082 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {12381#true} {12719#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} #57#return; {12719#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} is VALID [2022-04-27 14:54:00,083 INFO L272 TraceCheckUtils]: 113: Hoare triple {12719#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12738#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:00,083 INFO L290 TraceCheckUtils]: 114: Hoare triple {12738#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12742#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:00,083 INFO L290 TraceCheckUtils]: 115: Hoare triple {12742#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12382#false} is VALID [2022-04-27 14:54:00,083 INFO L290 TraceCheckUtils]: 116: Hoare triple {12382#false} assume !false; {12382#false} is VALID [2022-04-27 14:54:00,084 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 26 proven. 264 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-27 14:54:00,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:00,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:00,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705962171] [2022-04-27 14:54:00,408 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:00,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063857574] [2022-04-27 14:54:00,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063857574] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:00,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:00,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-27 14:54:00,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059177235] [2022-04-27 14:54:00,409 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:54:00,409 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 117 [2022-04-27 14:54:00,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:00,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:54:00,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:00,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 14:54:00,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:00,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 14:54:00,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-27 14:54:00,466 INFO L87 Difference]: Start difference. First operand 206 states and 228 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:54:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:01,961 INFO L93 Difference]: Finished difference Result 211 states and 232 transitions. [2022-04-27 14:54:01,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 14:54:01,961 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 117 [2022-04-27 14:54:01,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:54:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-04-27 14:54:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:54:01,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-04-27 14:54:01,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 94 transitions. [2022-04-27 14:54:02,039 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:54:02,042 INFO L225 Difference]: With dead ends: 211 [2022-04-27 14:54:02,043 INFO L226 Difference]: Without dead ends: 205 [2022-04-27 14:54:02,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 116 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:54:02,043 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:02,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 701 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 14:54:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-04-27 14:54:02,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-04-27 14:54:02,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:02,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 205 states, 144 states have (on average 1.0763888888888888) internal successors, (155), 153 states have internal predecessors, (155), 36 states have call successors, (36), 26 states have call predecessors, (36), 24 states have return successors, (34), 25 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 14:54:02,138 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 205 states, 144 states have (on average 1.0763888888888888) internal successors, (155), 153 states have internal predecessors, (155), 36 states have call successors, (36), 26 states have call predecessors, (36), 24 states have return successors, (34), 25 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 14:54:02,139 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 205 states, 144 states have (on average 1.0763888888888888) internal successors, (155), 153 states have internal predecessors, (155), 36 states have call successors, (36), 26 states have call predecessors, (36), 24 states have return successors, (34), 25 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 14:54:02,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:02,142 INFO L93 Difference]: Finished difference Result 205 states and 225 transitions. [2022-04-27 14:54:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 225 transitions. [2022-04-27 14:54:02,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:02,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:02,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 205 states, 144 states have (on average 1.0763888888888888) internal successors, (155), 153 states have internal predecessors, (155), 36 states have call successors, (36), 26 states have call predecessors, (36), 24 states have return successors, (34), 25 states have call predecessors, (34), 34 states have call successors, (34) Second operand 205 states. [2022-04-27 14:54:02,143 INFO L87 Difference]: Start difference. First operand has 205 states, 144 states have (on average 1.0763888888888888) internal successors, (155), 153 states have internal predecessors, (155), 36 states have call successors, (36), 26 states have call predecessors, (36), 24 states have return successors, (34), 25 states have call predecessors, (34), 34 states have call successors, (34) Second operand 205 states. [2022-04-27 14:54:02,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:02,145 INFO L93 Difference]: Finished difference Result 205 states and 225 transitions. [2022-04-27 14:54:02,145 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 225 transitions. [2022-04-27 14:54:02,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:02,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:02,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:02,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 144 states have (on average 1.0763888888888888) internal successors, (155), 153 states have internal predecessors, (155), 36 states have call successors, (36), 26 states have call predecessors, (36), 24 states have return successors, (34), 25 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 14:54:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 225 transitions. [2022-04-27 14:54:02,149 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 225 transitions. Word has length 117 [2022-04-27 14:54:02,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:02,149 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 225 transitions. [2022-04-27 14:54:02,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:54:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 225 transitions. [2022-04-27 14:54:02,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-27 14:54:02,150 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:02,150 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:02,197 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:54:02,359 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:54:02,360 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:02,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:02,360 INFO L85 PathProgramCache]: Analyzing trace with hash 636252690, now seen corresponding path program 12 times [2022-04-27 14:54:02,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:02,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384982799] [2022-04-27 14:54:02,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:02,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:02,377 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:02,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1399253489] [2022-04-27 14:54:02,377 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:54:02,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:02,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:02,378 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:54:02,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process