/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/cohencu-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 15:11:19,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 15:11:19,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 15:11:19,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 15:11:19,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 15:11:19,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 15:11:19,801 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 15:11:19,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 15:11:19,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 15:11:19,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 15:11:19,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 15:11:19,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 15:11:19,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 15:11:19,815 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 15:11:19,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 15:11:19,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 15:11:19,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 15:11:19,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 15:11:19,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 15:11:19,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 15:11:19,826 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 15:11:19,827 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 15:11:19,827 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 15:11:19,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 15:11:19,829 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 15:11:19,833 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 15:11:19,833 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 15:11:19,833 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 15:11:19,834 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 15:11:19,835 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 15:11:19,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 15:11:19,836 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 15:11:19,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 15:11:19,837 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 15:11:19,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 15:11:19,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 15:11:19,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 15:11:19,839 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 15:11:19,839 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 15:11:19,839 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 15:11:19,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 15:11:19,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 15:11:19,841 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-14 15:11:19,862 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 15:11:19,862 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 15:11:19,862 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 15:11:19,862 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 15:11:19,863 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 15:11:19,863 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 15:11:19,863 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 15:11:19,863 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 15:11:19,863 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 15:11:19,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 15:11:19,864 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 15:11:19,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 15:11:19,864 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 15:11:19,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 15:11:19,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 15:11:19,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 15:11:19,864 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 15:11:19,864 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 15:11:19,864 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 15:11:19,864 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 15:11:19,864 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 15:11:19,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 15:11:19,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 15:11:19,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 15:11:19,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:11:19,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 15:11:19,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 15:11:19,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 15:11:19,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 15:11:19,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 15:11:19,865 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 15:11:19,865 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 15:11:19,865 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 15:11:19,866 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-14 15:11:20,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 15:11:20,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 15:11:20,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 15:11:20,052 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 15:11:20,053 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 15:11:20,054 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound5.c [2022-04-14 15:11:20,093 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f98e0071f/2223710428384094b6066b8b7386d6ea/FLAG3466aa1eb [2022-04-14 15:11:20,475 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 15:11:20,476 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound5.c [2022-04-14 15:11:20,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f98e0071f/2223710428384094b6066b8b7386d6ea/FLAG3466aa1eb [2022-04-14 15:11:20,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f98e0071f/2223710428384094b6066b8b7386d6ea [2022-04-14 15:11:20,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 15:11:20,496 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 15:11:20,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 15:11:20,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 15:11:20,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 15:11:20,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:11:20" (1/1) ... [2022-04-14 15:11:20,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@852f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:20, skipping insertion in model container [2022-04-14 15:11:20,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:11:20" (1/1) ... [2022-04-14 15:11:20,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 15:11:20,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 15:11:20,666 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/cohencu-ll_unwindbound5.c[588,601] [2022-04-14 15:11:20,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:11:20,706 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 15:11:20,717 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/cohencu-ll_unwindbound5.c[588,601] [2022-04-14 15:11:20,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:11:20,743 INFO L208 MainTranslator]: Completed translation [2022-04-14 15:11:20,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:20 WrapperNode [2022-04-14 15:11:20,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 15:11:20,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 15:11:20,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 15:11:20,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 15:11:20,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:20" (1/1) ... [2022-04-14 15:11:20,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:20" (1/1) ... [2022-04-14 15:11:20,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:20" (1/1) ... [2022-04-14 15:11:20,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:20" (1/1) ... [2022-04-14 15:11:20,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:20" (1/1) ... [2022-04-14 15:11:20,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:20" (1/1) ... [2022-04-14 15:11:20,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:20" (1/1) ... [2022-04-14 15:11:20,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 15:11:20,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 15:11:20,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 15:11:20,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 15:11:20,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:20" (1/1) ... [2022-04-14 15:11:20,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:11:20,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:20,820 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-14 15:11:20,822 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-14 15:11:20,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 15:11:20,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 15:11:20,887 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 15:11:20,888 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 15:11:20,890 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 15:11:20,890 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 15:11:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 15:11:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 15:11:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 15:11:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 15:11:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-14 15:11:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 15:11:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 15:11:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 15:11:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 15:11:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 15:11:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 15:11:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 15:11:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 15:11:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 15:11:20,938 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 15:11:20,939 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 15:11:21,108 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 15:11:21,129 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 15:11:21,129 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 15:11:21,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:11:21 BoogieIcfgContainer [2022-04-14 15:11:21,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 15:11:21,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 15:11:21,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 15:11:21,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 15:11:21,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 03:11:20" (1/3) ... [2022-04-14 15:11:21,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739bc930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:11:21, skipping insertion in model container [2022-04-14 15:11:21,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:20" (2/3) ... [2022-04-14 15:11:21,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739bc930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:11:21, skipping insertion in model container [2022-04-14 15:11:21,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:11:21" (3/3) ... [2022-04-14 15:11:21,135 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound5.c [2022-04-14 15:11:21,138 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 15:11:21,138 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 15:11:21,193 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 15:11:21,197 INFO L340 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 [2022-04-14 15:11:21,197 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 15:11:21,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 15:11:21,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-14 15:11:21,235 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:21,235 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:21,236 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:21,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:21,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-14 15:11:21,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:21,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700592029] [2022-04-14 15:11:21,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:21,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:21,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:11:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:21,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-14 15:11:21,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-14 15:11:21,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-14 15:11:21,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:11:21,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-14 15:11:21,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-14 15:11:21,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-14 15:11:21,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-14 15:11:21,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {34#true} is VALID [2022-04-14 15:11:21,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-14 15:11:21,399 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35#false} is VALID [2022-04-14 15:11:21,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-14 15:11:21,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-14 15:11:21,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-14 15:11:21,399 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-14 15:11:21,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:21,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700592029] [2022-04-14 15:11:21,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700592029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:11:21,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:11:21,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 15:11:21,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141495510] [2022-04-14 15:11:21,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:11:21,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 15:11:21,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:21,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:21,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:21,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 15:11:21,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:21,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 15:11:21,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:11:21,443 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:21,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:21,605 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-14 15:11:21,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 15:11:21,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 15:11:21,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-14 15:11:21,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:21,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-14 15:11:21,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-14 15:11:21,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:21,708 INFO L225 Difference]: With dead ends: 57 [2022-04-14 15:11:21,708 INFO L226 Difference]: Without dead ends: 27 [2022-04-14 15:11:21,710 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:11:21,712 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:21,713 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 15:11:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-14 15:11:21,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-14 15:11:21,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:21,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:21,732 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:21,733 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:21,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:21,747 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-14 15:11:21,747 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-14 15:11:21,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:21,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:21,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-14 15:11:21,748 INFO L87 Difference]: Start difference. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-14 15:11:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:21,751 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-14 15:11:21,751 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-14 15:11:21,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:21,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:21,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:21,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-14 15:11:21,755 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-14 15:11:21,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:21,756 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-14 15:11:21,756 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:21,756 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-14 15:11:21,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 15:11:21,756 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:21,756 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:21,757 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 15:11:21,757 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:21,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:21,758 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-14 15:11:21,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:21,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599747479] [2022-04-14 15:11:21,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:21,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:21,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:11:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:21,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {234#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:11:21,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#(= ~counter~0 0)} assume true; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:11:21,862 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232#(= ~counter~0 0)} {227#true} #81#return; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:11:21,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:11:21,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:11:21,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#(= ~counter~0 0)} assume true; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:11:21,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#(= ~counter~0 0)} {227#true} #81#return; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:11:21,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#(= ~counter~0 0)} call #t~ret6 := main(); {232#(= ~counter~0 0)} is VALID [2022-04-14 15:11:21,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#(= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:11:21,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {232#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {233#(= |main_#t~post5| 0)} is VALID [2022-04-14 15:11:21,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#(= |main_#t~post5| 0)} assume !(#t~post5 < 5);havoc #t~post5; {228#false} is VALID [2022-04-14 15:11:21,866 INFO L272 TraceCheckUtils]: 8: Hoare triple {228#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {228#false} is VALID [2022-04-14 15:11:21,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2022-04-14 15:11:21,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2022-04-14 15:11:21,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-14 15:11:21,867 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-14 15:11:21,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:21,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599747479] [2022-04-14 15:11:21,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599747479] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:11:21,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:11:21,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 15:11:21,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942256588] [2022-04-14 15:11:21,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:11:21,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 15:11:21,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:21,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:21,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:21,881 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:11:21,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:21,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:11:21,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:11:21,882 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:22,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:22,079 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-14 15:11:22,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 15:11:22,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 15:11:22,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:22,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-14 15:11:22,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-14 15:11:22,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-14 15:11:22,149 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-14 15:11:22,150 INFO L225 Difference]: With dead ends: 40 [2022-04-14 15:11:22,150 INFO L226 Difference]: Without dead ends: 28 [2022-04-14 15:11:22,151 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-14 15:11:22,151 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:22,152 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:11:22,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-14 15:11:22,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-14 15:11:22,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:22,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:22,156 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:22,156 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:22,158 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-14 15:11:22,158 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-14 15:11:22,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:22,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:22,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-14 15:11:22,159 INFO L87 Difference]: Start difference. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-14 15:11:22,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:22,161 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-14 15:11:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-14 15:11:22,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:22,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:22,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:22,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:22,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:22,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-14 15:11:22,163 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-14 15:11:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:22,163 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-14 15:11:22,164 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-14 15:11:22,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 15:11:22,164 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:22,164 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:22,164 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 15:11:22,164 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:22,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:22,165 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-14 15:11:22,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:22,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392063194] [2022-04-14 15:11:22,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:22,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:22,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:11:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:22,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {414#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {406#true} is VALID [2022-04-14 15:11:22,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {406#true} assume true; {406#true} is VALID [2022-04-14 15:11:22,242 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {406#true} {406#true} #81#return; {406#true} is VALID [2022-04-14 15:11:22,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {406#true} call ULTIMATE.init(); {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:11:22,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {406#true} is VALID [2022-04-14 15:11:22,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {406#true} assume true; {406#true} is VALID [2022-04-14 15:11:22,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {406#true} {406#true} #81#return; {406#true} is VALID [2022-04-14 15:11:22,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {406#true} call #t~ret6 := main(); {406#true} is VALID [2022-04-14 15:11:22,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {406#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-14 15:11:22,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-14 15:11:22,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !!(#t~post5 < 5);havoc #t~post5; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-14 15:11:22,246 INFO L272 TraceCheckUtils]: 8: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:11:22,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {412#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {413#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:11:22,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {413#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {407#false} is VALID [2022-04-14 15:11:22,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {407#false} assume !false; {407#false} is VALID [2022-04-14 15:11:22,248 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-14 15:11:22,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:22,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392063194] [2022-04-14 15:11:22,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392063194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:11:22,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:11:22,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 15:11:22,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696505265] [2022-04-14 15:11:22,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:11:22,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 15:11:22,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:22,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:22,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:22,258 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 15:11:22,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:22,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 15:11:22,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 15:11:22,258 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:22,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:22,636 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-14 15:11:22,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 15:11:22,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 15:11:22,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:22,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:22,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-14 15:11:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-14 15:11:22,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-14 15:11:22,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:22,687 INFO L225 Difference]: With dead ends: 34 [2022-04-14 15:11:22,687 INFO L226 Difference]: Without dead ends: 32 [2022-04-14 15:11:22,687 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:11:22,694 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:22,695 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:11:22,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-14 15:11:22,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-14 15:11:22,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:22,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:22,709 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:22,709 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:22,713 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-14 15:11:22,713 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 15:11:22,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:22,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:22,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-14 15:11:22,714 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-14 15:11:22,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:22,716 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-14 15:11:22,716 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 15:11:22,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:22,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:22,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:22,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:22,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-14 15:11:22,719 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-14 15:11:22,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:22,719 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-14 15:11:22,719 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 15:11:22,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-14 15:11:22,720 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:22,720 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:22,720 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 15:11:22,720 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:22,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:22,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-14 15:11:22,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:22,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416331473] [2022-04-14 15:11:22,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:22,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:22,747 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:22,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [348806561] [2022-04-14 15:11:22,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:22,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:22,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:22,751 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-14 15:11:22,762 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-14 15:11:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:22,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:11:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:22,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:22,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {593#true} is VALID [2022-04-14 15:11:22,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {593#true} is VALID [2022-04-14 15:11:22,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-14 15:11:22,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {593#true} {593#true} #81#return; {593#true} is VALID [2022-04-14 15:11:22,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {593#true} call #t~ret6 := main(); {593#true} is VALID [2022-04-14 15:11:22,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {593#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:22,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:22,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:22,899 INFO L272 TraceCheckUtils]: 8: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {593#true} is VALID [2022-04-14 15:11:22,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {593#true} ~cond := #in~cond; {593#true} is VALID [2022-04-14 15:11:22,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {593#true} assume !(0 == ~cond); {593#true} is VALID [2022-04-14 15:11:22,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-14 15:11:22,901 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {593#true} {613#(and (= main_~n~0 0) (= main_~y~0 1))} #59#return; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:22,901 INFO L272 TraceCheckUtils]: 13: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:22,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:22,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {594#false} is VALID [2022-04-14 15:11:22,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-14 15:11:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:11:22,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:11:22,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:22,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416331473] [2022-04-14 15:11:22,903 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:22,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348806561] [2022-04-14 15:11:22,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348806561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:11:22,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:11:22,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:11:22,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327299004] [2022-04-14 15:11:22,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:11:22,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-14 15:11:22,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:22,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:11:22,916 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-14 15:11:22,916 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:11:22,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:22,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:11:22,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:11:22,917 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:11:23,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:23,182 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-14 15:11:23,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:11:23,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-14 15:11:23,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:11:23,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:11:23,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:11:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:11:23,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-14 15:11:23,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:23,223 INFO L225 Difference]: With dead ends: 50 [2022-04-14 15:11:23,223 INFO L226 Difference]: Without dead ends: 48 [2022-04-14 15:11:23,223 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-14 15:11:23,224 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:23,224 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 139 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 15:11:23,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-14 15:11:23,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-14 15:11:23,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:23,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 15:11:23,245 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 15:11:23,246 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 15:11:23,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:23,248 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-14 15:11:23,248 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-14 15:11:23,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:23,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:23,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-14 15:11:23,253 INFO L87 Difference]: Start difference. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-14 15:11:23,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:23,258 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-14 15:11:23,258 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-14 15:11:23,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:23,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:23,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:23,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:23,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 15:11:23,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-14 15:11:23,262 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-14 15:11:23,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:23,262 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-14 15:11:23,262 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:11:23,262 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-14 15:11:23,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 15:11:23,262 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:23,262 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:23,281 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-14 15:11:23,463 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:23,463 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:23,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:23,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-14 15:11:23,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:23,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687911208] [2022-04-14 15:11:23,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:23,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:23,476 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:23,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [201139950] [2022-04-14 15:11:23,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:23,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:23,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:23,493 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-14 15:11:23,494 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-14 15:11:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:23,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:11:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:23,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:23,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {887#true} call ULTIMATE.init(); {887#true} is VALID [2022-04-14 15:11:23,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {887#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {887#true} is VALID [2022-04-14 15:11:23,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-14 15:11:23,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {887#true} {887#true} #81#return; {887#true} is VALID [2022-04-14 15:11:23,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {887#true} call #t~ret6 := main(); {887#true} is VALID [2022-04-14 15:11:23,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {887#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-14 15:11:23,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-14 15:11:23,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-14 15:11:23,643 INFO L272 TraceCheckUtils]: 8: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {887#true} is VALID [2022-04-14 15:11:23,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2022-04-14 15:11:23,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2022-04-14 15:11:23,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-14 15:11:23,644 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {887#true} {907#(and (= main_~x~0 0) (= main_~n~0 0))} #59#return; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-14 15:11:23,647 INFO L272 TraceCheckUtils]: 13: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {887#true} is VALID [2022-04-14 15:11:23,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2022-04-14 15:11:23,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2022-04-14 15:11:23,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-14 15:11:23,648 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {887#true} {907#(and (= main_~x~0 0) (= main_~n~0 0))} #61#return; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-14 15:11:23,648 INFO L272 TraceCheckUtils]: 18: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {947#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:23,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {947#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {951#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:23,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {951#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {888#false} is VALID [2022-04-14 15:11:23,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {888#false} assume !false; {888#false} is VALID [2022-04-14 15:11:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 15:11:23,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:11:23,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:23,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687911208] [2022-04-14 15:11:23,650 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:23,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201139950] [2022-04-14 15:11:23,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201139950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:11:23,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:11:23,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:11:23,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144468530] [2022-04-14 15:11:23,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:11:23,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 15:11:23,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:23,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:11:23,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:23,664 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:11:23,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:23,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:11:23,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:11:23,665 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:11:23,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:23,885 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-14 15:11:23,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:11:23,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 15:11:23,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:23,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:11:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:11:23,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:11:23,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:11:23,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-14 15:11:23,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:23,941 INFO L225 Difference]: With dead ends: 54 [2022-04-14 15:11:23,941 INFO L226 Difference]: Without dead ends: 52 [2022-04-14 15:11:23,941 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 15:11:23,942 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:23,942 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 144 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 15:11:23,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-14 15:11:23,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-14 15:11:23,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:23,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-14 15:11:23,957 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-14 15:11:23,959 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-14 15:11:23,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:23,963 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-14 15:11:23,964 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-14 15:11:23,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:23,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:23,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-14 15:11:23,965 INFO L87 Difference]: Start difference. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-14 15:11:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:23,967 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-14 15:11:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-14 15:11:23,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:23,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:23,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:23,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:23,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-14 15:11:23,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-14 15:11:23,970 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-14 15:11:23,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:23,972 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-14 15:11:23,972 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:11:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-14 15:11:23,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 15:11:23,974 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:23,974 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:24,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-14 15:11:24,188 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:24,188 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:24,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:24,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-14 15:11:24,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:24,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037643641] [2022-04-14 15:11:24,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:24,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:24,199 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:24,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2096320066] [2022-04-14 15:11:24,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:24,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:24,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:24,200 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-14 15:11:24,214 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-14 15:11:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:24,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 15:11:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:24,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:24,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {1225#true} call ULTIMATE.init(); {1225#true} is VALID [2022-04-14 15:11:24,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {1225#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1225#true} is VALID [2022-04-14 15:11:24,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-14 15:11:24,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1225#true} {1225#true} #81#return; {1225#true} is VALID [2022-04-14 15:11:24,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {1225#true} call #t~ret6 := main(); {1225#true} is VALID [2022-04-14 15:11:24,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {1225#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:24,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:24,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:24,390 INFO L272 TraceCheckUtils]: 8: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1225#true} is VALID [2022-04-14 15:11:24,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-14 15:11:24,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-14 15:11:24,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-14 15:11:24,391 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:24,391 INFO L272 TraceCheckUtils]: 13: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1225#true} is VALID [2022-04-14 15:11:24,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-14 15:11:24,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-14 15:11:24,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-14 15:11:24,392 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:24,392 INFO L272 TraceCheckUtils]: 18: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1225#true} is VALID [2022-04-14 15:11:24,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-14 15:11:24,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-14 15:11:24,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-14 15:11:24,394 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:24,395 INFO L272 TraceCheckUtils]: 23: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1300#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:24,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {1300#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1304#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:24,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {1304#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1226#false} is VALID [2022-04-14 15:11:24,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2022-04-14 15:11:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 15:11:24,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:11:24,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:24,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037643641] [2022-04-14 15:11:24,396 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:24,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096320066] [2022-04-14 15:11:24,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096320066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:11:24,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:11:24,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:11:24,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180345413] [2022-04-14 15:11:24,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:11:24,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-14 15:11:24,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:24,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:11:24,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:24,412 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:11:24,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:24,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:11:24,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:11:24,413 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:11:24,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:24,669 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-14 15:11:24,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:11:24,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-14 15:11:24,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:24,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:11:24,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:11:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:11:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:11:24,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-14 15:11:24,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:24,729 INFO L225 Difference]: With dead ends: 62 [2022-04-14 15:11:24,729 INFO L226 Difference]: Without dead ends: 50 [2022-04-14 15:11:24,730 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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-14 15:11:24,730 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:24,731 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 130 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:11:24,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-14 15:11:24,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-14 15:11:24,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:24,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:11:24,737 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:11:24,737 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:11:24,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:24,739 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-14 15:11:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-14 15:11:24,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:24,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:24,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-14 15:11:24,740 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-14 15:11:24,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:24,741 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-14 15:11:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-14 15:11:24,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:24,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:24,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:24,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:11:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-14 15:11:24,743 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-14 15:11:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:24,744 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-14 15:11:24,744 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:11:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-14 15:11:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-14 15:11:24,744 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:24,744 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:24,768 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-14 15:11:24,968 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:24,968 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:24,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:24,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-14 15:11:24,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:24,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968565424] [2022-04-14 15:11:24,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:24,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:24,978 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:24,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2019495838] [2022-04-14 15:11:24,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:24,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:24,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:25,007 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-14 15:11:25,008 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-14 15:11:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:25,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:11:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:25,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:25,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2022-04-14 15:11:25,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {1585#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:11:25,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {1593#(<= ~counter~0 0)} assume true; {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:11:25,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1593#(<= ~counter~0 0)} {1585#true} #81#return; {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:11:25,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {1593#(<= ~counter~0 0)} call #t~ret6 := main(); {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:11:25,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {1593#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:11:25,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {1593#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {1609#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,229 INFO L272 TraceCheckUtils]: 8: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,237 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #59#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,237 INFO L272 TraceCheckUtils]: 13: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,238 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #61#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,239 INFO L272 TraceCheckUtils]: 18: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,240 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #63#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,241 INFO L272 TraceCheckUtils]: 23: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,242 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #65#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,243 INFO L272 TraceCheckUtils]: 28: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,244 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #67#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,244 INFO L290 TraceCheckUtils]: 33: Hoare triple {1609#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:25,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {1609#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1694#(<= |main_#t~post5| 1)} is VALID [2022-04-14 15:11:25,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {1694#(<= |main_#t~post5| 1)} assume !(#t~post5 < 5);havoc #t~post5; {1586#false} is VALID [2022-04-14 15:11:25,245 INFO L272 TraceCheckUtils]: 36: Hoare triple {1586#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1586#false} is VALID [2022-04-14 15:11:25,245 INFO L290 TraceCheckUtils]: 37: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-14 15:11:25,245 INFO L290 TraceCheckUtils]: 38: Hoare triple {1586#false} assume !(0 == ~cond); {1586#false} is VALID [2022-04-14 15:11:25,245 INFO L290 TraceCheckUtils]: 39: Hoare triple {1586#false} assume true; {1586#false} is VALID [2022-04-14 15:11:25,245 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1586#false} {1586#false} #69#return; {1586#false} is VALID [2022-04-14 15:11:25,245 INFO L272 TraceCheckUtils]: 41: Hoare triple {1586#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1586#false} is VALID [2022-04-14 15:11:25,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-14 15:11:25,246 INFO L290 TraceCheckUtils]: 43: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2022-04-14 15:11:25,246 INFO L290 TraceCheckUtils]: 44: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2022-04-14 15:11:25,246 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-14 15:11:25,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:11:25,409 INFO L290 TraceCheckUtils]: 44: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2022-04-14 15:11:25,409 INFO L290 TraceCheckUtils]: 43: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2022-04-14 15:11:25,409 INFO L290 TraceCheckUtils]: 42: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-14 15:11:25,409 INFO L272 TraceCheckUtils]: 41: Hoare triple {1586#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1586#false} is VALID [2022-04-14 15:11:25,409 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1585#true} {1586#false} #69#return; {1586#false} is VALID [2022-04-14 15:11:25,409 INFO L290 TraceCheckUtils]: 39: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:11:25,409 INFO L290 TraceCheckUtils]: 38: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:11:25,410 INFO L290 TraceCheckUtils]: 37: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:11:25,410 INFO L272 TraceCheckUtils]: 36: Hoare triple {1586#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-14 15:11:25,410 INFO L290 TraceCheckUtils]: 35: Hoare triple {1752#(< |main_#t~post5| 5)} assume !(#t~post5 < 5);havoc #t~post5; {1586#false} is VALID [2022-04-14 15:11:25,410 INFO L290 TraceCheckUtils]: 34: Hoare triple {1756#(< ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1752#(< |main_#t~post5| 5)} is VALID [2022-04-14 15:11:25,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {1756#(< ~counter~0 5)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1756#(< ~counter~0 5)} is VALID [2022-04-14 15:11:25,411 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1585#true} {1756#(< ~counter~0 5)} #67#return; {1756#(< ~counter~0 5)} is VALID [2022-04-14 15:11:25,411 INFO L290 TraceCheckUtils]: 31: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:11:25,412 INFO L290 TraceCheckUtils]: 30: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:11:25,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:11:25,412 INFO L272 TraceCheckUtils]: 28: Hoare triple {1756#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1585#true} is VALID [2022-04-14 15:11:25,412 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1585#true} {1756#(< ~counter~0 5)} #65#return; {1756#(< ~counter~0 5)} is VALID [2022-04-14 15:11:25,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:11:25,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:11:25,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:11:25,413 INFO L272 TraceCheckUtils]: 23: Hoare triple {1756#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1585#true} is VALID [2022-04-14 15:11:25,413 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1585#true} {1756#(< ~counter~0 5)} #63#return; {1756#(< ~counter~0 5)} is VALID [2022-04-14 15:11:25,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:11:25,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:11:25,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:11:25,414 INFO L272 TraceCheckUtils]: 18: Hoare triple {1756#(< ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-14 15:11:25,414 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1585#true} {1756#(< ~counter~0 5)} #61#return; {1756#(< ~counter~0 5)} is VALID [2022-04-14 15:11:25,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:11:25,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:11:25,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:11:25,415 INFO L272 TraceCheckUtils]: 13: Hoare triple {1756#(< ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1585#true} is VALID [2022-04-14 15:11:25,415 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1585#true} {1756#(< ~counter~0 5)} #59#return; {1756#(< ~counter~0 5)} is VALID [2022-04-14 15:11:25,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:11:25,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:11:25,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:11:25,416 INFO L272 TraceCheckUtils]: 8: Hoare triple {1756#(< ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-14 15:11:25,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {1756#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {1756#(< ~counter~0 5)} is VALID [2022-04-14 15:11:25,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {1841#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1756#(< ~counter~0 5)} is VALID [2022-04-14 15:11:25,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {1841#(< ~counter~0 4)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1841#(< ~counter~0 4)} is VALID [2022-04-14 15:11:25,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {1841#(< ~counter~0 4)} call #t~ret6 := main(); {1841#(< ~counter~0 4)} is VALID [2022-04-14 15:11:25,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1841#(< ~counter~0 4)} {1585#true} #81#return; {1841#(< ~counter~0 4)} is VALID [2022-04-14 15:11:25,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {1841#(< ~counter~0 4)} assume true; {1841#(< ~counter~0 4)} is VALID [2022-04-14 15:11:25,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {1585#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1841#(< ~counter~0 4)} is VALID [2022-04-14 15:11:25,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2022-04-14 15:11:25,421 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-14 15:11:25,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:25,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968565424] [2022-04-14 15:11:25,421 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:25,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019495838] [2022-04-14 15:11:25,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019495838] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:11:25,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:11:25,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-14 15:11:25,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640925762] [2022-04-14 15:11:25,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:11:25,422 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2022-04-14 15:11:25,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:25,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-14 15:11:25,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:25,466 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:11:25,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:25,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:11:25,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:11:25,466 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-14 15:11:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:26,051 INFO L93 Difference]: Finished difference Result 120 states and 155 transitions. [2022-04-14 15:11:26,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 15:11:26,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2022-04-14 15:11:26,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:26,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-14 15:11:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2022-04-14 15:11:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-14 15:11:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2022-04-14 15:11:26,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 134 transitions. [2022-04-14 15:11:26,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:26,156 INFO L225 Difference]: With dead ends: 120 [2022-04-14 15:11:26,156 INFO L226 Difference]: Without dead ends: 104 [2022-04-14 15:11:26,156 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 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-14 15:11:26,157 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 65 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:26,157 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 194 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:11:26,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-14 15:11:26,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-04-14 15:11:26,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:26,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:26,189 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:26,189 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:26,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:26,192 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-14 15:11:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-14 15:11:26,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:26,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:26,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 104 states. [2022-04-14 15:11:26,193 INFO L87 Difference]: Start difference. First operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 104 states. [2022-04-14 15:11:26,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:26,196 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-14 15:11:26,196 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-14 15:11:26,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:26,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:26,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:26,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:26,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:26,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-04-14 15:11:26,200 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 45 [2022-04-14 15:11:26,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:26,200 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-04-14 15:11:26,201 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-14 15:11:26,201 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-04-14 15:11:26,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-14 15:11:26,201 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:26,201 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:26,223 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-14 15:11:26,423 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:26,423 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:26,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:26,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 1 times [2022-04-14 15:11:26,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:26,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195288766] [2022-04-14 15:11:26,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:26,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:26,433 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:26,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [238031240] [2022-04-14 15:11:26,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:26,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:26,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:26,434 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-14 15:11:26,435 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-14 15:11:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:26,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 15:11:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:26,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:26,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {2418#true} call ULTIMATE.init(); {2418#true} is VALID [2022-04-14 15:11:26,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {2418#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2418#true} is VALID [2022-04-14 15:11:26,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:26,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#true} {2418#true} #81#return; {2418#true} is VALID [2022-04-14 15:11:26,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#true} call #t~ret6 := main(); {2418#true} is VALID [2022-04-14 15:11:26,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {2418#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:26,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:26,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:26,671 INFO L272 TraceCheckUtils]: 8: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:26,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:26,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:26,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:26,671 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:26,671 INFO L272 TraceCheckUtils]: 13: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:26,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:26,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:26,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:26,674 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:26,674 INFO L272 TraceCheckUtils]: 18: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:26,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:26,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:26,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:26,674 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:26,674 INFO L272 TraceCheckUtils]: 23: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:26,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:26,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:26,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:26,675 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:26,675 INFO L272 TraceCheckUtils]: 28: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:26,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:26,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:26,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:26,676 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:26,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 15:11:26,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 15:11:26,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} assume !!(#t~post5 < 5);havoc #t~post5; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 15:11:26,677 INFO L272 TraceCheckUtils]: 36: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:26,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:26,677 INFO L290 TraceCheckUtils]: 38: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:26,677 INFO L290 TraceCheckUtils]: 39: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:26,678 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2418#true} {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #59#return; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 15:11:26,678 INFO L272 TraceCheckUtils]: 41: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:26,679 INFO L290 TraceCheckUtils]: 42: Hoare triple {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:26,683 INFO L290 TraceCheckUtils]: 43: Hoare triple {2552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2419#false} is VALID [2022-04-14 15:11:26,683 INFO L290 TraceCheckUtils]: 44: Hoare triple {2419#false} assume !false; {2419#false} is VALID [2022-04-14 15:11:26,683 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-14 15:11:26,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:11:26,845 INFO L290 TraceCheckUtils]: 44: Hoare triple {2419#false} assume !false; {2419#false} is VALID [2022-04-14 15:11:26,846 INFO L290 TraceCheckUtils]: 43: Hoare triple {2552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2419#false} is VALID [2022-04-14 15:11:26,847 INFO L290 TraceCheckUtils]: 42: Hoare triple {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:26,849 INFO L272 TraceCheckUtils]: 41: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:26,849 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2418#true} {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #59#return; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-14 15:11:26,849 INFO L290 TraceCheckUtils]: 39: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:26,849 INFO L290 TraceCheckUtils]: 38: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:26,849 INFO L290 TraceCheckUtils]: 37: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:26,850 INFO L272 TraceCheckUtils]: 36: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:26,850 INFO L290 TraceCheckUtils]: 35: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !!(#t~post5 < 5);havoc #t~post5; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-14 15:11:26,853 INFO L290 TraceCheckUtils]: 34: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-14 15:11:26,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-14 15:11:26,856 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #67#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:11:26,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:26,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:26,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:26,857 INFO L272 TraceCheckUtils]: 28: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:26,857 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #65#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:11:26,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:26,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:26,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:26,857 INFO L272 TraceCheckUtils]: 23: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:26,858 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #63#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:11:26,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:26,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:26,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:26,858 INFO L272 TraceCheckUtils]: 18: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:26,859 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #61#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:11:26,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:26,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:26,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:26,859 INFO L272 TraceCheckUtils]: 13: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:26,859 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #59#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:11:26,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:26,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:26,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:26,860 INFO L272 TraceCheckUtils]: 8: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:26,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} assume !!(#t~post5 < 5);havoc #t~post5; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:11:26,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:11:26,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {2418#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:11:26,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#true} call #t~ret6 := main(); {2418#true} is VALID [2022-04-14 15:11:26,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#true} {2418#true} #81#return; {2418#true} is VALID [2022-04-14 15:11:26,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:26,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {2418#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2418#true} is VALID [2022-04-14 15:11:26,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {2418#true} call ULTIMATE.init(); {2418#true} is VALID [2022-04-14 15:11:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-14 15:11:26,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:26,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195288766] [2022-04-14 15:11:26,862 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:26,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238031240] [2022-04-14 15:11:26,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238031240] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:11:26,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:11:26,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 15:11:26,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954746518] [2022-04-14 15:11:26,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:11:26,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-04-14 15:11:26,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:26,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-14 15:11:26,902 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-14 15:11:26,902 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:11:26,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:26,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:11:26,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:11:26,903 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-14 15:11:27,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:27,540 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-14 15:11:27,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 15:11:27,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-04-14 15:11:27,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:27,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-14 15:11:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-14 15:11:27,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-14 15:11:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-14 15:11:27,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-14 15:11:27,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:27,628 INFO L225 Difference]: With dead ends: 118 [2022-04-14 15:11:27,628 INFO L226 Difference]: Without dead ends: 116 [2022-04-14 15:11:27,628 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-14 15:11:27,628 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:27,628 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 124 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-14 15:11:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-14 15:11:27,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-14 15:11:27,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:27,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:27,671 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:27,671 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:27,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:27,674 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-14 15:11:27,674 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-14 15:11:27,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:27,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:27,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 116 states. [2022-04-14 15:11:27,675 INFO L87 Difference]: Start difference. First operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 116 states. [2022-04-14 15:11:27,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:27,678 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-14 15:11:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-14 15:11:27,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:27,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:27,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:27,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:27,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2022-04-14 15:11:27,683 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 45 [2022-04-14 15:11:27,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:27,683 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2022-04-14 15:11:27,683 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-14 15:11:27,683 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-14 15:11:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-14 15:11:27,684 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:27,684 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:27,716 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-14 15:11:27,900 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:27,901 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:27,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:27,901 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 2 times [2022-04-14 15:11:27,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:27,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377025685] [2022-04-14 15:11:27,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:27,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:27,913 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:27,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [91835967] [2022-04-14 15:11:27,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:11:27,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:27,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:27,914 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-14 15:11:27,926 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-14 15:11:27,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 15:11:27,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:11:27,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 15:11:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:27,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:28,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {3289#true} call ULTIMATE.init(); {3289#true} is VALID [2022-04-14 15:11:28,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {3289#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3289#true} is VALID [2022-04-14 15:11:28,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:28,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3289#true} {3289#true} #81#return; {3289#true} is VALID [2022-04-14 15:11:28,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {3289#true} call #t~ret6 := main(); {3289#true} is VALID [2022-04-14 15:11:28,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {3289#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:28,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:28,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:28,204 INFO L272 TraceCheckUtils]: 8: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:28,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:28,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:28,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:28,205 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #59#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:28,205 INFO L272 TraceCheckUtils]: 13: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:28,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:28,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:28,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:28,205 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #61#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:28,206 INFO L272 TraceCheckUtils]: 18: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:28,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:28,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:28,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:28,206 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #63#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:28,206 INFO L272 TraceCheckUtils]: 23: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:28,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:28,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:28,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:28,208 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #65#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:28,208 INFO L272 TraceCheckUtils]: 28: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:28,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:28,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:28,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:28,209 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #67#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:28,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-14 15:11:28,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-14 15:11:28,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-14 15:11:28,210 INFO L272 TraceCheckUtils]: 36: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:28,210 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:28,210 INFO L290 TraceCheckUtils]: 38: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:28,210 INFO L290 TraceCheckUtils]: 39: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:28,213 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3289#true} {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} #59#return; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-14 15:11:28,213 INFO L272 TraceCheckUtils]: 41: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:28,213 INFO L290 TraceCheckUtils]: 42: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:28,213 INFO L290 TraceCheckUtils]: 43: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:28,214 INFO L290 TraceCheckUtils]: 44: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:28,214 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3289#true} {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} #61#return; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-14 15:11:28,215 INFO L272 TraceCheckUtils]: 46: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:28,215 INFO L290 TraceCheckUtils]: 47: Hoare triple {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3438#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:28,215 INFO L290 TraceCheckUtils]: 48: Hoare triple {3438#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3290#false} is VALID [2022-04-14 15:11:28,215 INFO L290 TraceCheckUtils]: 49: Hoare triple {3290#false} assume !false; {3290#false} is VALID [2022-04-14 15:11:28,216 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-14 15:11:28,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:11:28,417 INFO L290 TraceCheckUtils]: 49: Hoare triple {3290#false} assume !false; {3290#false} is VALID [2022-04-14 15:11:28,417 INFO L290 TraceCheckUtils]: 48: Hoare triple {3438#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3290#false} is VALID [2022-04-14 15:11:28,418 INFO L290 TraceCheckUtils]: 47: Hoare triple {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3438#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:28,418 INFO L272 TraceCheckUtils]: 46: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:28,419 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3289#true} {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #61#return; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:11:28,419 INFO L290 TraceCheckUtils]: 44: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:28,419 INFO L290 TraceCheckUtils]: 43: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:28,419 INFO L290 TraceCheckUtils]: 42: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:28,419 INFO L272 TraceCheckUtils]: 41: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:28,420 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3289#true} {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #59#return; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:11:28,420 INFO L290 TraceCheckUtils]: 39: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:28,420 INFO L290 TraceCheckUtils]: 38: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:28,420 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:28,420 INFO L272 TraceCheckUtils]: 36: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:28,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !!(#t~post5 < 5);havoc #t~post5; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:11:28,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:11:28,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:11:28,423 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #67#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:11:28,423 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:28,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:28,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:28,424 INFO L272 TraceCheckUtils]: 28: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:28,424 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #65#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:11:28,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:28,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:28,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:28,425 INFO L272 TraceCheckUtils]: 23: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:28,425 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #63#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:11:28,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:28,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:28,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:28,426 INFO L272 TraceCheckUtils]: 18: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:28,427 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #61#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:11:28,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:28,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:28,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:28,427 INFO L272 TraceCheckUtils]: 13: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:28,431 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #59#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:11:28,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:28,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:28,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:28,432 INFO L272 TraceCheckUtils]: 8: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:28,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(#t~post5 < 5);havoc #t~post5; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:11:28,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:11:28,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {3289#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:11:28,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {3289#true} call #t~ret6 := main(); {3289#true} is VALID [2022-04-14 15:11:28,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3289#true} {3289#true} #81#return; {3289#true} is VALID [2022-04-14 15:11:28,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:28,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {3289#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3289#true} is VALID [2022-04-14 15:11:28,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {3289#true} call ULTIMATE.init(); {3289#true} is VALID [2022-04-14 15:11:28,434 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-14 15:11:28,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:28,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377025685] [2022-04-14 15:11:28,434 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:28,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91835967] [2022-04-14 15:11:28,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91835967] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:11:28,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:11:28,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 15:11:28,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043704741] [2022-04-14 15:11:28,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:11:28,435 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-04-14 15:11:28,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:28,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-14 15:11:28,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:28,486 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:11:28,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:28,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:11:28,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:11:28,486 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-14 15:11:29,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:29,005 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2022-04-14 15:11:29,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 15:11:29,006 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-04-14 15:11:29,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-14 15:11:29,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-14 15:11:29,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-14 15:11:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-14 15:11:29,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-14 15:11:29,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:29,071 INFO L225 Difference]: With dead ends: 122 [2022-04-14 15:11:29,071 INFO L226 Difference]: Without dead ends: 120 [2022-04-14 15:11:29,071 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-14 15:11:29,072 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:29,072 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 232 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:11:29,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-14 15:11:29,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-14 15:11:29,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:29,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:29,103 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:29,104 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:29,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:29,106 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-14 15:11:29,106 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-14 15:11:29,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:29,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:29,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 120 states. [2022-04-14 15:11:29,107 INFO L87 Difference]: Start difference. First operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 120 states. [2022-04-14 15:11:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:29,110 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-14 15:11:29,110 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-14 15:11:29,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:29,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:29,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:29,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:29,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-04-14 15:11:29,114 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 50 [2022-04-14 15:11:29,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:29,114 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-04-14 15:11:29,114 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-14 15:11:29,114 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-14 15:11:29,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-14 15:11:29,115 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:29,115 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:29,145 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-14 15:11:29,326 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:29,326 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:29,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:29,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1909341660, now seen corresponding path program 3 times [2022-04-14 15:11:29,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:29,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018553973] [2022-04-14 15:11:29,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:29,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:29,337 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:29,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [40010832] [2022-04-14 15:11:29,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 15:11:29,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:29,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:29,342 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-14 15:11:29,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-14 15:11:29,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-14 15:11:29,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:11:29,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-14 15:11:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:29,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:29,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {4204#true} call ULTIMATE.init(); {4204#true} is VALID [2022-04-14 15:11:29,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {4204#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4204#true} is VALID [2022-04-14 15:11:29,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:29,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4204#true} {4204#true} #81#return; {4204#true} is VALID [2022-04-14 15:11:29,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {4204#true} call #t~ret6 := main(); {4204#true} is VALID [2022-04-14 15:11:29,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {4204#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:29,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:29,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:29,629 INFO L272 TraceCheckUtils]: 8: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:29,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:29,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:29,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:29,630 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:29,630 INFO L272 TraceCheckUtils]: 13: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:29,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:29,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:29,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:29,631 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:29,631 INFO L272 TraceCheckUtils]: 18: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:29,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:29,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:29,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:29,632 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:29,632 INFO L272 TraceCheckUtils]: 23: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:29,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:29,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:29,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:29,632 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:29,632 INFO L272 TraceCheckUtils]: 28: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:29,633 INFO L290 TraceCheckUtils]: 29: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:29,633 INFO L290 TraceCheckUtils]: 30: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:29,633 INFO L290 TraceCheckUtils]: 31: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:29,633 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:29,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 15:11:29,634 INFO L290 TraceCheckUtils]: 34: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 15:11:29,634 INFO L290 TraceCheckUtils]: 35: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} assume !!(#t~post5 < 5);havoc #t~post5; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 15:11:29,634 INFO L272 TraceCheckUtils]: 36: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:29,634 INFO L290 TraceCheckUtils]: 37: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:29,634 INFO L290 TraceCheckUtils]: 38: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:29,634 INFO L290 TraceCheckUtils]: 39: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:29,635 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4204#true} {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #59#return; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 15:11:29,635 INFO L272 TraceCheckUtils]: 41: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:29,635 INFO L290 TraceCheckUtils]: 42: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:29,635 INFO L290 TraceCheckUtils]: 43: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:29,635 INFO L290 TraceCheckUtils]: 44: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:29,636 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4204#true} {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #61#return; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 15:11:29,636 INFO L272 TraceCheckUtils]: 46: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:29,636 INFO L290 TraceCheckUtils]: 47: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:29,636 INFO L290 TraceCheckUtils]: 48: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:29,636 INFO L290 TraceCheckUtils]: 49: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:29,636 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4204#true} {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #63#return; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 15:11:29,637 INFO L272 TraceCheckUtils]: 51: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:29,637 INFO L290 TraceCheckUtils]: 52: Hoare triple {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4368#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:29,637 INFO L290 TraceCheckUtils]: 53: Hoare triple {4368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4205#false} is VALID [2022-04-14 15:11:29,637 INFO L290 TraceCheckUtils]: 54: Hoare triple {4205#false} assume !false; {4205#false} is VALID [2022-04-14 15:11:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-14 15:11:29,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:11:29,975 INFO L290 TraceCheckUtils]: 54: Hoare triple {4205#false} assume !false; {4205#false} is VALID [2022-04-14 15:11:29,976 INFO L290 TraceCheckUtils]: 53: Hoare triple {4368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4205#false} is VALID [2022-04-14 15:11:29,976 INFO L290 TraceCheckUtils]: 52: Hoare triple {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4368#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:29,977 INFO L272 TraceCheckUtils]: 51: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:29,977 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4204#true} {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #63#return; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 15:11:29,977 INFO L290 TraceCheckUtils]: 49: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:29,977 INFO L290 TraceCheckUtils]: 48: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:29,977 INFO L290 TraceCheckUtils]: 47: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:29,977 INFO L272 TraceCheckUtils]: 46: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:29,978 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4204#true} {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #61#return; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 15:11:29,978 INFO L290 TraceCheckUtils]: 44: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:29,978 INFO L290 TraceCheckUtils]: 43: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:29,978 INFO L290 TraceCheckUtils]: 42: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:29,978 INFO L272 TraceCheckUtils]: 41: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:29,979 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4204#true} {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #59#return; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 15:11:29,979 INFO L290 TraceCheckUtils]: 39: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:29,979 INFO L290 TraceCheckUtils]: 38: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:29,979 INFO L290 TraceCheckUtils]: 37: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:29,979 INFO L272 TraceCheckUtils]: 36: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:29,979 INFO L290 TraceCheckUtils]: 35: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !!(#t~post5 < 5);havoc #t~post5; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 15:11:29,979 INFO L290 TraceCheckUtils]: 34: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 15:11:29,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 15:11:29,982 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #67#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:11:29,983 INFO L290 TraceCheckUtils]: 31: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:29,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:29,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:29,983 INFO L272 TraceCheckUtils]: 28: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:29,983 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #65#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:11:29,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:29,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:29,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:29,983 INFO L272 TraceCheckUtils]: 23: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:29,984 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #63#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:11:29,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:29,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:29,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:29,984 INFO L272 TraceCheckUtils]: 18: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:29,984 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #61#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:11:29,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:29,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:29,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:29,985 INFO L272 TraceCheckUtils]: 13: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:29,985 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #59#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:11:29,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:29,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:29,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:29,985 INFO L272 TraceCheckUtils]: 8: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:29,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(#t~post5 < 5);havoc #t~post5; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:11:29,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:11:29,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {4204#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:11:29,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {4204#true} call #t~ret6 := main(); {4204#true} is VALID [2022-04-14 15:11:29,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4204#true} {4204#true} #81#return; {4204#true} is VALID [2022-04-14 15:11:29,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:29,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {4204#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4204#true} is VALID [2022-04-14 15:11:29,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {4204#true} call ULTIMATE.init(); {4204#true} is VALID [2022-04-14 15:11:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-14 15:11:29,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:29,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018553973] [2022-04-14 15:11:29,988 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:29,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40010832] [2022-04-14 15:11:29,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40010832] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:11:29,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:11:29,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 15:11:29,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945589126] [2022-04-14 15:11:29,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:11:29,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-04-14 15:11:29,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:29,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-14 15:11:30,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:30,033 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:11:30,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:30,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:11:30,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:11:30,034 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-14 15:11:30,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:30,967 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2022-04-14 15:11:30,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 15:11:30,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-04-14 15:11:30,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-14 15:11:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-14 15:11:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-14 15:11:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-14 15:11:30,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-14 15:11:33,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 79 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:33,066 INFO L225 Difference]: With dead ends: 146 [2022-04-14 15:11:33,066 INFO L226 Difference]: Without dead ends: 135 [2022-04-14 15:11:33,066 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:11:33,067 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:33,067 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 120 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-14 15:11:33,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-14 15:11:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-04-14 15:11:33,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:33,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-14 15:11:33,117 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-14 15:11:33,117 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-14 15:11:33,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:33,119 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-04-14 15:11:33,119 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-14 15:11:33,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:33,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:33,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 135 states. [2022-04-14 15:11:33,120 INFO L87 Difference]: Start difference. First operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 135 states. [2022-04-14 15:11:33,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:33,122 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-04-14 15:11:33,122 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-14 15:11:33,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:33,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:33,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:33,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:33,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-14 15:11:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-04-14 15:11:33,124 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 55 [2022-04-14 15:11:33,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:33,148 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-04-14 15:11:33,148 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-14 15:11:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-14 15:11:33,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-14 15:11:33,148 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:33,149 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:33,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-14 15:11:33,349 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:33,349 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:33,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:33,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 1 times [2022-04-14 15:11:33,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:33,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422453997] [2022-04-14 15:11:33,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:33,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:33,359 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:33,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [732733872] [2022-04-14 15:11:33,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:33,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:33,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:33,375 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-14 15:11:33,376 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-14 15:11:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:33,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-14 15:11:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:33,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:37,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {5223#true} call ULTIMATE.init(); {5223#true} is VALID [2022-04-14 15:11:37,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {5223#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5223#true} is VALID [2022-04-14 15:11:37,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5223#true} {5223#true} #81#return; {5223#true} is VALID [2022-04-14 15:11:37,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {5223#true} call #t~ret6 := main(); {5223#true} is VALID [2022-04-14 15:11:37,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {5223#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:11:37,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:11:37,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:11:37,251 INFO L272 TraceCheckUtils]: 8: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,252 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #59#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:11:37,252 INFO L272 TraceCheckUtils]: 13: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,253 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #61#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:11:37,253 INFO L272 TraceCheckUtils]: 18: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,253 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #63#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:11:37,254 INFO L272 TraceCheckUtils]: 23: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,254 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #65#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:11:37,254 INFO L272 TraceCheckUtils]: 28: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,254 INFO L290 TraceCheckUtils]: 31: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,255 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #67#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:11:37,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:37,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:37,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:37,256 INFO L272 TraceCheckUtils]: 36: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,257 INFO L290 TraceCheckUtils]: 38: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,257 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #59#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:37,257 INFO L272 TraceCheckUtils]: 41: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,257 INFO L290 TraceCheckUtils]: 43: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,257 INFO L290 TraceCheckUtils]: 44: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,258 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #61#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:37,258 INFO L272 TraceCheckUtils]: 46: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,258 INFO L290 TraceCheckUtils]: 47: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,258 INFO L290 TraceCheckUtils]: 48: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,258 INFO L290 TraceCheckUtils]: 49: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,259 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #63#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:37,259 INFO L272 TraceCheckUtils]: 51: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,259 INFO L290 TraceCheckUtils]: 52: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,259 INFO L290 TraceCheckUtils]: 53: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,259 INFO L290 TraceCheckUtils]: 54: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,260 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #65#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:37,260 INFO L272 TraceCheckUtils]: 56: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,260 INFO L290 TraceCheckUtils]: 57: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,260 INFO L290 TraceCheckUtils]: 58: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,260 INFO L290 TraceCheckUtils]: 59: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,260 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #67#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:37,261 INFO L290 TraceCheckUtils]: 61: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-14 15:11:37,261 INFO L272 TraceCheckUtils]: 62: Hoare triple {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,261 INFO L290 TraceCheckUtils]: 63: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,261 INFO L290 TraceCheckUtils]: 64: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,261 INFO L290 TraceCheckUtils]: 65: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,262 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5223#true} {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #69#return; {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-14 15:11:37,262 INFO L272 TraceCheckUtils]: 67: Hoare triple {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:37,263 INFO L290 TraceCheckUtils]: 68: Hoare triple {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5436#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:37,263 INFO L290 TraceCheckUtils]: 69: Hoare triple {5436#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5224#false} is VALID [2022-04-14 15:11:37,263 INFO L290 TraceCheckUtils]: 70: Hoare triple {5224#false} assume !false; {5224#false} is VALID [2022-04-14 15:11:37,263 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-14 15:11:37,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:11:37,975 INFO L290 TraceCheckUtils]: 70: Hoare triple {5224#false} assume !false; {5224#false} is VALID [2022-04-14 15:11:37,975 INFO L290 TraceCheckUtils]: 69: Hoare triple {5436#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5224#false} is VALID [2022-04-14 15:11:37,975 INFO L290 TraceCheckUtils]: 68: Hoare triple {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5436#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:37,976 INFO L272 TraceCheckUtils]: 67: Hoare triple {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:37,976 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5223#true} {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} #69#return; {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} is VALID [2022-04-14 15:11:37,976 INFO L290 TraceCheckUtils]: 65: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,976 INFO L290 TraceCheckUtils]: 64: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,977 INFO L290 TraceCheckUtils]: 63: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,977 INFO L272 TraceCheckUtils]: 62: Hoare triple {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,977 INFO L290 TraceCheckUtils]: 61: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} assume !(~n~0 <= ~a~0); {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} is VALID [2022-04-14 15:11:37,977 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #67#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:11:37,977 INFO L290 TraceCheckUtils]: 59: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,978 INFO L290 TraceCheckUtils]: 58: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,978 INFO L290 TraceCheckUtils]: 57: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,978 INFO L272 TraceCheckUtils]: 56: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,978 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #65#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:11:37,978 INFO L290 TraceCheckUtils]: 54: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,978 INFO L290 TraceCheckUtils]: 53: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,978 INFO L290 TraceCheckUtils]: 52: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,978 INFO L272 TraceCheckUtils]: 51: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,979 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #63#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:11:37,979 INFO L290 TraceCheckUtils]: 49: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,979 INFO L290 TraceCheckUtils]: 48: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,979 INFO L290 TraceCheckUtils]: 47: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,979 INFO L272 TraceCheckUtils]: 46: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,979 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #61#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:11:37,979 INFO L290 TraceCheckUtils]: 44: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,980 INFO L290 TraceCheckUtils]: 43: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,980 INFO L272 TraceCheckUtils]: 41: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,980 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #59#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:11:37,980 INFO L290 TraceCheckUtils]: 39: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,980 INFO L290 TraceCheckUtils]: 38: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,980 INFO L290 TraceCheckUtils]: 37: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,980 INFO L272 TraceCheckUtils]: 36: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} assume !!(#t~post5 < 5);havoc #t~post5; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:11:37,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:11:37,983 INFO L290 TraceCheckUtils]: 33: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:11:37,984 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #67#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:11:37,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,984 INFO L290 TraceCheckUtils]: 30: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,984 INFO L272 TraceCheckUtils]: 28: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,984 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #65#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:11:37,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,985 INFO L272 TraceCheckUtils]: 23: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,985 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #63#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:11:37,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,985 INFO L272 TraceCheckUtils]: 18: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,986 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #61#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:11:37,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,986 INFO L272 TraceCheckUtils]: 13: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,986 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #59#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:11:37,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:37,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:37,987 INFO L272 TraceCheckUtils]: 8: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:37,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} assume !!(#t~post5 < 5);havoc #t~post5; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:11:37,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:11:37,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {5223#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:11:37,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {5223#true} call #t~ret6 := main(); {5223#true} is VALID [2022-04-14 15:11:37,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5223#true} {5223#true} #81#return; {5223#true} is VALID [2022-04-14 15:11:37,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:37,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {5223#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5223#true} is VALID [2022-04-14 15:11:37,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {5223#true} call ULTIMATE.init(); {5223#true} is VALID [2022-04-14 15:11:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-14 15:11:37,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:37,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422453997] [2022-04-14 15:11:37,989 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:37,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732733872] [2022-04-14 15:11:37,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732733872] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:11:37,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:11:37,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-14 15:11:37,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068026550] [2022-04-14 15:11:37,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:11:37,991 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-04-14 15:11:37,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:37,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-14 15:11:38,072 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-14 15:11:38,072 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 15:11:38,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:38,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 15:11:38,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:11:38,073 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-14 15:11:38,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:38,967 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2022-04-14 15:11:38,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 15:11:38,967 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-04-14 15:11:38,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:38,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-14 15:11:38,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-14 15:11:38,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-14 15:11:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-14 15:11:38,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 92 transitions. [2022-04-14 15:11:39,063 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-14 15:11:39,065 INFO L225 Difference]: With dead ends: 148 [2022-04-14 15:11:39,065 INFO L226 Difference]: Without dead ends: 144 [2022-04-14 15:11:39,065 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-14 15:11:39,066 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:39,066 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 189 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-14 15:11:39,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-14 15:11:39,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-04-14 15:11:39,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:39,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-14 15:11:39,148 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-14 15:11:39,148 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-14 15:11:39,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:39,150 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-04-14 15:11:39,150 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2022-04-14 15:11:39,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:39,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:39,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 144 states. [2022-04-14 15:11:39,151 INFO L87 Difference]: Start difference. First operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 144 states. [2022-04-14 15:11:39,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:39,153 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-04-14 15:11:39,153 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2022-04-14 15:11:39,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:39,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:39,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:39,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:39,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-14 15:11:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2022-04-14 15:11:39,156 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 71 [2022-04-14 15:11:39,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:39,156 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2022-04-14 15:11:39,156 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-14 15:11:39,156 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2022-04-14 15:11:39,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-14 15:11:39,157 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:39,157 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:39,192 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-14 15:11:39,372 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-14 15:11:39,373 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:39,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:39,373 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 1 times [2022-04-14 15:11:39,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:39,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085064085] [2022-04-14 15:11:39,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:39,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:39,399 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:39,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [138926943] [2022-04-14 15:11:39,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:39,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:39,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:39,400 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-14 15:11:39,403 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-14 15:11:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:39,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-14 15:11:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:39,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:40,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {6368#true} call ULTIMATE.init(); {6368#true} is VALID [2022-04-14 15:11:40,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {6368#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6368#true} is VALID [2022-04-14 15:11:40,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:40,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6368#true} {6368#true} #81#return; {6368#true} is VALID [2022-04-14 15:11:40,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {6368#true} call #t~ret6 := main(); {6368#true} is VALID [2022-04-14 15:11:40,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {6368#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-14 15:11:40,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-14 15:11:40,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(#t~post5 < 5);havoc #t~post5; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-14 15:11:40,087 INFO L272 TraceCheckUtils]: 8: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:40,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:40,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:40,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:40,088 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #59#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-14 15:11:40,088 INFO L272 TraceCheckUtils]: 13: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:40,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:40,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:40,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:40,088 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #61#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-14 15:11:40,088 INFO L272 TraceCheckUtils]: 18: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:40,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:40,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:40,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:40,089 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #63#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-14 15:11:40,089 INFO L272 TraceCheckUtils]: 23: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:40,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:40,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:40,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:40,090 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #65#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-14 15:11:40,090 INFO L272 TraceCheckUtils]: 28: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:40,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:40,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:40,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:40,091 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #67#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-14 15:11:40,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:40,092 INFO L290 TraceCheckUtils]: 34: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:40,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:40,093 INFO L272 TraceCheckUtils]: 36: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:40,093 INFO L290 TraceCheckUtils]: 37: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:40,093 INFO L290 TraceCheckUtils]: 38: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:40,093 INFO L290 TraceCheckUtils]: 39: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:40,093 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #59#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:40,093 INFO L272 TraceCheckUtils]: 41: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:40,094 INFO L290 TraceCheckUtils]: 42: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:40,094 INFO L290 TraceCheckUtils]: 43: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:40,094 INFO L290 TraceCheckUtils]: 44: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:40,094 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #61#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:40,094 INFO L272 TraceCheckUtils]: 46: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:40,094 INFO L290 TraceCheckUtils]: 47: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:40,094 INFO L290 TraceCheckUtils]: 48: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:40,094 INFO L290 TraceCheckUtils]: 49: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:40,095 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #63#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:40,095 INFO L272 TraceCheckUtils]: 51: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:40,095 INFO L290 TraceCheckUtils]: 52: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:40,095 INFO L290 TraceCheckUtils]: 53: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:40,095 INFO L290 TraceCheckUtils]: 54: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:40,096 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #65#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:40,096 INFO L272 TraceCheckUtils]: 56: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:40,096 INFO L290 TraceCheckUtils]: 57: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:40,096 INFO L290 TraceCheckUtils]: 58: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:40,096 INFO L290 TraceCheckUtils]: 59: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:40,097 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #67#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:40,097 INFO L290 TraceCheckUtils]: 61: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-14 15:11:40,097 INFO L272 TraceCheckUtils]: 62: Hoare triple {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:40,097 INFO L290 TraceCheckUtils]: 63: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:40,097 INFO L290 TraceCheckUtils]: 64: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:40,097 INFO L290 TraceCheckUtils]: 65: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:40,098 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6368#true} {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #69#return; {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-14 15:11:40,098 INFO L272 TraceCheckUtils]: 67: Hoare triple {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:40,098 INFO L290 TraceCheckUtils]: 68: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:40,098 INFO L290 TraceCheckUtils]: 69: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:40,098 INFO L290 TraceCheckUtils]: 70: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:40,099 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6368#true} {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #71#return; {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-14 15:11:40,100 INFO L272 TraceCheckUtils]: 72: Hoare triple {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {6592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:40,100 INFO L290 TraceCheckUtils]: 73: Hoare triple {6592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:40,101 INFO L290 TraceCheckUtils]: 74: Hoare triple {6596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6369#false} is VALID [2022-04-14 15:11:40,101 INFO L290 TraceCheckUtils]: 75: Hoare triple {6369#false} assume !false; {6369#false} is VALID [2022-04-14 15:11:40,101 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-14 15:11:40,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:11:53,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:53,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085064085] [2022-04-14 15:11:53,121 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:53,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138926943] [2022-04-14 15:11:53,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138926943] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:11:53,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:11:53,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-14 15:11:53,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524444828] [2022-04-14 15:11:53,122 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:11:53,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-14 15:11:53,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:53,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-14 15:11:53,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:53,157 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 15:11:53,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:53,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 15:11:53,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:11:53,158 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-14 15:11:53,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:53,551 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2022-04-14 15:11:53,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 15:11:53,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-14 15:11:53,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:53,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-14 15:11:53,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-14 15:11:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-14 15:11:53,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-14 15:11:53,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-14 15:11:53,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:53,670 INFO L225 Difference]: With dead ends: 143 [2022-04-14 15:11:53,670 INFO L226 Difference]: Without dead ends: 132 [2022-04-14 15:11:53,673 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-14 15:11:53,674 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:53,675 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 177 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:11:53,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-14 15:11:53,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-14 15:11:53,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:53,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 15:11:53,750 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 15:11:53,751 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 15:11:53,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:53,753 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-04-14 15:11:53,753 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-14 15:11:53,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:53,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:53,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 132 states. [2022-04-14 15:11:53,754 INFO L87 Difference]: Start difference. First operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 132 states. [2022-04-14 15:11:53,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:53,757 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-04-14 15:11:53,757 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-14 15:11:53,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:53,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:53,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:53,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:53,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 15:11:53,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2022-04-14 15:11:53,762 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 76 [2022-04-14 15:11:53,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:53,762 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2022-04-14 15:11:53,762 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-14 15:11:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-14 15:11:53,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-14 15:11:53,763 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:53,763 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:53,778 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-14 15:11:53,971 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:53,971 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:53,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:53,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1454229731, now seen corresponding path program 4 times [2022-04-14 15:11:53,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:53,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411360716] [2022-04-14 15:11:53,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:53,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:53,982 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:53,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2066478521] [2022-04-14 15:11:53,982 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-14 15:11:53,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:53,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:53,983 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-14 15:11:53,986 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-14 15:11:55,009 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-14 15:11:55,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:11:55,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-14 15:11:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:55,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:55,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-14 15:11:55,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7397#true} is VALID [2022-04-14 15:11:55,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:11:55,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #81#return; {7397#true} is VALID [2022-04-14 15:11:55,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret6 := main(); {7397#true} is VALID [2022-04-14 15:11:55,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {7397#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7397#true} is VALID [2022-04-14 15:11:55,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {7397#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7397#true} is VALID [2022-04-14 15:11:55,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {7397#true} assume !!(#t~post5 < 5);havoc #t~post5; {7397#true} is VALID [2022-04-14 15:11:55,726 INFO L272 TraceCheckUtils]: 8: Hoare triple {7397#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:11:55,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:11:55,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:11:55,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:11:55,726 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-14 15:11:55,726 INFO L272 TraceCheckUtils]: 13: Hoare triple {7397#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-14 15:11:55,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:55,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:11:55,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:11:55,728 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7397#true} #61#return; {7455#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-14 15:11:55,728 INFO L272 TraceCheckUtils]: 18: Hoare triple {7455#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:11:55,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:55,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:11:55,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:11:55,729 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7455#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #63#return; {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:11:55,729 INFO L272 TraceCheckUtils]: 23: Hoare triple {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:11:55,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:55,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:11:55,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:11:55,731 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:11:55,731 INFO L272 TraceCheckUtils]: 28: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-14 15:11:55,731 INFO L290 TraceCheckUtils]: 29: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:11:55,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:11:55,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:11:55,732 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7397#true} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:11:57,734 WARN L290 TraceCheckUtils]: 33: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is UNKNOWN [2022-04-14 15:11:57,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:11:57,736 INFO L290 TraceCheckUtils]: 35: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 5);havoc #t~post5; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:11:57,736 INFO L272 TraceCheckUtils]: 36: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:11:57,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:11:57,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:11:57,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:11:57,736 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7397#true} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:11:57,736 INFO L272 TraceCheckUtils]: 41: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-14 15:11:57,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:57,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:11:57,737 INFO L290 TraceCheckUtils]: 44: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:11:57,738 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:11:57,738 INFO L272 TraceCheckUtils]: 46: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:11:57,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:57,738 INFO L290 TraceCheckUtils]: 48: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:11:57,739 INFO L290 TraceCheckUtils]: 49: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:11:57,739 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #63#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:11:57,739 INFO L272 TraceCheckUtils]: 51: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:11:57,739 INFO L290 TraceCheckUtils]: 52: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:57,740 INFO L290 TraceCheckUtils]: 53: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:11:57,740 INFO L290 TraceCheckUtils]: 54: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:11:57,740 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:11:57,741 INFO L272 TraceCheckUtils]: 56: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-14 15:11:57,741 INFO L290 TraceCheckUtils]: 57: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:11:57,741 INFO L290 TraceCheckUtils]: 58: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:11:57,741 INFO L290 TraceCheckUtils]: 59: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:11:57,741 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7397#true} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:11:59,742 WARN L290 TraceCheckUtils]: 61: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is UNKNOWN [2022-04-14 15:11:59,743 INFO L290 TraceCheckUtils]: 62: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:11:59,743 INFO L290 TraceCheckUtils]: 63: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 5);havoc #t~post5; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:11:59,744 INFO L272 TraceCheckUtils]: 64: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:11:59,744 INFO L290 TraceCheckUtils]: 65: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:59,744 INFO L290 TraceCheckUtils]: 66: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:11:59,744 INFO L290 TraceCheckUtils]: 67: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:11:59,745 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:11:59,745 INFO L272 TraceCheckUtils]: 69: Hoare triple {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-14 15:11:59,745 INFO L290 TraceCheckUtils]: 70: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:59,746 INFO L290 TraceCheckUtils]: 71: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:11:59,746 INFO L290 TraceCheckUtils]: 72: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:11:59,746 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {7626#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:11:59,747 INFO L272 TraceCheckUtils]: 74: Hoare triple {7626#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7630#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:59,747 INFO L290 TraceCheckUtils]: 75: Hoare triple {7630#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7634#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:59,748 INFO L290 TraceCheckUtils]: 76: Hoare triple {7634#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7398#false} is VALID [2022-04-14 15:11:59,748 INFO L290 TraceCheckUtils]: 77: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-14 15:11:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 86 proven. 47 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-04-14 15:11:59,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:12:00,686 INFO L290 TraceCheckUtils]: 77: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-14 15:12:00,686 INFO L290 TraceCheckUtils]: 76: Hoare triple {7634#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7398#false} is VALID [2022-04-14 15:12:00,686 INFO L290 TraceCheckUtils]: 75: Hoare triple {7630#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7634#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:00,687 INFO L272 TraceCheckUtils]: 74: Hoare triple {7626#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7630#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:12:00,687 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7653#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {7626#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:12:00,688 INFO L290 TraceCheckUtils]: 72: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:00,688 INFO L290 TraceCheckUtils]: 71: Hoare triple {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:00,688 INFO L290 TraceCheckUtils]: 70: Hoare triple {7397#true} ~cond := #in~cond; {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:12:00,688 INFO L272 TraceCheckUtils]: 69: Hoare triple {7653#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:00,689 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {7653#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:12:00,689 INFO L290 TraceCheckUtils]: 67: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:00,690 INFO L290 TraceCheckUtils]: 66: Hoare triple {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:00,690 INFO L290 TraceCheckUtils]: 65: Hoare triple {7397#true} ~cond := #in~cond; {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:12:00,690 INFO L272 TraceCheckUtils]: 64: Hoare triple {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:00,690 INFO L290 TraceCheckUtils]: 63: Hoare triple {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 5);havoc #t~post5; {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:12:00,691 INFO L290 TraceCheckUtils]: 62: Hoare triple {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:12:00,699 INFO L290 TraceCheckUtils]: 61: Hoare triple {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:12:00,699 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7397#true} {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:12:00,699 INFO L290 TraceCheckUtils]: 59: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:00,699 INFO L290 TraceCheckUtils]: 58: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:00,700 INFO L290 TraceCheckUtils]: 57: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:00,700 INFO L272 TraceCheckUtils]: 56: Hoare triple {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:00,703 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7397#true} #65#return; {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:12:00,703 INFO L290 TraceCheckUtils]: 54: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:00,703 INFO L290 TraceCheckUtils]: 53: Hoare triple {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:00,704 INFO L290 TraceCheckUtils]: 52: Hoare triple {7397#true} ~cond := #in~cond; {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:12:00,704 INFO L272 TraceCheckUtils]: 51: Hoare triple {7397#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:00,704 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7397#true} {7397#true} #63#return; {7397#true} is VALID [2022-04-14 15:12:00,704 INFO L290 TraceCheckUtils]: 49: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:00,704 INFO L290 TraceCheckUtils]: 48: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:00,704 INFO L290 TraceCheckUtils]: 47: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:00,704 INFO L272 TraceCheckUtils]: 46: Hoare triple {7397#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:00,704 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7397#true} {7397#true} #61#return; {7397#true} is VALID [2022-04-14 15:12:00,704 INFO L290 TraceCheckUtils]: 44: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:00,704 INFO L290 TraceCheckUtils]: 43: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:00,704 INFO L290 TraceCheckUtils]: 42: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:00,704 INFO L272 TraceCheckUtils]: 41: Hoare triple {7397#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:00,705 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-14 15:12:00,705 INFO L290 TraceCheckUtils]: 39: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:00,705 INFO L290 TraceCheckUtils]: 38: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:00,705 INFO L290 TraceCheckUtils]: 37: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:00,705 INFO L272 TraceCheckUtils]: 36: Hoare triple {7397#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:00,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {7397#true} assume !!(#t~post5 < 5);havoc #t~post5; {7397#true} is VALID [2022-04-14 15:12:00,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {7397#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7397#true} is VALID [2022-04-14 15:12:00,705 INFO L290 TraceCheckUtils]: 33: Hoare triple {7397#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7397#true} is VALID [2022-04-14 15:12:00,705 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7397#true} {7397#true} #67#return; {7397#true} is VALID [2022-04-14 15:12:00,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:00,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:00,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:00,705 INFO L272 TraceCheckUtils]: 28: Hoare triple {7397#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:00,705 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7397#true} {7397#true} #65#return; {7397#true} is VALID [2022-04-14 15:12:00,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:00,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:00,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:00,706 INFO L272 TraceCheckUtils]: 23: Hoare triple {7397#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:00,706 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7397#true} {7397#true} #63#return; {7397#true} is VALID [2022-04-14 15:12:00,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:00,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:00,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:00,708 INFO L272 TraceCheckUtils]: 18: Hoare triple {7397#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:00,708 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7397#true} {7397#true} #61#return; {7397#true} is VALID [2022-04-14 15:12:00,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:00,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:00,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:00,708 INFO L272 TraceCheckUtils]: 13: Hoare triple {7397#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:00,708 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-14 15:12:00,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:00,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:00,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:00,709 INFO L272 TraceCheckUtils]: 8: Hoare triple {7397#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:00,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {7397#true} assume !!(#t~post5 < 5);havoc #t~post5; {7397#true} is VALID [2022-04-14 15:12:00,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {7397#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7397#true} is VALID [2022-04-14 15:12:00,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {7397#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7397#true} is VALID [2022-04-14 15:12:00,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret6 := main(); {7397#true} is VALID [2022-04-14 15:12:00,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #81#return; {7397#true} is VALID [2022-04-14 15:12:00,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:00,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7397#true} is VALID [2022-04-14 15:12:00,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-14 15:12:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-04-14 15:12:00,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:12:00,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411360716] [2022-04-14 15:12:00,710 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:12:00,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066478521] [2022-04-14 15:12:00,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066478521] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:12:00,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:12:00,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2022-04-14 15:12:00,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285669106] [2022-04-14 15:12:00,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:12:00,710 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) Word has length 78 [2022-04-14 15:12:00,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:12:00,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-14 15:12:03,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 61 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 15:12:03,349 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-14 15:12:03,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:12:03,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-14 15:12:03,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-14 15:12:03,350 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-14 15:12:05,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:12:06,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:06,325 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2022-04-14 15:12:06,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 15:12:06,326 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) Word has length 78 [2022-04-14 15:12:06,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:12:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-14 15:12:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-14 15:12:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-14 15:12:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-14 15:12:06,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-14 15:12:08,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 35 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 15:12:08,377 INFO L225 Difference]: With dead ends: 142 [2022-04-14 15:12:08,377 INFO L226 Difference]: Without dead ends: 138 [2022-04-14 15:12:08,377 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 139 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-14 15:12:08,378 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-14 15:12:08,378 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 55 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 74 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-14 15:12:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-14 15:12:08,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-04-14 15:12:08,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:12:08,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 15:12:08,483 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 15:12:08,483 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 15:12:08,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:08,485 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-04-14 15:12:08,485 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-14 15:12:08,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:12:08,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:12:08,486 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 138 states. [2022-04-14 15:12:08,486 INFO L87 Difference]: Start difference. First operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 138 states. [2022-04-14 15:12:08,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:08,488 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-04-14 15:12:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-14 15:12:08,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:12:08,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:12:08,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:12:08,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:12:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 15:12:08,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2022-04-14 15:12:08,490 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 78 [2022-04-14 15:12:08,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:12:08,491 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2022-04-14 15:12:08,491 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-14 15:12:08,496 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-14 15:12:08,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-14 15:12:08,497 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:12:08,497 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:12:08,509 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-14 15:12:08,709 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-14 15:12:08,709 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:12:08,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:12:08,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 2 times [2022-04-14 15:12:08,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:12:08,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430406498] [2022-04-14 15:12:08,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:12:08,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:12:08,728 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:12:08,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [273875473] [2022-04-14 15:12:08,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:12:08,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:12:08,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:12:08,743 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-14 15:12:08,759 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-14 15:12:08,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 15:12:08,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:12:08,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-14 15:12:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:12:08,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:12:09,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {8553#true} call ULTIMATE.init(); {8553#true} is VALID [2022-04-14 15:12:09,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {8553#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8553#true} is VALID [2022-04-14 15:12:09,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-14 15:12:09,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8553#true} {8553#true} #81#return; {8553#true} is VALID [2022-04-14 15:12:09,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {8553#true} call #t~ret6 := main(); {8553#true} is VALID [2022-04-14 15:12:09,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {8553#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:09,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:09,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:09,342 INFO L272 TraceCheckUtils]: 8: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-14 15:12:09,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-14 15:12:09,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-14 15:12:09,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-14 15:12:09,343 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8553#true} {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:09,343 INFO L272 TraceCheckUtils]: 13: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8553#true} is VALID [2022-04-14 15:12:09,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-14 15:12:09,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-14 15:12:09,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-14 15:12:09,344 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8553#true} {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:09,344 INFO L272 TraceCheckUtils]: 18: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-14 15:12:09,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-14 15:12:09,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-14 15:12:09,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-14 15:12:09,346 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8553#true} {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:09,346 INFO L272 TraceCheckUtils]: 23: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8553#true} is VALID [2022-04-14 15:12:09,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-14 15:12:09,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-14 15:12:09,347 INFO L290 TraceCheckUtils]: 26: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-14 15:12:09,347 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8553#true} {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:09,347 INFO L272 TraceCheckUtils]: 28: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8553#true} is VALID [2022-04-14 15:12:09,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-14 15:12:09,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-14 15:12:09,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-14 15:12:09,347 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8553#true} {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:09,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 15:12:09,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 15:12:09,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} assume !!(#t~post5 < 5);havoc #t~post5; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 15:12:09,348 INFO L272 TraceCheckUtils]: 36: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-14 15:12:09,348 INFO L290 TraceCheckUtils]: 37: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-14 15:12:09,349 INFO L290 TraceCheckUtils]: 38: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-14 15:12:09,349 INFO L290 TraceCheckUtils]: 39: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-14 15:12:09,349 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8553#true} {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #59#return; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 15:12:09,349 INFO L272 TraceCheckUtils]: 41: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8553#true} is VALID [2022-04-14 15:12:09,349 INFO L290 TraceCheckUtils]: 42: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-14 15:12:09,349 INFO L290 TraceCheckUtils]: 43: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-14 15:12:09,349 INFO L290 TraceCheckUtils]: 44: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-14 15:12:09,349 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8553#true} {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #61#return; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 15:12:09,350 INFO L272 TraceCheckUtils]: 46: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-14 15:12:09,350 INFO L290 TraceCheckUtils]: 47: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-14 15:12:09,350 INFO L290 TraceCheckUtils]: 48: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-14 15:12:09,350 INFO L290 TraceCheckUtils]: 49: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-14 15:12:09,350 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8553#true} {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #63#return; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 15:12:09,350 INFO L272 TraceCheckUtils]: 51: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8553#true} is VALID [2022-04-14 15:12:09,350 INFO L290 TraceCheckUtils]: 52: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-14 15:12:09,350 INFO L290 TraceCheckUtils]: 53: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-14 15:12:09,350 INFO L290 TraceCheckUtils]: 54: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-14 15:12:09,351 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8553#true} {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #65#return; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 15:12:09,351 INFO L272 TraceCheckUtils]: 56: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8553#true} is VALID [2022-04-14 15:12:09,351 INFO L290 TraceCheckUtils]: 57: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-14 15:12:09,351 INFO L290 TraceCheckUtils]: 58: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-14 15:12:09,351 INFO L290 TraceCheckUtils]: 59: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-14 15:12:09,351 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8553#true} {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #67#return; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 15:12:09,352 INFO L290 TraceCheckUtils]: 61: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:12:09,352 INFO L290 TraceCheckUtils]: 62: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:12:09,352 INFO L290 TraceCheckUtils]: 63: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:12:09,352 INFO L272 TraceCheckUtils]: 64: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-14 15:12:09,352 INFO L290 TraceCheckUtils]: 65: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-14 15:12:09,352 INFO L290 TraceCheckUtils]: 66: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-14 15:12:09,352 INFO L290 TraceCheckUtils]: 67: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-14 15:12:09,353 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8553#true} {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #59#return; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:12:09,353 INFO L272 TraceCheckUtils]: 69: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8553#true} is VALID [2022-04-14 15:12:09,353 INFO L290 TraceCheckUtils]: 70: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-14 15:12:09,353 INFO L290 TraceCheckUtils]: 71: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-14 15:12:09,353 INFO L290 TraceCheckUtils]: 72: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-14 15:12:09,353 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8553#true} {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #61#return; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:12:09,354 INFO L272 TraceCheckUtils]: 74: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-14 15:12:09,354 INFO L290 TraceCheckUtils]: 75: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-14 15:12:09,354 INFO L290 TraceCheckUtils]: 76: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-14 15:12:09,354 INFO L290 TraceCheckUtils]: 77: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-14 15:12:09,355 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {8553#true} {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #63#return; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:12:09,355 INFO L272 TraceCheckUtils]: 79: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8553#true} is VALID [2022-04-14 15:12:09,355 INFO L290 TraceCheckUtils]: 80: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-14 15:12:09,355 INFO L290 TraceCheckUtils]: 81: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-14 15:12:09,355 INFO L290 TraceCheckUtils]: 82: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-14 15:12:09,355 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {8553#true} {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #65#return; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:12:09,355 INFO L272 TraceCheckUtils]: 84: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8553#true} is VALID [2022-04-14 15:12:09,355 INFO L290 TraceCheckUtils]: 85: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-14 15:12:09,355 INFO L290 TraceCheckUtils]: 86: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-14 15:12:09,355 INFO L290 TraceCheckUtils]: 87: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-14 15:12:09,356 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {8553#true} {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #67#return; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:12:09,356 INFO L290 TraceCheckUtils]: 89: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} assume !(~n~0 <= ~a~0); {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-14 15:12:09,356 INFO L272 TraceCheckUtils]: 90: Hoare triple {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-14 15:12:09,356 INFO L290 TraceCheckUtils]: 91: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-14 15:12:09,356 INFO L290 TraceCheckUtils]: 92: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-14 15:12:09,356 INFO L290 TraceCheckUtils]: 93: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-14 15:12:09,357 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {8553#true} {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #69#return; {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-14 15:12:09,357 INFO L272 TraceCheckUtils]: 95: Hoare triple {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {8553#true} is VALID [2022-04-14 15:12:09,357 INFO L290 TraceCheckUtils]: 96: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-14 15:12:09,357 INFO L290 TraceCheckUtils]: 97: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-14 15:12:09,357 INFO L290 TraceCheckUtils]: 98: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-14 15:12:09,357 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {8553#true} {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #71#return; {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-14 15:12:09,358 INFO L272 TraceCheckUtils]: 100: Hoare triple {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {8862#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:12:09,358 INFO L290 TraceCheckUtils]: 101: Hoare triple {8862#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8866#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:09,358 INFO L290 TraceCheckUtils]: 102: Hoare triple {8866#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8554#false} is VALID [2022-04-14 15:12:09,358 INFO L290 TraceCheckUtils]: 103: Hoare triple {8554#false} assume !false; {8554#false} is VALID [2022-04-14 15:12:09,359 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-14 15:12:09,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:12:17,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:12:17,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430406498] [2022-04-14 15:12:17,614 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:12:17,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273875473] [2022-04-14 15:12:17,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273875473] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:12:17,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:12:17,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-14 15:12:17,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677345983] [2022-04-14 15:12:17,614 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:12:17,615 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 104 [2022-04-14 15:12:17,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:12:17,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-14 15:12:17,660 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-14 15:12:17,660 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:12:17,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:12:17,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:12:17,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-14 15:12:17,661 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-14 15:12:18,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:18,307 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2022-04-14 15:12:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 15:12:18,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 104 [2022-04-14 15:12:18,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:12:18,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-14 15:12:18,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-14 15:12:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-14 15:12:18,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-14 15:12:18,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2022-04-14 15:12:18,379 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-14 15:12:18,381 INFO L225 Difference]: With dead ends: 140 [2022-04-14 15:12:18,381 INFO L226 Difference]: Without dead ends: 129 [2022-04-14 15:12:18,381 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-14 15:12:18,381 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 15:12:18,381 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 187 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 15:12:18,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-14 15:12:18,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-14 15:12:18,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:12:18,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 15:12:18,457 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 15:12:18,457 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 15:12:18,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:18,459 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-14 15:12:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-14 15:12:18,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:12:18,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:12:18,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 129 states. [2022-04-14 15:12:18,460 INFO L87 Difference]: Start difference. First operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 129 states. [2022-04-14 15:12:18,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:18,461 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-14 15:12:18,461 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-14 15:12:18,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:12:18,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:12:18,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:12:18,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:12:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 15:12:18,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2022-04-14 15:12:18,464 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 104 [2022-04-14 15:12:18,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:12:18,464 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2022-04-14 15:12:18,464 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-14 15:12:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-14 15:12:18,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-14 15:12:18,465 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:12:18,465 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:12:18,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-14 15:12:18,680 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-14 15:12:18,681 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:12:18,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:12:18,681 INFO L85 PathProgramCache]: Analyzing trace with hash -813840784, now seen corresponding path program 2 times [2022-04-14 15:12:18,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:12:18,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671655379] [2022-04-14 15:12:18,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:12:18,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:12:18,690 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:12:18,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [904239702] [2022-04-14 15:12:18,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:12:18,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:12:18,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:12:18,691 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-14 15:12:18,692 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-14 15:12:18,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 15:12:18,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:12:18,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-14 15:12:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:12:18,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:12:19,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {9649#true} call ULTIMATE.init(); {9649#true} is VALID [2022-04-14 15:12:19,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {9649#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9649#true} is VALID [2022-04-14 15:12:19,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9649#true} {9649#true} #81#return; {9649#true} is VALID [2022-04-14 15:12:19,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {9649#true} call #t~ret6 := main(); {9649#true} is VALID [2022-04-14 15:12:19,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {9649#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:19,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:19,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:19,427 INFO L272 TraceCheckUtils]: 8: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-14 15:12:19,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-14 15:12:19,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-14 15:12:19,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,427 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9649#true} {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:19,427 INFO L272 TraceCheckUtils]: 13: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9649#true} is VALID [2022-04-14 15:12:19,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-14 15:12:19,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-14 15:12:19,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,448 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9649#true} {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:19,448 INFO L272 TraceCheckUtils]: 18: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-14 15:12:19,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-14 15:12:19,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-14 15:12:19,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,449 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9649#true} {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:19,449 INFO L272 TraceCheckUtils]: 23: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9649#true} is VALID [2022-04-14 15:12:19,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-14 15:12:19,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-14 15:12:19,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,449 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9649#true} {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:19,449 INFO L272 TraceCheckUtils]: 28: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9649#true} is VALID [2022-04-14 15:12:19,449 INFO L290 TraceCheckUtils]: 29: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-14 15:12:19,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-14 15:12:19,450 INFO L290 TraceCheckUtils]: 31: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,450 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9649#true} {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:19,451 INFO L290 TraceCheckUtils]: 33: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-14 15:12:19,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-14 15:12:19,452 INFO L290 TraceCheckUtils]: 35: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 5);havoc #t~post5; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-14 15:12:19,452 INFO L272 TraceCheckUtils]: 36: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-14 15:12:19,452 INFO L290 TraceCheckUtils]: 37: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-14 15:12:19,452 INFO L290 TraceCheckUtils]: 38: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-14 15:12:19,452 INFO L290 TraceCheckUtils]: 39: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,453 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9649#true} {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #59#return; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-14 15:12:19,453 INFO L272 TraceCheckUtils]: 41: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9649#true} is VALID [2022-04-14 15:12:19,453 INFO L290 TraceCheckUtils]: 42: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-14 15:12:19,453 INFO L290 TraceCheckUtils]: 43: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-14 15:12:19,453 INFO L290 TraceCheckUtils]: 44: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,456 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9649#true} {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #61#return; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-14 15:12:19,456 INFO L272 TraceCheckUtils]: 46: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-14 15:12:19,456 INFO L290 TraceCheckUtils]: 47: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-14 15:12:19,456 INFO L290 TraceCheckUtils]: 48: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-14 15:12:19,456 INFO L290 TraceCheckUtils]: 49: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,457 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9649#true} {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #63#return; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-14 15:12:19,457 INFO L272 TraceCheckUtils]: 51: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9649#true} is VALID [2022-04-14 15:12:19,457 INFO L290 TraceCheckUtils]: 52: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-14 15:12:19,457 INFO L290 TraceCheckUtils]: 53: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-14 15:12:19,457 INFO L290 TraceCheckUtils]: 54: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,457 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9649#true} {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #65#return; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-14 15:12:19,457 INFO L272 TraceCheckUtils]: 56: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9649#true} is VALID [2022-04-14 15:12:19,457 INFO L290 TraceCheckUtils]: 57: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-14 15:12:19,457 INFO L290 TraceCheckUtils]: 58: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-14 15:12:19,458 INFO L290 TraceCheckUtils]: 59: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,458 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9649#true} {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #67#return; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-14 15:12:19,458 INFO L290 TraceCheckUtils]: 61: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-14 15:12:19,459 INFO L290 TraceCheckUtils]: 62: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-14 15:12:19,459 INFO L290 TraceCheckUtils]: 63: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} assume !!(#t~post5 < 5);havoc #t~post5; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-14 15:12:19,459 INFO L272 TraceCheckUtils]: 64: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-14 15:12:19,459 INFO L290 TraceCheckUtils]: 65: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-14 15:12:19,459 INFO L290 TraceCheckUtils]: 66: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-14 15:12:19,459 INFO L290 TraceCheckUtils]: 67: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,460 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9649#true} {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #59#return; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-14 15:12:19,460 INFO L272 TraceCheckUtils]: 69: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9649#true} is VALID [2022-04-14 15:12:19,460 INFO L290 TraceCheckUtils]: 70: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-14 15:12:19,460 INFO L290 TraceCheckUtils]: 71: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-14 15:12:19,460 INFO L290 TraceCheckUtils]: 72: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,461 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9649#true} {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #61#return; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-14 15:12:19,461 INFO L272 TraceCheckUtils]: 74: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-14 15:12:19,461 INFO L290 TraceCheckUtils]: 75: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-14 15:12:19,461 INFO L290 TraceCheckUtils]: 76: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-14 15:12:19,461 INFO L290 TraceCheckUtils]: 77: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,461 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {9649#true} {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #63#return; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-14 15:12:19,461 INFO L272 TraceCheckUtils]: 79: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9649#true} is VALID [2022-04-14 15:12:19,461 INFO L290 TraceCheckUtils]: 80: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-14 15:12:19,461 INFO L290 TraceCheckUtils]: 81: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-14 15:12:19,461 INFO L290 TraceCheckUtils]: 82: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,462 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {9649#true} {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #65#return; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-14 15:12:19,462 INFO L272 TraceCheckUtils]: 84: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9649#true} is VALID [2022-04-14 15:12:19,462 INFO L290 TraceCheckUtils]: 85: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-14 15:12:19,462 INFO L290 TraceCheckUtils]: 86: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-14 15:12:19,462 INFO L290 TraceCheckUtils]: 87: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,463 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {9649#true} {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #67#return; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-14 15:12:19,463 INFO L290 TraceCheckUtils]: 89: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-14 15:12:19,464 INFO L290 TraceCheckUtils]: 90: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-14 15:12:19,465 INFO L290 TraceCheckUtils]: 91: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} assume !!(#t~post5 < 5);havoc #t~post5; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-14 15:12:19,465 INFO L272 TraceCheckUtils]: 92: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-14 15:12:19,465 INFO L290 TraceCheckUtils]: 93: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-14 15:12:19,465 INFO L290 TraceCheckUtils]: 94: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-14 15:12:19,465 INFO L290 TraceCheckUtils]: 95: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,466 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {9649#true} {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #59#return; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-14 15:12:19,466 INFO L272 TraceCheckUtils]: 97: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9649#true} is VALID [2022-04-14 15:12:19,466 INFO L290 TraceCheckUtils]: 98: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-14 15:12:19,466 INFO L290 TraceCheckUtils]: 99: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-14 15:12:19,466 INFO L290 TraceCheckUtils]: 100: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,466 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {9649#true} {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #61#return; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-14 15:12:19,466 INFO L272 TraceCheckUtils]: 102: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-14 15:12:19,466 INFO L290 TraceCheckUtils]: 103: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-14 15:12:19,466 INFO L290 TraceCheckUtils]: 104: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-14 15:12:19,466 INFO L290 TraceCheckUtils]: 105: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,467 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {9649#true} {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #63#return; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-14 15:12:19,467 INFO L272 TraceCheckUtils]: 107: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9649#true} is VALID [2022-04-14 15:12:19,467 INFO L290 TraceCheckUtils]: 108: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-14 15:12:19,467 INFO L290 TraceCheckUtils]: 109: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-14 15:12:19,467 INFO L290 TraceCheckUtils]: 110: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,468 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {9649#true} {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #65#return; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-14 15:12:19,468 INFO L272 TraceCheckUtils]: 112: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9649#true} is VALID [2022-04-14 15:12:19,468 INFO L290 TraceCheckUtils]: 113: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-14 15:12:19,468 INFO L290 TraceCheckUtils]: 114: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-14 15:12:19,468 INFO L290 TraceCheckUtils]: 115: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,468 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {9649#true} {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #67#return; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-14 15:12:19,469 INFO L290 TraceCheckUtils]: 117: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} assume !(~n~0 <= ~a~0); {10009#(and (= 12 (+ (- 15) main_~x~0)) (= (+ main_~x~0 (- 3)) main_~z~0) (not (<= 3 main_~a~0)) (<= 2 main_~a~0))} is VALID [2022-04-14 15:12:19,469 INFO L272 TraceCheckUtils]: 118: Hoare triple {10009#(and (= 12 (+ (- 15) main_~x~0)) (= (+ main_~x~0 (- 3)) main_~z~0) (not (<= 3 main_~a~0)) (<= 2 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-14 15:12:19,469 INFO L290 TraceCheckUtils]: 119: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-14 15:12:19,469 INFO L290 TraceCheckUtils]: 120: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-14 15:12:19,469 INFO L290 TraceCheckUtils]: 121: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-14 15:12:19,469 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {9649#true} {10009#(and (= 12 (+ (- 15) main_~x~0)) (= (+ main_~x~0 (- 3)) main_~z~0) (not (<= 3 main_~a~0)) (<= 2 main_~a~0))} #69#return; {10009#(and (= 12 (+ (- 15) main_~x~0)) (= (+ main_~x~0 (- 3)) main_~z~0) (not (<= 3 main_~a~0)) (<= 2 main_~a~0))} is VALID [2022-04-14 15:12:19,470 INFO L272 TraceCheckUtils]: 123: Hoare triple {10009#(and (= 12 (+ (- 15) main_~x~0)) (= (+ main_~x~0 (- 3)) main_~z~0) (not (<= 3 main_~a~0)) (<= 2 main_~a~0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10028#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:12:19,470 INFO L290 TraceCheckUtils]: 124: Hoare triple {10028#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10032#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:19,471 INFO L290 TraceCheckUtils]: 125: Hoare triple {10032#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9650#false} is VALID [2022-04-14 15:12:19,471 INFO L290 TraceCheckUtils]: 126: Hoare triple {9650#false} assume !false; {9650#false} is VALID [2022-04-14 15:12:19,471 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 42 proven. 48 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-14 15:12:19,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:12:19,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:12:19,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671655379] [2022-04-14 15:12:19,790 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:12:19,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904239702] [2022-04-14 15:12:19,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904239702] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:12:19,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:12:19,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-14 15:12:19,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405572296] [2022-04-14 15:12:19,790 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:12:19,791 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 127 [2022-04-14 15:12:19,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:12:19,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-14 15:12:19,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:12:19,843 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 15:12:19,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:12:19,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 15:12:19,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-14 15:12:19,844 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-14 15:12:20,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:20,831 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2022-04-14 15:12:20,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 15:12:20,831 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 127 [2022-04-14 15:12:20,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:12:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-14 15:12:20,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-14 15:12:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-14 15:12:20,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-14 15:12:20,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-14 15:12:20,924 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-14 15:12:20,925 INFO L225 Difference]: With dead ends: 152 [2022-04-14 15:12:20,926 INFO L226 Difference]: Without dead ends: 150 [2022-04-14 15:12:20,926 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-14 15:12:20,926 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-14 15:12:20,926 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 223 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-14 15:12:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-14 15:12:21,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-04-14 15:12:21,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:12:21,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-14 15:12:21,014 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-14 15:12:21,014 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-14 15:12:21,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:21,016 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-04-14 15:12:21,016 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2022-04-14 15:12:21,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:12:21,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:12:21,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 150 states. [2022-04-14 15:12:21,017 INFO L87 Difference]: Start difference. First operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 150 states. [2022-04-14 15:12:21,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:21,020 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-04-14 15:12:21,020 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2022-04-14 15:12:21,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:12:21,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:12:21,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:12:21,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:12:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-14 15:12:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2022-04-14 15:12:21,023 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 127 [2022-04-14 15:12:21,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:12:21,023 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2022-04-14 15:12:21,023 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-14 15:12:21,023 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2022-04-14 15:12:21,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-14 15:12:21,025 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:12:21,025 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:12:21,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-14 15:12:21,241 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-14 15:12:21,241 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:12:21,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:12:21,242 INFO L85 PathProgramCache]: Analyzing trace with hash -167438485, now seen corresponding path program 2 times [2022-04-14 15:12:21,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:12:21,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165661562] [2022-04-14 15:12:21,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:12:21,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:12:21,254 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:12:21,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [128943209] [2022-04-14 15:12:21,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:12:21,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:12:21,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:12:21,266 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-14 15:12:21,267 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-14 15:12:21,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 15:12:21,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:12:21,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 15:12:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:12:21,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:12:21,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {10890#true} call ULTIMATE.init(); {10890#true} is VALID [2022-04-14 15:12:21,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {10890#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10898#(<= ~counter~0 0)} is VALID [2022-04-14 15:12:21,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {10898#(<= ~counter~0 0)} assume true; {10898#(<= ~counter~0 0)} is VALID [2022-04-14 15:12:21,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10898#(<= ~counter~0 0)} {10890#true} #81#return; {10898#(<= ~counter~0 0)} is VALID [2022-04-14 15:12:21,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {10898#(<= ~counter~0 0)} call #t~ret6 := main(); {10898#(<= ~counter~0 0)} is VALID [2022-04-14 15:12:21,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {10898#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {10898#(<= ~counter~0 0)} is VALID [2022-04-14 15:12:21,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {10898#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {10914#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,786 INFO L272 TraceCheckUtils]: 8: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {10914#(<= ~counter~0 1)} ~cond := #in~cond; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {10914#(<= ~counter~0 1)} assume !(0 == ~cond); {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {10914#(<= ~counter~0 1)} assume true; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,787 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10914#(<= ~counter~0 1)} {10914#(<= ~counter~0 1)} #59#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,788 INFO L272 TraceCheckUtils]: 13: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {10914#(<= ~counter~0 1)} ~cond := #in~cond; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {10914#(<= ~counter~0 1)} assume !(0 == ~cond); {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {10914#(<= ~counter~0 1)} assume true; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,789 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10914#(<= ~counter~0 1)} {10914#(<= ~counter~0 1)} #61#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,790 INFO L272 TraceCheckUtils]: 18: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {10914#(<= ~counter~0 1)} ~cond := #in~cond; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {10914#(<= ~counter~0 1)} assume !(0 == ~cond); {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {10914#(<= ~counter~0 1)} assume true; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,791 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10914#(<= ~counter~0 1)} {10914#(<= ~counter~0 1)} #63#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,792 INFO L272 TraceCheckUtils]: 23: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {10914#(<= ~counter~0 1)} ~cond := #in~cond; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {10914#(<= ~counter~0 1)} assume !(0 == ~cond); {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {10914#(<= ~counter~0 1)} assume true; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,793 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10914#(<= ~counter~0 1)} {10914#(<= ~counter~0 1)} #65#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,794 INFO L272 TraceCheckUtils]: 28: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {10914#(<= ~counter~0 1)} ~cond := #in~cond; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {10914#(<= ~counter~0 1)} assume !(0 == ~cond); {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,795 INFO L290 TraceCheckUtils]: 31: Hoare triple {10914#(<= ~counter~0 1)} assume true; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,795 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10914#(<= ~counter~0 1)} {10914#(<= ~counter~0 1)} #67#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,795 INFO L290 TraceCheckUtils]: 33: Hoare triple {10914#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:21,796 INFO L290 TraceCheckUtils]: 34: Hoare triple {10914#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,796 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,797 INFO L272 TraceCheckUtils]: 36: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {10999#(<= ~counter~0 2)} ~cond := #in~cond; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {10999#(<= ~counter~0 2)} assume !(0 == ~cond); {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,797 INFO L290 TraceCheckUtils]: 39: Hoare triple {10999#(<= ~counter~0 2)} assume true; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,798 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10999#(<= ~counter~0 2)} {10999#(<= ~counter~0 2)} #59#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,798 INFO L272 TraceCheckUtils]: 41: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,799 INFO L290 TraceCheckUtils]: 42: Hoare triple {10999#(<= ~counter~0 2)} ~cond := #in~cond; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,799 INFO L290 TraceCheckUtils]: 43: Hoare triple {10999#(<= ~counter~0 2)} assume !(0 == ~cond); {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,799 INFO L290 TraceCheckUtils]: 44: Hoare triple {10999#(<= ~counter~0 2)} assume true; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,800 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10999#(<= ~counter~0 2)} {10999#(<= ~counter~0 2)} #61#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,800 INFO L272 TraceCheckUtils]: 46: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,800 INFO L290 TraceCheckUtils]: 47: Hoare triple {10999#(<= ~counter~0 2)} ~cond := #in~cond; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,800 INFO L290 TraceCheckUtils]: 48: Hoare triple {10999#(<= ~counter~0 2)} assume !(0 == ~cond); {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {10999#(<= ~counter~0 2)} assume true; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,801 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10999#(<= ~counter~0 2)} {10999#(<= ~counter~0 2)} #63#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,802 INFO L272 TraceCheckUtils]: 51: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,802 INFO L290 TraceCheckUtils]: 52: Hoare triple {10999#(<= ~counter~0 2)} ~cond := #in~cond; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,802 INFO L290 TraceCheckUtils]: 53: Hoare triple {10999#(<= ~counter~0 2)} assume !(0 == ~cond); {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,803 INFO L290 TraceCheckUtils]: 54: Hoare triple {10999#(<= ~counter~0 2)} assume true; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,803 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10999#(<= ~counter~0 2)} {10999#(<= ~counter~0 2)} #65#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,803 INFO L272 TraceCheckUtils]: 56: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,804 INFO L290 TraceCheckUtils]: 57: Hoare triple {10999#(<= ~counter~0 2)} ~cond := #in~cond; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,804 INFO L290 TraceCheckUtils]: 58: Hoare triple {10999#(<= ~counter~0 2)} assume !(0 == ~cond); {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,804 INFO L290 TraceCheckUtils]: 59: Hoare triple {10999#(<= ~counter~0 2)} assume true; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,805 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10999#(<= ~counter~0 2)} {10999#(<= ~counter~0 2)} #67#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,805 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:21,806 INFO L290 TraceCheckUtils]: 62: Hoare triple {10999#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,806 INFO L290 TraceCheckUtils]: 63: Hoare triple {11084#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,806 INFO L272 TraceCheckUtils]: 64: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,807 INFO L290 TraceCheckUtils]: 65: Hoare triple {11084#(<= ~counter~0 3)} ~cond := #in~cond; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,807 INFO L290 TraceCheckUtils]: 66: Hoare triple {11084#(<= ~counter~0 3)} assume !(0 == ~cond); {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,807 INFO L290 TraceCheckUtils]: 67: Hoare triple {11084#(<= ~counter~0 3)} assume true; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,808 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11084#(<= ~counter~0 3)} {11084#(<= ~counter~0 3)} #59#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,808 INFO L272 TraceCheckUtils]: 69: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,808 INFO L290 TraceCheckUtils]: 70: Hoare triple {11084#(<= ~counter~0 3)} ~cond := #in~cond; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,808 INFO L290 TraceCheckUtils]: 71: Hoare triple {11084#(<= ~counter~0 3)} assume !(0 == ~cond); {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,809 INFO L290 TraceCheckUtils]: 72: Hoare triple {11084#(<= ~counter~0 3)} assume true; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,809 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11084#(<= ~counter~0 3)} {11084#(<= ~counter~0 3)} #61#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,810 INFO L272 TraceCheckUtils]: 74: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,810 INFO L290 TraceCheckUtils]: 75: Hoare triple {11084#(<= ~counter~0 3)} ~cond := #in~cond; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,810 INFO L290 TraceCheckUtils]: 76: Hoare triple {11084#(<= ~counter~0 3)} assume !(0 == ~cond); {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,810 INFO L290 TraceCheckUtils]: 77: Hoare triple {11084#(<= ~counter~0 3)} assume true; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,811 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {11084#(<= ~counter~0 3)} {11084#(<= ~counter~0 3)} #63#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,811 INFO L272 TraceCheckUtils]: 79: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,812 INFO L290 TraceCheckUtils]: 80: Hoare triple {11084#(<= ~counter~0 3)} ~cond := #in~cond; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,812 INFO L290 TraceCheckUtils]: 81: Hoare triple {11084#(<= ~counter~0 3)} assume !(0 == ~cond); {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,812 INFO L290 TraceCheckUtils]: 82: Hoare triple {11084#(<= ~counter~0 3)} assume true; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,813 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {11084#(<= ~counter~0 3)} {11084#(<= ~counter~0 3)} #65#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,813 INFO L272 TraceCheckUtils]: 84: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,813 INFO L290 TraceCheckUtils]: 85: Hoare triple {11084#(<= ~counter~0 3)} ~cond := #in~cond; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,814 INFO L290 TraceCheckUtils]: 86: Hoare triple {11084#(<= ~counter~0 3)} assume !(0 == ~cond); {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,814 INFO L290 TraceCheckUtils]: 87: Hoare triple {11084#(<= ~counter~0 3)} assume true; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,814 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11084#(<= ~counter~0 3)} {11084#(<= ~counter~0 3)} #67#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,815 INFO L290 TraceCheckUtils]: 89: Hoare triple {11084#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:21,815 INFO L290 TraceCheckUtils]: 90: Hoare triple {11084#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,815 INFO L290 TraceCheckUtils]: 91: Hoare triple {11169#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,816 INFO L272 TraceCheckUtils]: 92: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,816 INFO L290 TraceCheckUtils]: 93: Hoare triple {11169#(<= ~counter~0 4)} ~cond := #in~cond; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,817 INFO L290 TraceCheckUtils]: 94: Hoare triple {11169#(<= ~counter~0 4)} assume !(0 == ~cond); {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,817 INFO L290 TraceCheckUtils]: 95: Hoare triple {11169#(<= ~counter~0 4)} assume true; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,817 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {11169#(<= ~counter~0 4)} {11169#(<= ~counter~0 4)} #59#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,818 INFO L272 TraceCheckUtils]: 97: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,818 INFO L290 TraceCheckUtils]: 98: Hoare triple {11169#(<= ~counter~0 4)} ~cond := #in~cond; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,818 INFO L290 TraceCheckUtils]: 99: Hoare triple {11169#(<= ~counter~0 4)} assume !(0 == ~cond); {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,819 INFO L290 TraceCheckUtils]: 100: Hoare triple {11169#(<= ~counter~0 4)} assume true; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,819 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11169#(<= ~counter~0 4)} {11169#(<= ~counter~0 4)} #61#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,820 INFO L272 TraceCheckUtils]: 102: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,820 INFO L290 TraceCheckUtils]: 103: Hoare triple {11169#(<= ~counter~0 4)} ~cond := #in~cond; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,820 INFO L290 TraceCheckUtils]: 104: Hoare triple {11169#(<= ~counter~0 4)} assume !(0 == ~cond); {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,820 INFO L290 TraceCheckUtils]: 105: Hoare triple {11169#(<= ~counter~0 4)} assume true; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,821 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {11169#(<= ~counter~0 4)} {11169#(<= ~counter~0 4)} #63#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,821 INFO L272 TraceCheckUtils]: 107: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,821 INFO L290 TraceCheckUtils]: 108: Hoare triple {11169#(<= ~counter~0 4)} ~cond := #in~cond; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,822 INFO L290 TraceCheckUtils]: 109: Hoare triple {11169#(<= ~counter~0 4)} assume !(0 == ~cond); {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,822 INFO L290 TraceCheckUtils]: 110: Hoare triple {11169#(<= ~counter~0 4)} assume true; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,822 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {11169#(<= ~counter~0 4)} {11169#(<= ~counter~0 4)} #65#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,823 INFO L272 TraceCheckUtils]: 112: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,823 INFO L290 TraceCheckUtils]: 113: Hoare triple {11169#(<= ~counter~0 4)} ~cond := #in~cond; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,823 INFO L290 TraceCheckUtils]: 114: Hoare triple {11169#(<= ~counter~0 4)} assume !(0 == ~cond); {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,824 INFO L290 TraceCheckUtils]: 115: Hoare triple {11169#(<= ~counter~0 4)} assume true; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,824 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {11169#(<= ~counter~0 4)} {11169#(<= ~counter~0 4)} #67#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,824 INFO L290 TraceCheckUtils]: 117: Hoare triple {11169#(<= ~counter~0 4)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:21,825 INFO L290 TraceCheckUtils]: 118: Hoare triple {11169#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11254#(<= |main_#t~post5| 4)} is VALID [2022-04-14 15:12:21,825 INFO L290 TraceCheckUtils]: 119: Hoare triple {11254#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {10891#false} is VALID [2022-04-14 15:12:21,825 INFO L272 TraceCheckUtils]: 120: Hoare triple {10891#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#false} is VALID [2022-04-14 15:12:21,825 INFO L290 TraceCheckUtils]: 121: Hoare triple {10891#false} ~cond := #in~cond; {10891#false} is VALID [2022-04-14 15:12:21,825 INFO L290 TraceCheckUtils]: 122: Hoare triple {10891#false} assume !(0 == ~cond); {10891#false} is VALID [2022-04-14 15:12:21,825 INFO L290 TraceCheckUtils]: 123: Hoare triple {10891#false} assume true; {10891#false} is VALID [2022-04-14 15:12:21,825 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {10891#false} {10891#false} #69#return; {10891#false} is VALID [2022-04-14 15:12:21,825 INFO L272 TraceCheckUtils]: 125: Hoare triple {10891#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10891#false} is VALID [2022-04-14 15:12:21,825 INFO L290 TraceCheckUtils]: 126: Hoare triple {10891#false} ~cond := #in~cond; {10891#false} is VALID [2022-04-14 15:12:21,825 INFO L290 TraceCheckUtils]: 127: Hoare triple {10891#false} assume 0 == ~cond; {10891#false} is VALID [2022-04-14 15:12:21,826 INFO L290 TraceCheckUtils]: 128: Hoare triple {10891#false} assume !false; {10891#false} is VALID [2022-04-14 15:12:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-04-14 15:12:21,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:12:22,289 INFO L290 TraceCheckUtils]: 128: Hoare triple {10891#false} assume !false; {10891#false} is VALID [2022-04-14 15:12:22,290 INFO L290 TraceCheckUtils]: 127: Hoare triple {10891#false} assume 0 == ~cond; {10891#false} is VALID [2022-04-14 15:12:22,290 INFO L290 TraceCheckUtils]: 126: Hoare triple {10891#false} ~cond := #in~cond; {10891#false} is VALID [2022-04-14 15:12:22,290 INFO L272 TraceCheckUtils]: 125: Hoare triple {10891#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10891#false} is VALID [2022-04-14 15:12:22,290 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {10890#true} {10891#false} #69#return; {10891#false} is VALID [2022-04-14 15:12:22,290 INFO L290 TraceCheckUtils]: 123: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-14 15:12:22,290 INFO L290 TraceCheckUtils]: 122: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-14 15:12:22,290 INFO L290 TraceCheckUtils]: 121: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-14 15:12:22,290 INFO L272 TraceCheckUtils]: 120: Hoare triple {10891#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-14 15:12:22,290 INFO L290 TraceCheckUtils]: 119: Hoare triple {11254#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {10891#false} is VALID [2022-04-14 15:12:22,291 INFO L290 TraceCheckUtils]: 118: Hoare triple {11169#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11254#(<= |main_#t~post5| 4)} is VALID [2022-04-14 15:12:22,291 INFO L290 TraceCheckUtils]: 117: Hoare triple {11169#(<= ~counter~0 4)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:22,291 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {10890#true} {11169#(<= ~counter~0 4)} #67#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:22,292 INFO L290 TraceCheckUtils]: 115: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-14 15:12:22,292 INFO L290 TraceCheckUtils]: 114: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-14 15:12:22,292 INFO L290 TraceCheckUtils]: 113: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-14 15:12:22,292 INFO L272 TraceCheckUtils]: 112: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10890#true} is VALID [2022-04-14 15:12:22,292 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {10890#true} {11169#(<= ~counter~0 4)} #65#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:22,292 INFO L290 TraceCheckUtils]: 110: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-14 15:12:22,292 INFO L290 TraceCheckUtils]: 109: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-14 15:12:22,293 INFO L290 TraceCheckUtils]: 108: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-14 15:12:22,293 INFO L272 TraceCheckUtils]: 107: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10890#true} is VALID [2022-04-14 15:12:22,293 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {10890#true} {11169#(<= ~counter~0 4)} #63#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:22,293 INFO L290 TraceCheckUtils]: 105: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-14 15:12:22,293 INFO L290 TraceCheckUtils]: 104: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-14 15:12:22,293 INFO L290 TraceCheckUtils]: 103: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-14 15:12:22,293 INFO L272 TraceCheckUtils]: 102: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-14 15:12:22,294 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10890#true} {11169#(<= ~counter~0 4)} #61#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:22,294 INFO L290 TraceCheckUtils]: 100: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-14 15:12:22,294 INFO L290 TraceCheckUtils]: 99: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-14 15:12:22,294 INFO L290 TraceCheckUtils]: 98: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-14 15:12:22,294 INFO L272 TraceCheckUtils]: 97: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10890#true} is VALID [2022-04-14 15:12:22,294 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {10890#true} {11169#(<= ~counter~0 4)} #59#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:22,295 INFO L290 TraceCheckUtils]: 95: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-14 15:12:22,295 INFO L290 TraceCheckUtils]: 94: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-14 15:12:22,295 INFO L290 TraceCheckUtils]: 93: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-14 15:12:22,295 INFO L272 TraceCheckUtils]: 92: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-14 15:12:22,295 INFO L290 TraceCheckUtils]: 91: Hoare triple {11169#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:22,296 INFO L290 TraceCheckUtils]: 90: Hoare triple {11084#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11169#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:22,296 INFO L290 TraceCheckUtils]: 89: Hoare triple {11084#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:22,296 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10890#true} {11084#(<= ~counter~0 3)} #67#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:22,296 INFO L290 TraceCheckUtils]: 87: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-14 15:12:22,297 INFO L290 TraceCheckUtils]: 86: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-14 15:12:22,297 INFO L290 TraceCheckUtils]: 85: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-14 15:12:22,297 INFO L272 TraceCheckUtils]: 84: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10890#true} is VALID [2022-04-14 15:12:22,297 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {10890#true} {11084#(<= ~counter~0 3)} #65#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:22,297 INFO L290 TraceCheckUtils]: 82: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-14 15:12:22,297 INFO L290 TraceCheckUtils]: 81: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-14 15:12:22,297 INFO L290 TraceCheckUtils]: 80: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-14 15:12:22,297 INFO L272 TraceCheckUtils]: 79: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10890#true} is VALID [2022-04-14 15:12:22,298 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10890#true} {11084#(<= ~counter~0 3)} #63#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:22,298 INFO L290 TraceCheckUtils]: 77: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-14 15:12:22,298 INFO L290 TraceCheckUtils]: 76: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-14 15:12:22,298 INFO L290 TraceCheckUtils]: 75: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-14 15:12:22,298 INFO L272 TraceCheckUtils]: 74: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-14 15:12:22,299 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10890#true} {11084#(<= ~counter~0 3)} #61#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:22,299 INFO L290 TraceCheckUtils]: 72: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-14 15:12:22,299 INFO L290 TraceCheckUtils]: 71: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-14 15:12:22,299 INFO L290 TraceCheckUtils]: 70: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-14 15:12:22,299 INFO L272 TraceCheckUtils]: 69: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10890#true} is VALID [2022-04-14 15:12:22,299 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10890#true} {11084#(<= ~counter~0 3)} #59#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:22,299 INFO L290 TraceCheckUtils]: 67: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-14 15:12:22,299 INFO L290 TraceCheckUtils]: 66: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-14 15:12:22,299 INFO L290 TraceCheckUtils]: 65: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-14 15:12:22,300 INFO L272 TraceCheckUtils]: 64: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-14 15:12:22,300 INFO L290 TraceCheckUtils]: 63: Hoare triple {11084#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:22,300 INFO L290 TraceCheckUtils]: 62: Hoare triple {10999#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11084#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:22,301 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:22,301 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10890#true} {10999#(<= ~counter~0 2)} #67#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:22,301 INFO L290 TraceCheckUtils]: 59: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-14 15:12:22,301 INFO L290 TraceCheckUtils]: 58: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-14 15:12:22,301 INFO L290 TraceCheckUtils]: 57: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-14 15:12:22,301 INFO L272 TraceCheckUtils]: 56: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10890#true} is VALID [2022-04-14 15:12:22,302 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10890#true} {10999#(<= ~counter~0 2)} #65#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:22,302 INFO L290 TraceCheckUtils]: 54: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-14 15:12:22,302 INFO L290 TraceCheckUtils]: 53: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-14 15:12:22,302 INFO L290 TraceCheckUtils]: 52: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-14 15:12:22,303 INFO L272 TraceCheckUtils]: 51: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10890#true} is VALID [2022-04-14 15:12:22,303 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10890#true} {10999#(<= ~counter~0 2)} #63#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:22,303 INFO L290 TraceCheckUtils]: 49: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-14 15:12:22,303 INFO L290 TraceCheckUtils]: 48: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-14 15:12:22,303 INFO L290 TraceCheckUtils]: 47: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-14 15:12:22,303 INFO L272 TraceCheckUtils]: 46: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-14 15:12:22,304 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10890#true} {10999#(<= ~counter~0 2)} #61#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:22,304 INFO L290 TraceCheckUtils]: 44: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-14 15:12:22,304 INFO L290 TraceCheckUtils]: 43: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-14 15:12:22,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-14 15:12:22,304 INFO L272 TraceCheckUtils]: 41: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10890#true} is VALID [2022-04-14 15:12:22,304 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10890#true} {10999#(<= ~counter~0 2)} #59#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:22,304 INFO L290 TraceCheckUtils]: 39: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-14 15:12:22,304 INFO L290 TraceCheckUtils]: 38: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-14 15:12:22,304 INFO L290 TraceCheckUtils]: 37: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-14 15:12:22,305 INFO L272 TraceCheckUtils]: 36: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-14 15:12:22,305 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:22,305 INFO L290 TraceCheckUtils]: 34: Hoare triple {10914#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10999#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:22,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {10914#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:22,306 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10890#true} {10914#(<= ~counter~0 1)} #67#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:22,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-14 15:12:22,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-14 15:12:22,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-14 15:12:22,306 INFO L272 TraceCheckUtils]: 28: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10890#true} is VALID [2022-04-14 15:12:22,307 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10890#true} {10914#(<= ~counter~0 1)} #65#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:22,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-14 15:12:22,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-14 15:12:22,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-14 15:12:22,307 INFO L272 TraceCheckUtils]: 23: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10890#true} is VALID [2022-04-14 15:12:22,307 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10890#true} {10914#(<= ~counter~0 1)} #63#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:22,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-14 15:12:22,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-14 15:12:22,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-14 15:12:22,307 INFO L272 TraceCheckUtils]: 18: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-14 15:12:22,308 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10890#true} {10914#(<= ~counter~0 1)} #61#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:22,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-14 15:12:22,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-14 15:12:22,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-14 15:12:22,308 INFO L272 TraceCheckUtils]: 13: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10890#true} is VALID [2022-04-14 15:12:22,308 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10890#true} {10914#(<= ~counter~0 1)} #59#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:22,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-14 15:12:22,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-14 15:12:22,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-14 15:12:22,309 INFO L272 TraceCheckUtils]: 8: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-14 15:12:22,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {10914#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:22,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {10898#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10914#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:22,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {10898#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {10898#(<= ~counter~0 0)} is VALID [2022-04-14 15:12:22,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {10898#(<= ~counter~0 0)} call #t~ret6 := main(); {10898#(<= ~counter~0 0)} is VALID [2022-04-14 15:12:22,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10898#(<= ~counter~0 0)} {10890#true} #81#return; {10898#(<= ~counter~0 0)} is VALID [2022-04-14 15:12:22,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {10898#(<= ~counter~0 0)} assume true; {10898#(<= ~counter~0 0)} is VALID [2022-04-14 15:12:22,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {10890#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10898#(<= ~counter~0 0)} is VALID [2022-04-14 15:12:22,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {10890#true} call ULTIMATE.init(); {10890#true} is VALID [2022-04-14 15:12:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-14 15:12:22,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:12:22,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165661562] [2022-04-14 15:12:22,312 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:12:22,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128943209] [2022-04-14 15:12:22,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128943209] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:12:22,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:12:22,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-14 15:12:22,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844076288] [2022-04-14 15:12:22,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:12:22,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 7 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (43), 6 states have call predecessors, (43), 6 states have call successors, (43) Word has length 129 [2022-04-14 15:12:51,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:12:51,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 7 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (43), 6 states have call predecessors, (43), 6 states have call successors, (43) [2022-04-14 15:12:51,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:12:51,715 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:12:51,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:12:51,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:12:51,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:12:51,716 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 7 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (43), 6 states have call predecessors, (43), 6 states have call successors, (43) [2022-04-14 15:12:52,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:52,434 INFO L93 Difference]: Finished difference Result 183 states and 188 transitions. [2022-04-14 15:12:52,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-14 15:12:52,434 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 7 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (43), 6 states have call predecessors, (43), 6 states have call successors, (43) Word has length 129 [2022-04-14 15:12:52,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:12:52,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 7 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (43), 6 states have call predecessors, (43), 6 states have call successors, (43) [2022-04-14 15:12:52,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 116 transitions. [2022-04-14 15:12:52,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 7 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (43), 6 states have call predecessors, (43), 6 states have call successors, (43) [2022-04-14 15:12:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 116 transitions. [2022-04-14 15:12:52,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 116 transitions. [2022-04-14 15:12:52,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:12:52,538 INFO L225 Difference]: With dead ends: 183 [2022-04-14 15:12:52,538 INFO L226 Difference]: Without dead ends: 168 [2022-04-14 15:12:52,539 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-14 15:12:52,539 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 12 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:12:52,539 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 165 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 15:12:52,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-04-14 15:12:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2022-04-14 15:12:52,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:12:52,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 166 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 105 states have internal predecessors, (108), 33 states have call successors, (33), 30 states have call predecessors, (33), 28 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-14 15:12:52,638 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 166 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 105 states have internal predecessors, (108), 33 states have call successors, (33), 30 states have call predecessors, (33), 28 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-14 15:12:52,638 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 166 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 105 states have internal predecessors, (108), 33 states have call successors, (33), 30 states have call predecessors, (33), 28 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-14 15:12:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:52,640 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2022-04-14 15:12:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2022-04-14 15:12:52,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:12:52,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:12:52,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 105 states have internal predecessors, (108), 33 states have call successors, (33), 30 states have call predecessors, (33), 28 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 168 states. [2022-04-14 15:12:52,641 INFO L87 Difference]: Start difference. First operand has 166 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 105 states have internal predecessors, (108), 33 states have call successors, (33), 30 states have call predecessors, (33), 28 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 168 states. [2022-04-14 15:12:52,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:52,643 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2022-04-14 15:12:52,643 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2022-04-14 15:12:52,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:12:52,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:12:52,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:12:52,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:12:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 105 states have internal predecessors, (108), 33 states have call successors, (33), 30 states have call predecessors, (33), 28 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-14 15:12:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 171 transitions. [2022-04-14 15:12:52,646 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 171 transitions. Word has length 129 [2022-04-14 15:12:52,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:12:52,646 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 171 transitions. [2022-04-14 15:12:52,646 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 7 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (43), 6 states have call predecessors, (43), 6 states have call successors, (43) [2022-04-14 15:12:52,646 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 171 transitions. [2022-04-14 15:12:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-14 15:12:52,647 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:12:52,647 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:12:52,665 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-14 15:12:52,859 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-14 15:12:52,859 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:12:52,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:12:52,860 INFO L85 PathProgramCache]: Analyzing trace with hash 173938976, now seen corresponding path program 3 times [2022-04-14 15:12:52,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:12:52,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672217492] [2022-04-14 15:12:52,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:12:52,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:12:52,877 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:12:52,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [360224118] [2022-04-14 15:12:52,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 15:12:52,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:12:52,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:12:52,878 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-14 15:12:52,886 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-14 15:12:53,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-14 15:12:53,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:12:53,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-14 15:12:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:12:53,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:12:53,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {12507#true} call ULTIMATE.init(); {12507#true} is VALID [2022-04-14 15:12:53,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {12507#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12507#true} is VALID [2022-04-14 15:12:53,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12507#true} {12507#true} #81#return; {12507#true} is VALID [2022-04-14 15:12:53,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {12507#true} call #t~ret6 := main(); {12507#true} is VALID [2022-04-14 15:12:53,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {12507#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:53,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:53,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:53,898 INFO L272 TraceCheckUtils]: 8: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,898 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12507#true} {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:53,898 INFO L272 TraceCheckUtils]: 13: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,899 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12507#true} {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:53,899 INFO L272 TraceCheckUtils]: 18: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,899 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12507#true} {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:53,899 INFO L272 TraceCheckUtils]: 23: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,900 INFO L290 TraceCheckUtils]: 26: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,900 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12507#true} {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:53,900 INFO L272 TraceCheckUtils]: 28: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,900 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12507#true} {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:53,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-14 15:12:53,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-14 15:12:53,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-14 15:12:53,901 INFO L272 TraceCheckUtils]: 36: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,901 INFO L290 TraceCheckUtils]: 37: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,901 INFO L290 TraceCheckUtils]: 38: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,901 INFO L290 TraceCheckUtils]: 39: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,902 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12507#true} {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #59#return; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-14 15:12:53,902 INFO L272 TraceCheckUtils]: 41: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,902 INFO L290 TraceCheckUtils]: 42: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,902 INFO L290 TraceCheckUtils]: 43: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,902 INFO L290 TraceCheckUtils]: 44: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,902 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12507#true} {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #61#return; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-14 15:12:53,902 INFO L272 TraceCheckUtils]: 46: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,902 INFO L290 TraceCheckUtils]: 47: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,902 INFO L290 TraceCheckUtils]: 48: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,902 INFO L290 TraceCheckUtils]: 49: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,903 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12507#true} {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #63#return; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-14 15:12:53,903 INFO L272 TraceCheckUtils]: 51: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,903 INFO L290 TraceCheckUtils]: 52: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,912 INFO L290 TraceCheckUtils]: 53: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,912 INFO L290 TraceCheckUtils]: 54: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,913 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12507#true} {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #65#return; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-14 15:12:53,913 INFO L272 TraceCheckUtils]: 56: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,913 INFO L290 TraceCheckUtils]: 57: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,913 INFO L290 TraceCheckUtils]: 58: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,913 INFO L290 TraceCheckUtils]: 59: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,913 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12507#true} {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #67#return; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-14 15:12:53,914 INFO L290 TraceCheckUtils]: 61: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:12:53,914 INFO L290 TraceCheckUtils]: 62: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:12:53,914 INFO L290 TraceCheckUtils]: 63: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} assume !!(#t~post5 < 5);havoc #t~post5; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:12:53,914 INFO L272 TraceCheckUtils]: 64: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,914 INFO L290 TraceCheckUtils]: 65: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,914 INFO L290 TraceCheckUtils]: 66: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,914 INFO L290 TraceCheckUtils]: 67: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,915 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12507#true} {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #59#return; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:12:53,915 INFO L272 TraceCheckUtils]: 69: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,915 INFO L290 TraceCheckUtils]: 70: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,915 INFO L290 TraceCheckUtils]: 71: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,915 INFO L290 TraceCheckUtils]: 72: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,915 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12507#true} {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #61#return; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:12:53,915 INFO L272 TraceCheckUtils]: 74: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,915 INFO L290 TraceCheckUtils]: 75: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,915 INFO L290 TraceCheckUtils]: 76: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,916 INFO L290 TraceCheckUtils]: 77: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,916 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {12507#true} {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #63#return; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:12:53,916 INFO L272 TraceCheckUtils]: 79: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,916 INFO L290 TraceCheckUtils]: 80: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,916 INFO L290 TraceCheckUtils]: 81: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,916 INFO L290 TraceCheckUtils]: 82: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,916 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {12507#true} {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #65#return; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:12:53,916 INFO L272 TraceCheckUtils]: 84: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,917 INFO L290 TraceCheckUtils]: 85: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,917 INFO L290 TraceCheckUtils]: 86: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,917 INFO L290 TraceCheckUtils]: 87: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,917 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {12507#true} {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #67#return; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:12:53,917 INFO L290 TraceCheckUtils]: 89: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-14 15:12:53,918 INFO L290 TraceCheckUtils]: 90: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-14 15:12:53,918 INFO L290 TraceCheckUtils]: 91: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} assume !!(#t~post5 < 5);havoc #t~post5; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-14 15:12:53,918 INFO L272 TraceCheckUtils]: 92: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,918 INFO L290 TraceCheckUtils]: 93: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,918 INFO L290 TraceCheckUtils]: 94: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,918 INFO L290 TraceCheckUtils]: 95: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,918 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {12507#true} {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #59#return; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-14 15:12:53,918 INFO L272 TraceCheckUtils]: 97: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,919 INFO L290 TraceCheckUtils]: 98: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,919 INFO L290 TraceCheckUtils]: 99: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,919 INFO L290 TraceCheckUtils]: 100: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,919 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {12507#true} {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #61#return; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-14 15:12:53,919 INFO L272 TraceCheckUtils]: 102: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,919 INFO L290 TraceCheckUtils]: 103: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,919 INFO L290 TraceCheckUtils]: 104: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,919 INFO L290 TraceCheckUtils]: 105: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,920 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {12507#true} {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #63#return; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-14 15:12:53,920 INFO L272 TraceCheckUtils]: 107: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,920 INFO L290 TraceCheckUtils]: 108: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,920 INFO L290 TraceCheckUtils]: 109: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,920 INFO L290 TraceCheckUtils]: 110: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,920 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {12507#true} {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #65#return; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-14 15:12:53,920 INFO L272 TraceCheckUtils]: 112: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,920 INFO L290 TraceCheckUtils]: 113: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,920 INFO L290 TraceCheckUtils]: 114: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,920 INFO L290 TraceCheckUtils]: 115: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,921 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {12507#true} {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #67#return; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-14 15:12:53,921 INFO L290 TraceCheckUtils]: 117: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} assume !(~n~0 <= ~a~0); {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-14 15:12:53,938 INFO L272 TraceCheckUtils]: 118: Hoare triple {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,938 INFO L290 TraceCheckUtils]: 119: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,938 INFO L290 TraceCheckUtils]: 120: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,938 INFO L290 TraceCheckUtils]: 121: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,939 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {12507#true} {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} #69#return; {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-14 15:12:53,939 INFO L272 TraceCheckUtils]: 123: Hoare triple {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {12507#true} is VALID [2022-04-14 15:12:53,939 INFO L290 TraceCheckUtils]: 124: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-14 15:12:53,939 INFO L290 TraceCheckUtils]: 125: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-14 15:12:53,939 INFO L290 TraceCheckUtils]: 126: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-14 15:12:53,939 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {12507#true} {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} #71#return; {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-14 15:12:53,940 INFO L272 TraceCheckUtils]: 128: Hoare triple {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {12901#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:12:53,940 INFO L290 TraceCheckUtils]: 129: Hoare triple {12901#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12905#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:53,940 INFO L290 TraceCheckUtils]: 130: Hoare triple {12905#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12508#false} is VALID [2022-04-14 15:12:53,940 INFO L290 TraceCheckUtils]: 131: Hoare triple {12508#false} assume !false; {12508#false} is VALID [2022-04-14 15:12:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-14 15:12:53,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:13:01,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:13:01,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672217492] [2022-04-14 15:13:01,273 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:13:01,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360224118] [2022-04-14 15:13:01,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360224118] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:13:01,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:13:01,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-14 15:13:01,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517724986] [2022-04-14 15:13:01,274 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:13:01,274 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 132 [2022-04-14 15:13:01,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:13:01,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-14 15:13:01,350 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-14 15:13:01,351 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 15:13:01,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:13:01,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 15:13:01,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-14 15:13:01,351 INFO L87 Difference]: Start difference. First operand 166 states and 171 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-14 15:13:02,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:02,322 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2022-04-14 15:13:02,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 15:13:02,322 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 132 [2022-04-14 15:13:02,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:13:02,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-14 15:13:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-14 15:13:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-14 15:13:02,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-14 15:13:02,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-14 15:13:02,419 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-14 15:13:02,421 INFO L225 Difference]: With dead ends: 168 [2022-04-14 15:13:02,421 INFO L226 Difference]: Without dead ends: 157 [2022-04-14 15:13:02,421 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-14 15:13:02,422 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-14 15:13:02,422 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 234 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-14 15:13:02,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-14 15:13:02,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-04-14 15:13:02,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:13:02,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 157 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 100 states have internal predecessors, (102), 30 states have call successors, (30), 28 states have call predecessors, (30), 27 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-14 15:13:02,531 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 157 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 100 states have internal predecessors, (102), 30 states have call successors, (30), 28 states have call predecessors, (30), 27 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-14 15:13:02,531 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 157 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 100 states have internal predecessors, (102), 30 states have call successors, (30), 28 states have call predecessors, (30), 27 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-14 15:13:02,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:02,533 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2022-04-14 15:13:02,533 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2022-04-14 15:13:02,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:02,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:02,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 100 states have internal predecessors, (102), 30 states have call successors, (30), 28 states have call predecessors, (30), 27 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 157 states. [2022-04-14 15:13:02,534 INFO L87 Difference]: Start difference. First operand has 157 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 100 states have internal predecessors, (102), 30 states have call successors, (30), 28 states have call predecessors, (30), 27 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 157 states. [2022-04-14 15:13:02,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:02,536 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2022-04-14 15:13:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2022-04-14 15:13:02,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:02,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:02,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:13:02,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:13:02,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 100 states have internal predecessors, (102), 30 states have call successors, (30), 28 states have call predecessors, (30), 27 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-14 15:13:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 160 transitions. [2022-04-14 15:13:02,547 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 160 transitions. Word has length 132 [2022-04-14 15:13:02,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:13:02,547 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 160 transitions. [2022-04-14 15:13:02,547 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-14 15:13:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2022-04-14 15:13:02,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-14 15:13:02,548 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:13:02,548 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 26, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:13:02,555 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-14 15:13:02,753 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:13:02,753 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:13:02,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:13:02,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1020857049, now seen corresponding path program 3 times [2022-04-14 15:13:02,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:13:02,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501455315] [2022-04-14 15:13:02,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:13:02,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:13:02,772 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:13:02,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1178098459] [2022-04-14 15:13:02,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 15:13:02,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:13:02,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:13:02,773 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-14 15:13:02,774 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-14 15:13:03,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-14 15:13:03,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:13:03,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 15:13:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:03,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:13:06,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {13822#true} call ULTIMATE.init(); {13822#true} is VALID [2022-04-14 15:13:06,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {13822#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13822#true} is VALID [2022-04-14 15:13:06,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13822#true} {13822#true} #81#return; {13822#true} is VALID [2022-04-14 15:13:06,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {13822#true} call #t~ret6 := main(); {13822#true} is VALID [2022-04-14 15:13:06,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {13822#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {13822#true} is VALID [2022-04-14 15:13:06,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {13822#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13822#true} is VALID [2022-04-14 15:13:06,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {13822#true} assume !!(#t~post5 < 5);havoc #t~post5; {13822#true} is VALID [2022-04-14 15:13:06,701 INFO L272 TraceCheckUtils]: 8: Hoare triple {13822#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,702 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13822#true} {13822#true} #59#return; {13822#true} is VALID [2022-04-14 15:13:06,702 INFO L272 TraceCheckUtils]: 13: Hoare triple {13822#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,702 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13822#true} {13822#true} #61#return; {13822#true} is VALID [2022-04-14 15:13:06,702 INFO L272 TraceCheckUtils]: 18: Hoare triple {13822#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,702 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13822#true} {13822#true} #63#return; {13822#true} is VALID [2022-04-14 15:13:06,702 INFO L272 TraceCheckUtils]: 23: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,703 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13822#true} {13822#true} #65#return; {13822#true} is VALID [2022-04-14 15:13:06,703 INFO L272 TraceCheckUtils]: 28: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,703 INFO L290 TraceCheckUtils]: 31: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,703 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13822#true} {13822#true} #67#return; {13822#true} is VALID [2022-04-14 15:13:06,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {13822#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13822#true} is VALID [2022-04-14 15:13:06,703 INFO L290 TraceCheckUtils]: 34: Hoare triple {13822#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13822#true} is VALID [2022-04-14 15:13:06,703 INFO L290 TraceCheckUtils]: 35: Hoare triple {13822#true} assume !!(#t~post5 < 5);havoc #t~post5; {13822#true} is VALID [2022-04-14 15:13:06,703 INFO L272 TraceCheckUtils]: 36: Hoare triple {13822#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,703 INFO L290 TraceCheckUtils]: 37: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,703 INFO L290 TraceCheckUtils]: 38: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,703 INFO L290 TraceCheckUtils]: 39: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,704 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13822#true} {13822#true} #59#return; {13822#true} is VALID [2022-04-14 15:13:06,704 INFO L272 TraceCheckUtils]: 41: Hoare triple {13822#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,704 INFO L290 TraceCheckUtils]: 42: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,704 INFO L290 TraceCheckUtils]: 43: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,704 INFO L290 TraceCheckUtils]: 44: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,704 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13822#true} {13822#true} #61#return; {13822#true} is VALID [2022-04-14 15:13:06,704 INFO L272 TraceCheckUtils]: 46: Hoare triple {13822#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,704 INFO L290 TraceCheckUtils]: 47: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,704 INFO L290 TraceCheckUtils]: 48: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,705 INFO L290 TraceCheckUtils]: 49: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,705 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13822#true} {13822#true} #63#return; {13822#true} is VALID [2022-04-14 15:13:06,705 INFO L272 TraceCheckUtils]: 51: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,705 INFO L290 TraceCheckUtils]: 52: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,705 INFO L290 TraceCheckUtils]: 53: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,705 INFO L290 TraceCheckUtils]: 54: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,705 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13822#true} {13822#true} #65#return; {13822#true} is VALID [2022-04-14 15:13:06,705 INFO L272 TraceCheckUtils]: 56: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,706 INFO L290 TraceCheckUtils]: 57: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,706 INFO L290 TraceCheckUtils]: 58: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,706 INFO L290 TraceCheckUtils]: 59: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,706 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13822#true} {13822#true} #67#return; {13822#true} is VALID [2022-04-14 15:13:06,706 INFO L290 TraceCheckUtils]: 61: Hoare triple {13822#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13822#true} is VALID [2022-04-14 15:13:06,706 INFO L290 TraceCheckUtils]: 62: Hoare triple {13822#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13822#true} is VALID [2022-04-14 15:13:06,706 INFO L290 TraceCheckUtils]: 63: Hoare triple {13822#true} assume !!(#t~post5 < 5);havoc #t~post5; {13822#true} is VALID [2022-04-14 15:13:06,706 INFO L272 TraceCheckUtils]: 64: Hoare triple {13822#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,706 INFO L290 TraceCheckUtils]: 65: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,706 INFO L290 TraceCheckUtils]: 66: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,706 INFO L290 TraceCheckUtils]: 67: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,706 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13822#true} {13822#true} #59#return; {13822#true} is VALID [2022-04-14 15:13:06,706 INFO L272 TraceCheckUtils]: 69: Hoare triple {13822#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,706 INFO L290 TraceCheckUtils]: 70: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,706 INFO L290 TraceCheckUtils]: 71: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,706 INFO L290 TraceCheckUtils]: 72: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,706 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13822#true} {13822#true} #61#return; {13822#true} is VALID [2022-04-14 15:13:06,707 INFO L272 TraceCheckUtils]: 74: Hoare triple {13822#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,707 INFO L290 TraceCheckUtils]: 75: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,707 INFO L290 TraceCheckUtils]: 76: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,707 INFO L290 TraceCheckUtils]: 77: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,707 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {13822#true} {13822#true} #63#return; {13822#true} is VALID [2022-04-14 15:13:06,707 INFO L272 TraceCheckUtils]: 79: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,707 INFO L290 TraceCheckUtils]: 80: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,707 INFO L290 TraceCheckUtils]: 81: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,707 INFO L290 TraceCheckUtils]: 82: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,707 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {13822#true} {13822#true} #65#return; {13822#true} is VALID [2022-04-14 15:13:06,707 INFO L272 TraceCheckUtils]: 84: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,707 INFO L290 TraceCheckUtils]: 85: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,707 INFO L290 TraceCheckUtils]: 86: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,707 INFO L290 TraceCheckUtils]: 87: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,707 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13822#true} {13822#true} #67#return; {13822#true} is VALID [2022-04-14 15:13:06,707 INFO L290 TraceCheckUtils]: 89: Hoare triple {13822#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13822#true} is VALID [2022-04-14 15:13:06,708 INFO L290 TraceCheckUtils]: 90: Hoare triple {13822#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13822#true} is VALID [2022-04-14 15:13:06,708 INFO L290 TraceCheckUtils]: 91: Hoare triple {13822#true} assume !!(#t~post5 < 5);havoc #t~post5; {13822#true} is VALID [2022-04-14 15:13:06,708 INFO L272 TraceCheckUtils]: 92: Hoare triple {13822#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,708 INFO L290 TraceCheckUtils]: 93: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,708 INFO L290 TraceCheckUtils]: 94: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,708 INFO L290 TraceCheckUtils]: 95: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,708 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13822#true} {13822#true} #59#return; {13822#true} is VALID [2022-04-14 15:13:06,708 INFO L272 TraceCheckUtils]: 97: Hoare triple {13822#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,708 INFO L290 TraceCheckUtils]: 98: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,708 INFO L290 TraceCheckUtils]: 99: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,708 INFO L290 TraceCheckUtils]: 100: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,708 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {13822#true} {13822#true} #61#return; {13822#true} is VALID [2022-04-14 15:13:06,708 INFO L272 TraceCheckUtils]: 102: Hoare triple {13822#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,708 INFO L290 TraceCheckUtils]: 103: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,708 INFO L290 TraceCheckUtils]: 104: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,708 INFO L290 TraceCheckUtils]: 105: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,709 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {13822#true} {13822#true} #63#return; {13822#true} is VALID [2022-04-14 15:13:06,709 INFO L272 TraceCheckUtils]: 107: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,709 INFO L290 TraceCheckUtils]: 108: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,709 INFO L290 TraceCheckUtils]: 109: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,709 INFO L290 TraceCheckUtils]: 110: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,709 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {13822#true} {13822#true} #65#return; {13822#true} is VALID [2022-04-14 15:13:06,709 INFO L272 TraceCheckUtils]: 112: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,709 INFO L290 TraceCheckUtils]: 113: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,709 INFO L290 TraceCheckUtils]: 114: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,709 INFO L290 TraceCheckUtils]: 115: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,709 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {13822#true} {13822#true} #67#return; {13822#true} is VALID [2022-04-14 15:13:06,710 INFO L290 TraceCheckUtils]: 117: Hoare triple {13822#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {14178#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-14 15:13:06,710 INFO L290 TraceCheckUtils]: 118: Hoare triple {14178#(<= main_~n~0 (+ main_~a~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14178#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-14 15:13:06,710 INFO L290 TraceCheckUtils]: 119: Hoare triple {14178#(<= main_~n~0 (+ main_~a~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {14178#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-14 15:13:06,710 INFO L272 TraceCheckUtils]: 120: Hoare triple {14178#(<= main_~n~0 (+ main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,711 INFO L290 TraceCheckUtils]: 121: Hoare triple {13822#true} ~cond := #in~cond; {14191#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:13:06,711 INFO L290 TraceCheckUtils]: 122: Hoare triple {14191#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14195#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:13:06,711 INFO L290 TraceCheckUtils]: 123: Hoare triple {14195#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14195#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:13:06,712 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {14195#(not (= |__VERIFIER_assert_#in~cond| 0))} {14178#(<= main_~n~0 (+ main_~a~0 1))} #59#return; {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-14 15:13:06,712 INFO L272 TraceCheckUtils]: 125: Hoare triple {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,712 INFO L290 TraceCheckUtils]: 126: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,712 INFO L290 TraceCheckUtils]: 127: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,712 INFO L290 TraceCheckUtils]: 128: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,712 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {13822#true} {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #61#return; {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-14 15:13:06,713 INFO L272 TraceCheckUtils]: 130: Hoare triple {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,713 INFO L290 TraceCheckUtils]: 131: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,713 INFO L290 TraceCheckUtils]: 132: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,713 INFO L290 TraceCheckUtils]: 133: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,713 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {13822#true} {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #63#return; {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-14 15:13:06,713 INFO L272 TraceCheckUtils]: 135: Hoare triple {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,713 INFO L290 TraceCheckUtils]: 136: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,713 INFO L290 TraceCheckUtils]: 137: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,713 INFO L290 TraceCheckUtils]: 138: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,714 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {13822#true} {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #65#return; {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-14 15:13:06,714 INFO L272 TraceCheckUtils]: 140: Hoare triple {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,714 INFO L290 TraceCheckUtils]: 141: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,714 INFO L290 TraceCheckUtils]: 142: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,714 INFO L290 TraceCheckUtils]: 143: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,714 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {13822#true} {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #67#return; {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-14 15:13:06,715 INFO L290 TraceCheckUtils]: 145: Hoare triple {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} assume !(~n~0 <= ~a~0); {14266#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-14 15:13:06,715 INFO L272 TraceCheckUtils]: 146: Hoare triple {14266#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-14 15:13:06,715 INFO L290 TraceCheckUtils]: 147: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-14 15:13:06,715 INFO L290 TraceCheckUtils]: 148: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-14 15:13:06,730 INFO L290 TraceCheckUtils]: 149: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-14 15:13:06,731 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {13822#true} {14266#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #69#return; {14266#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-14 15:13:08,733 WARN L272 TraceCheckUtils]: 151: Hoare triple {14266#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {14285#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-14 15:13:08,733 INFO L290 TraceCheckUtils]: 152: Hoare triple {14285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:13:08,734 INFO L290 TraceCheckUtils]: 153: Hoare triple {14289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13823#false} is VALID [2022-04-14 15:13:08,734 INFO L290 TraceCheckUtils]: 154: Hoare triple {13823#false} assume !false; {13823#false} is VALID [2022-04-14 15:13:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 143 proven. 16 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2022-04-14 15:13:08,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:13:10,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:13:10,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501455315] [2022-04-14 15:13:10,836 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:13:10,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178098459] [2022-04-14 15:13:10,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178098459] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:13:10,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:13:10,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-14 15:13:10,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566132221] [2022-04-14 15:13:10,836 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:13:10,836 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 155 [2022-04-14 15:13:10,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:13:10,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-14 15:13:12,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:13:12,320 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 15:13:12,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:13:12,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 15:13:12,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=69, Unknown=1, NotChecked=0, Total=90 [2022-04-14 15:13:12,320 INFO L87 Difference]: Start difference. First operand 157 states and 160 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-14 15:13:14,496 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:13:17,161 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:13:21,665 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:13:24,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:24,626 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2022-04-14 15:13:24,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 15:13:24,626 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 155 [2022-04-14 15:13:24,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:13:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-14 15:13:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-14 15:13:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-14 15:13:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-14 15:13:24,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2022-04-14 15:13:24,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:13:24,966 INFO L225 Difference]: With dead ends: 166 [2022-04-14 15:13:24,966 INFO L226 Difference]: Without dead ends: 164 [2022-04-14 15:13:24,966 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=37, Invalid=118, Unknown=1, NotChecked=0, Total=156 [2022-04-14 15:13:24,966 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:13:24,967 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 118 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 176 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2022-04-14 15:13:24,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-14 15:13:25,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2022-04-14 15:13:25,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:13:25,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 163 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 104 states have internal predecessors, (105), 32 states have call successors, (32), 29 states have call predecessors, (32), 28 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-14 15:13:25,081 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 163 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 104 states have internal predecessors, (105), 32 states have call successors, (32), 29 states have call predecessors, (32), 28 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-14 15:13:25,082 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 163 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 104 states have internal predecessors, (105), 32 states have call successors, (32), 29 states have call predecessors, (32), 28 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-14 15:13:25,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:25,084 INFO L93 Difference]: Finished difference Result 164 states and 168 transitions. [2022-04-14 15:13:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2022-04-14 15:13:25,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:25,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:25,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 104 states have internal predecessors, (105), 32 states have call successors, (32), 29 states have call predecessors, (32), 28 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 164 states. [2022-04-14 15:13:25,084 INFO L87 Difference]: Start difference. First operand has 163 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 104 states have internal predecessors, (105), 32 states have call successors, (32), 29 states have call predecessors, (32), 28 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 164 states. [2022-04-14 15:13:25,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:25,086 INFO L93 Difference]: Finished difference Result 164 states and 168 transitions. [2022-04-14 15:13:25,086 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2022-04-14 15:13:25,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:25,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:25,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:13:25,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:13:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 104 states have internal predecessors, (105), 32 states have call successors, (32), 29 states have call predecessors, (32), 28 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-14 15:13:25,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 167 transitions. [2022-04-14 15:13:25,089 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 167 transitions. Word has length 155 [2022-04-14 15:13:25,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:13:25,089 INFO L478 AbstractCegarLoop]: Abstraction has 163 states and 167 transitions. [2022-04-14 15:13:25,089 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-14 15:13:25,089 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 167 transitions. [2022-04-14 15:13:25,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-14 15:13:25,090 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:13:25,090 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 26, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:13:25,097 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-14 15:13:25,290 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-14 15:13:25,291 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:13:25,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:13:25,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2040587668, now seen corresponding path program 3 times [2022-04-14 15:13:25,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:13:25,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194022126] [2022-04-14 15:13:25,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:13:25,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:13:25,300 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:13:25,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [233279328] [2022-04-14 15:13:25,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 15:13:25,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:13:25,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:13:25,304 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-14 15:13:25,313 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-14 15:13:25,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2022-04-14 15:13:25,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-14 15:13:25,685 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-14 15:13:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 15:13:25,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-14 15:13:25,787 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-14 15:13:25,787 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 15:13:25,799 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-14 15:13:25,989 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:13:25,991 INFO L719 BasicCegarLoop]: Path program histogram: [4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-04-14 15:13:25,993 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 15:13:26,049 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 15:13:26,049 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-14 15:13:26,049 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-14 15:13:26,049 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-14 15:13:26,049 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-14 15:13:26,049 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-14 15:13:26,049 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-14 15:13:26,049 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-14 15:13:26,049 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 15:13:26,049 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-14 15:13:26,049 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-14 15:13:26,049 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:13:26,050 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-14 15:13:26,051 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-14 15:13:26,052 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-14 15:13:26,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 03:13:26 BoogieIcfgContainer [2022-04-14 15:13:26,052 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 15:13:26,053 INFO L158 Benchmark]: Toolchain (without parser) took 125556.44ms. Allocated memory was 217.1MB in the beginning and 7.7GB in the end (delta: 7.4GB). Free memory was 159.6MB in the beginning and 5.7GB in the end (delta: -5.5GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-04-14 15:13:26,053 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 217.1MB. Free memory is still 176.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 15:13:26,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.64ms. Allocated memory was 217.1MB in the beginning and 350.2MB in the end (delta: 133.2MB). Free memory was 159.4MB in the beginning and 317.6MB in the end (delta: -158.1MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2022-04-14 15:13:26,053 INFO L158 Benchmark]: Boogie Preprocessor took 30.85ms. Allocated memory is still 350.2MB. Free memory was 317.6MB in the beginning and 316.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 15:13:26,053 INFO L158 Benchmark]: RCFGBuilder took 354.49ms. Allocated memory is still 350.2MB. Free memory was 316.0MB in the beginning and 304.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 15:13:26,053 INFO L158 Benchmark]: TraceAbstraction took 124920.62ms. Allocated memory was 350.2MB in the beginning and 7.7GB in the end (delta: 7.3GB). Free memory was 303.8MB in the beginning and 5.7GB in the end (delta: -5.4GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-04-14 15:13:26,054 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 217.1MB. Free memory is still 176.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.64ms. Allocated memory was 217.1MB in the beginning and 350.2MB in the end (delta: 133.2MB). Free memory was 159.4MB in the beginning and 317.6MB in the end (delta: -158.1MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.85ms. Allocated memory is still 350.2MB. Free memory was 317.6MB in the beginning and 316.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 354.49ms. Allocated memory is still 350.2MB. Free memory was 316.0MB in the beginning and 304.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 124920.62ms. Allocated memory was 350.2MB in the beginning and 7.7GB in the end (delta: 7.3GB). Free memory was 303.8MB in the beginning and 5.7GB in the end (delta: -5.4GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=10, counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [\old(counter)=0, a=5, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [\old(counter)=0, a=5, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=5, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=5, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=5, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=5, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=5, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=5, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [\old(counter)=0, a=5, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=5, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=5, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=5, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=5, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=5, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=5, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [\old(counter)=0, a=5, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=5, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=5, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=5, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=5, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=5, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=5, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [\old(counter)=0, a=5, counter=4, counter++=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=5, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=5, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=5, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=5, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=5, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=5, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [\old(counter)=0, a=5, counter=5, counter++=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=5, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=5, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=5, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=5, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=5, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=5, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [\old(counter)=0, a=5, counter=6, counter++=5, n=5, x=125, y=91, z=36] [L33] COND FALSE !(counter++<5) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [\old(counter)=0, a=5, counter=6, n=5, x=125, y=91, z=36] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, \old(counter)=0, counter=6] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=6] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 124.8s, OverallIterations: 19, TraceHistogramMax: 27, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 29.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 295 SdHoareTripleChecker+Valid, 12.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 239 mSDsluCounter, 2596 SdHoareTripleChecker+Invalid, 12.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1793 mSDsCounter, 332 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2463 IncrementalHoareTripleChecker+Invalid, 2797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 332 mSolverCounterUnsat, 803 mSDtfsCounter, 2463 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1822 GetRequests, 1658 SyntacticMatches, 15 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=16, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 26 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 52.7s InterpolantComputationTime, 1325 NumberOfCodeBlocks, 1115 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1616 ConstructedInterpolants, 0 QuantifiedInterpolants, 6825 SizeOfPredicates, 39 NumberOfNonLiveVariables, 2551 ConjunctsInSsa, 282 ConjunctsInUnsatCore, 25 InterpolantComputations, 6 PerfectInterpolantSequences, 7107/8066 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-14 15:13:26,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...