/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_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 15:10:24,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 15:10:24,610 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 15:10:24,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 15:10:24,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 15:10:24,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 15:10:24,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 15:10:24,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 15:10:24,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 15:10:24,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 15:10:24,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 15:10:24,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 15:10:24,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 15:10:24,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 15:10:24,656 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 15:10:24,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 15:10:24,656 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 15:10:24,657 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 15:10:24,658 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 15:10:24,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 15:10:24,659 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 15:10:24,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 15:10:24,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 15:10:24,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 15:10:24,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 15:10:24,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 15:10:24,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 15:10:24,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 15:10:24,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 15:10:24,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 15:10:24,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 15:10:24,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 15:10:24,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 15:10:24,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 15:10:24,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 15:10:24,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 15:10:24,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 15:10:24,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 15:10:24,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 15:10:24,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 15:10:24,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 15:10:24,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 15:10:24,685 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:10:24,710 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 15:10:24,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 15:10:24,711 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 15:10:24,712 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 15:10:24,713 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 15:10:24,713 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 15:10:24,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 15:10:24,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 15:10:24,713 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 15:10:24,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 15:10:24,714 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 15:10:24,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 15:10:24,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 15:10:24,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 15:10:24,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 15:10:24,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 15:10:24,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 15:10:24,716 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 15:10:24,716 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 15:10:24,716 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 15:10:24,716 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 15:10:24,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 15:10:24,717 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 15:10:24,717 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 15:10:24,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:10:24,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 15:10:24,717 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 15:10:24,717 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 15:10:24,718 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 15:10:24,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 15:10:24,718 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 15:10:24,718 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 15:10:24,718 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 15:10:24,718 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:10:24,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 15:10:24,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 15:10:24,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 15:10:24,942 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 15:10:24,942 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 15:10:24,943 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2022-04-14 15:10:25,004 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcf59d527/e73a4a175e4844778720a7e322be8f13/FLAGd4acf63e7 [2022-04-14 15:10:25,364 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 15:10:25,364 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2022-04-14 15:10:25,368 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcf59d527/e73a4a175e4844778720a7e322be8f13/FLAGd4acf63e7 [2022-04-14 15:10:25,376 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcf59d527/e73a4a175e4844778720a7e322be8f13 [2022-04-14 15:10:25,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 15:10:25,378 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 15:10:25,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 15:10:25,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 15:10:25,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 15:10:25,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:10:25" (1/1) ... [2022-04-14 15:10:25,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c96b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:25, skipping insertion in model container [2022-04-14 15:10:25,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:10:25" (1/1) ... [2022-04-14 15:10:25,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 15:10:25,416 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 15:10:25,520 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_unwindbound20.c[588,601] [2022-04-14 15:10:25,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:10:25,555 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 15:10:25,567 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_unwindbound20.c[588,601] [2022-04-14 15:10:25,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:10:25,590 INFO L208 MainTranslator]: Completed translation [2022-04-14 15:10:25,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:25 WrapperNode [2022-04-14 15:10:25,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 15:10:25,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 15:10:25,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 15:10:25,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 15:10:25,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:25" (1/1) ... [2022-04-14 15:10:25,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:25" (1/1) ... [2022-04-14 15:10:25,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:25" (1/1) ... [2022-04-14 15:10:25,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:25" (1/1) ... [2022-04-14 15:10:25,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:25" (1/1) ... [2022-04-14 15:10:25,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:25" (1/1) ... [2022-04-14 15:10:25,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:25" (1/1) ... [2022-04-14 15:10:25,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 15:10:25,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 15:10:25,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 15:10:25,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 15:10:25,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:25" (1/1) ... [2022-04-14 15:10:25,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:10:25,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:10:25,637 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:10:25,639 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:10:25,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 15:10:25,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 15:10:25,663 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 15:10:25,664 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 15:10:25,664 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 15:10:25,664 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 15:10:25,664 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 15:10:25,664 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 15:10:25,664 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 15:10:25,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 15:10:25,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-14 15:10:25,664 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 15:10:25,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 15:10:25,664 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 15:10:25,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 15:10:25,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 15:10:25,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 15:10:25,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 15:10:25,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 15:10:25,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 15:10:25,709 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 15:10:25,710 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 15:10:25,861 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 15:10:25,866 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 15:10:25,867 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 15:10:25,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:10:25 BoogieIcfgContainer [2022-04-14 15:10:25,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 15:10:25,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 15:10:25,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 15:10:25,871 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 15:10:25,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 03:10:25" (1/3) ... [2022-04-14 15:10:25,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4d42e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:10:25, skipping insertion in model container [2022-04-14 15:10:25,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:25" (2/3) ... [2022-04-14 15:10:25,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4d42e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:10:25, skipping insertion in model container [2022-04-14 15:10:25,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:10:25" (3/3) ... [2022-04-14 15:10:25,873 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound20.c [2022-04-14 15:10:25,876 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 15:10:25,876 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 15:10:25,903 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 15:10:25,907 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:10:25,907 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 15:10:25,937 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:10:25,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-14 15:10:25,940 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:25,940 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:10:25,940 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:25,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:25,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-14 15:10:25,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:25,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645975022] [2022-04-14 15:10:25,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:25,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:26,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:10:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:26,083 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:10:26,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-14 15:10:26,083 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-14 15:10:26,085 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:10:26,085 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:10:26,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-14 15:10:26,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-14 15:10:26,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-14 15:10:26,086 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:10:26,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-14 15:10:26,086 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:10:26,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-14 15:10:26,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-14 15:10:26,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-14 15:10:26,087 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:10:26,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:26,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645975022] [2022-04-14 15:10:26,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645975022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:10:26,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:10:26,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 15:10:26,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941110672] [2022-04-14 15:10:26,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:10:26,093 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:10:26,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:26,106 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:10:26,132 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:10:26,132 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 15:10:26,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:26,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 15:10:26,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:10:26,151 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:10:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:26,337 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-14 15:10:26,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 15:10:26,337 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:10:26,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:26,338 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:10:26,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-14 15:10:26,345 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:10:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-14 15:10:26,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-14 15:10:26,439 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:10:26,445 INFO L225 Difference]: With dead ends: 57 [2022-04-14 15:10:26,445 INFO L226 Difference]: Without dead ends: 27 [2022-04-14 15:10:26,448 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:10:26,450 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:10:26,450 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.1s Time] [2022-04-14 15:10:26,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-14 15:10:26,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-14 15:10:26,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:26,472 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:10:26,473 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:10:26,473 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:10:26,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:26,476 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-14 15:10:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-14 15:10:26,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:26,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:26,477 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:10:26,478 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:10:26,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:26,481 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-14 15:10:26,481 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-14 15:10:26,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:26,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:26,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:26,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:26,482 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:10:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-14 15:10:26,485 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-14 15:10:26,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:26,485 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-14 15:10:26,485 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:10:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-14 15:10:26,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 15:10:26,486 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:26,486 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:10:26,486 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 15:10:26,486 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:26,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:26,487 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-14 15:10:26,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:26,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092294059] [2022-04-14 15:10:26,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:26,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:26,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:10:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:26,634 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:10:26,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#(= ~counter~0 0)} assume true; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:10:26,647 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232#(= ~counter~0 0)} {227#true} #81#return; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:10:26,648 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:10:26,649 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:10:26,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#(= ~counter~0 0)} assume true; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:10:26,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#(= ~counter~0 0)} {227#true} #81#return; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:10:26,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#(= ~counter~0 0)} call #t~ret6 := main(); {232#(= ~counter~0 0)} is VALID [2022-04-14 15:10:26,650 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:10:26,651 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:10:26,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#(= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {228#false} is VALID [2022-04-14 15:10:26,652 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:10:26,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2022-04-14 15:10:26,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2022-04-14 15:10:26,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-14 15:10:26,652 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:10:26,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:26,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092294059] [2022-04-14 15:10:26,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092294059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:10:26,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:10:26,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 15:10:26,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372474000] [2022-04-14 15:10:26,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:10:26,654 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:10:26,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:26,654 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:10:26,663 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:10:26,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:10:26,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:26,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:10:26,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:10:26,664 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:10:26,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:26,888 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-14 15:10:26,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 15:10:26,889 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:10:26,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:26,889 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:10:26,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-14 15:10:26,891 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:10:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-14 15:10:26,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-14 15:10:26,942 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:10:26,943 INFO L225 Difference]: With dead ends: 40 [2022-04-14 15:10:26,943 INFO L226 Difference]: Without dead ends: 28 [2022-04-14 15:10:26,944 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:10:26,945 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:10:26,945 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:10:26,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-14 15:10:26,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-14 15:10:26,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:26,949 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:10:26,949 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:10:26,949 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:10:26,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:26,951 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-14 15:10:26,951 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-14 15:10:26,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:26,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:26,952 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:10:26,952 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:10:26,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:26,954 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-14 15:10:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-14 15:10:26,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:26,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:26,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:26,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:26,955 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:10:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-14 15:10:26,956 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-14 15:10:26,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:26,956 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-14 15:10:26,957 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:10:26,957 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-14 15:10:26,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 15:10:26,957 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:26,957 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:10:26,957 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 15:10:26,957 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:26,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:26,958 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-14 15:10:26,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:26,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340954722] [2022-04-14 15:10:26,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:26,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:27,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:10:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:27,038 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:10:27,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {406#true} assume true; {406#true} is VALID [2022-04-14 15:10:27,039 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {406#true} {406#true} #81#return; {406#true} is VALID [2022-04-14 15:10:27,039 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:10:27,040 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:10:27,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {406#true} assume true; {406#true} is VALID [2022-04-14 15:10:27,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {406#true} {406#true} #81#return; {406#true} is VALID [2022-04-14 15:10:27,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {406#true} call #t~ret6 := main(); {406#true} is VALID [2022-04-14 15:10:27,041 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:10:27,041 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:10:27,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !!(#t~post5 < 20);havoc #t~post5; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-14 15:10:27,042 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:10:27,043 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:10:27,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {413#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {407#false} is VALID [2022-04-14 15:10:27,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {407#false} assume !false; {407#false} is VALID [2022-04-14 15:10:27,044 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:10:27,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:27,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340954722] [2022-04-14 15:10:27,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340954722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:10:27,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:10:27,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 15:10:27,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245026711] [2022-04-14 15:10:27,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:10:27,047 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:10:27,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:27,048 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:10:27,057 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:10:27,057 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 15:10:27,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:27,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 15:10:27,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 15:10:27,061 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:10:27,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:27,369 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-14 15:10:27,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 15:10:27,370 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:10:27,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:27,370 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:10:27,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-14 15:10:27,371 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:10:27,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-14 15:10:27,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-14 15:10:27,432 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:10:27,433 INFO L225 Difference]: With dead ends: 34 [2022-04-14 15:10:27,433 INFO L226 Difference]: Without dead ends: 32 [2022-04-14 15:10:27,434 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:10:27,434 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:10:27,438 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:10:27,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-14 15:10:27,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-14 15:10:27,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:27,449 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:10:27,450 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:10:27,450 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:10:27,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:27,452 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-14 15:10:27,452 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 15:10:27,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:27,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:27,453 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:10:27,453 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:10:27,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:27,455 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-14 15:10:27,455 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 15:10:27,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:27,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:27,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:27,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:27,456 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:10:27,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-14 15:10:27,457 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-14 15:10:27,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:27,458 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-14 15:10:27,458 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:10:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 15:10:27,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-14 15:10:27,458 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:27,459 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:10:27,459 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 15:10:27,459 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:27,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:27,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-14 15:10:27,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:27,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953282542] [2022-04-14 15:10:27,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:27,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:27,470 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:10:27,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [588629933] [2022-04-14 15:10:27,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:27,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:27,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:10:27,472 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:10:27,509 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:10:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:27,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:10:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:27,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:10:27,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {593#true} is VALID [2022-04-14 15:10:27,651 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:10:27,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-14 15:10:27,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {593#true} {593#true} #81#return; {593#true} is VALID [2022-04-14 15:10:27,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {593#true} call #t~ret6 := main(); {593#true} is VALID [2022-04-14 15:10:27,666 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:10:27,666 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:10:27,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:10:27,667 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:10:27,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {593#true} ~cond := #in~cond; {593#true} is VALID [2022-04-14 15:10:27,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {593#true} assume !(0 == ~cond); {593#true} is VALID [2022-04-14 15:10:27,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-14 15:10:27,668 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:10:27,669 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:10:27,669 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:10:27,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {594#false} is VALID [2022-04-14 15:10:27,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-14 15:10:27,670 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:10:27,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:10:27,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:27,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953282542] [2022-04-14 15:10:27,670 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:10:27,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588629933] [2022-04-14 15:10:27,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588629933] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:10:27,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:10:27,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:10:27,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875373636] [2022-04-14 15:10:27,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:10:27,672 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:10:27,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:27,672 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:10:27,685 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:10:27,685 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:10:27,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:27,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:10:27,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:10:27,686 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:10:30,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:30,541 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-14 15:10:30,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:10:30,542 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:10:30,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:30,542 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:10:30,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:10:30,543 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:10:30,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:10:30,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-14 15:10:30,597 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:10:30,598 INFO L225 Difference]: With dead ends: 50 [2022-04-14 15:10:30,598 INFO L226 Difference]: Without dead ends: 48 [2022-04-14 15:10:30,599 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:10:30,599 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:10:30,600 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.1s Time] [2022-04-14 15:10:30,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-14 15:10:30,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-14 15:10:30,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:30,606 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:10:30,606 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:10:30,606 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:10:30,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:30,608 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-14 15:10:30,609 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-14 15:10:30,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:30,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:30,610 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:10:30,610 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:10:30,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:30,612 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-14 15:10:30,612 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-14 15:10:30,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:30,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:30,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:30,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:30,613 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:10:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-14 15:10:30,615 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-14 15:10:30,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:30,615 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-14 15:10:30,615 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:10:30,615 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-14 15:10:30,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 15:10:30,616 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:30,616 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:10:30,648 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:10:30,835 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:10:30,836 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:30,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:30,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-14 15:10:30,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:30,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108153004] [2022-04-14 15:10:30,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:30,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:30,847 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:10:30,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [175293371] [2022-04-14 15:10:30,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:30,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:30,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:10:30,848 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:10:30,849 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:10:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:30,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:10:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:30,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:10:30,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {887#true} call ULTIMATE.init(); {887#true} is VALID [2022-04-14 15:10:30,983 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:10:30,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-14 15:10:30,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {887#true} {887#true} #81#return; {887#true} is VALID [2022-04-14 15:10:30,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {887#true} call #t~ret6 := main(); {887#true} is VALID [2022-04-14 15:10:30,984 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:10:30,984 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:10:30,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-14 15:10:30,985 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:10:30,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2022-04-14 15:10:30,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2022-04-14 15:10:30,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-14 15:10:30,986 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:10:30,986 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:10:30,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2022-04-14 15:10:30,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2022-04-14 15:10:30,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-14 15:10:30,989 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:10:30,990 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:10:30,990 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:10:30,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {951#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {888#false} is VALID [2022-04-14 15:10:30,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {888#false} assume !false; {888#false} is VALID [2022-04-14 15:10:30,991 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:10:30,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:10:30,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:30,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108153004] [2022-04-14 15:10:30,991 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:10:30,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175293371] [2022-04-14 15:10:30,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175293371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:10:30,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:10:30,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:10:30,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91288104] [2022-04-14 15:10:30,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:10:30,992 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:10:30,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:30,992 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:10:31,007 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:10:31,007 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:10:31,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:31,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:10:31,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:10:31,008 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:10:31,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:31,271 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-14 15:10:31,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:10:31,271 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:10:31,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:31,272 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:10:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:10:31,273 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:10:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:10:31,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-14 15:10:31,354 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:10:31,355 INFO L225 Difference]: With dead ends: 54 [2022-04-14 15:10:31,355 INFO L226 Difference]: Without dead ends: 52 [2022-04-14 15:10:31,356 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:10:31,356 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:10:31,356 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:10:31,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-14 15:10:31,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-14 15:10:31,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:31,364 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:10:31,364 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:10:31,365 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:10:31,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:31,367 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-14 15:10:31,367 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-14 15:10:31,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:31,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:31,368 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:10:31,368 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:10:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:31,370 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-14 15:10:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-14 15:10:31,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:31,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:31,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:31,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:31,370 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:10:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-14 15:10:31,372 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-14 15:10:31,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:31,372 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-14 15:10:31,372 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:10:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-14 15:10:31,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 15:10:31,373 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:31,373 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:10:31,389 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:10:31,589 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:10:31,589 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:31,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:31,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-14 15:10:31,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:31,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999531502] [2022-04-14 15:10:31,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:31,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:31,599 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:10:31,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1333397463] [2022-04-14 15:10:31,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:31,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:31,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:10:31,600 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:10:31,601 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:10:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:31,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 15:10:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:31,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:10:31,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {1225#true} call ULTIMATE.init(); {1225#true} is VALID [2022-04-14 15:10:31,761 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:10:31,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-14 15:10:31,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1225#true} {1225#true} #81#return; {1225#true} is VALID [2022-04-14 15:10:31,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {1225#true} call #t~ret6 := main(); {1225#true} is VALID [2022-04-14 15:10:31,763 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:10:31,764 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:10:31,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:31,764 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:10:31,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-14 15:10:31,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-14 15:10:31,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-14 15:10:31,765 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:10:31,765 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:10:31,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-14 15:10:31,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-14 15:10:31,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-14 15:10:31,766 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:10:31,766 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:10:31,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-14 15:10:31,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-14 15:10:31,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-14 15:10:31,769 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:10:31,770 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:10:31,771 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:10:31,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {1304#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1226#false} is VALID [2022-04-14 15:10:31,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2022-04-14 15:10:31,772 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:10:31,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:10:31,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:31,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999531502] [2022-04-14 15:10:31,772 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:10:31,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333397463] [2022-04-14 15:10:31,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333397463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:10:31,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:10:31,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:10:31,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004684917] [2022-04-14 15:10:31,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:10:31,773 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:10:31,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:31,773 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:10:31,790 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:10:31,790 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:10:31,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:31,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:10:31,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:10:31,790 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:10:32,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:32,028 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-14 15:10:32,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:10:32,029 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:10:32,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:32,029 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:10:32,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:10:32,030 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:10:32,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:10:32,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-14 15:10:32,086 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:10:32,088 INFO L225 Difference]: With dead ends: 62 [2022-04-14 15:10:32,088 INFO L226 Difference]: Without dead ends: 50 [2022-04-14 15:10:32,088 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:10:32,089 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:10:32,089 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:10:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-14 15:10:32,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-14 15:10:32,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:32,095 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:10:32,095 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:10:32,095 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:10:32,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:32,097 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-14 15:10:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-14 15:10:32,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:32,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:32,097 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:10:32,098 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:10:32,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:32,099 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-14 15:10:32,099 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-14 15:10:32,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:32,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:32,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:32,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:32,100 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:10:32,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-14 15:10:32,101 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-14 15:10:32,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:32,101 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-14 15:10:32,101 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:10:32,101 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-14 15:10:32,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-14 15:10:32,102 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:32,102 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:10:32,118 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:10:32,318 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:10:32,319 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:32,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:32,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-14 15:10:32,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:32,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748282937] [2022-04-14 15:10:32,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:32,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:32,339 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:10:32,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1147745315] [2022-04-14 15:10:32,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:32,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:32,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:10:32,341 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:10:32,342 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:10:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:32,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:10:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:32,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:10:32,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2022-04-14 15:10:32,551 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:10:32,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {1593#(<= ~counter~0 0)} assume true; {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:10:32,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1593#(<= ~counter~0 0)} {1585#true} #81#return; {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:10:32,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {1593#(<= ~counter~0 0)} call #t~ret6 := main(); {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:10:32,553 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:10:32,553 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:10:32,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {1609#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:32,555 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:10:32,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:32,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:32,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:32,564 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:10:32,564 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:10:32,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:32,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:32,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:32,566 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:10:32,566 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:10:32,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:32,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:32,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:32,568 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:10:32,568 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:10:32,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:32,569 INFO L290 TraceCheckUtils]: 25: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:32,569 INFO L290 TraceCheckUtils]: 26: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:32,569 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:10:32,570 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:10:32,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:32,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:32,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:32,571 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:10:32,571 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:10:32,572 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:10:32,572 INFO L290 TraceCheckUtils]: 35: Hoare triple {1694#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {1586#false} is VALID [2022-04-14 15:10:32,572 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:10:32,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-14 15:10:32,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {1586#false} assume !(0 == ~cond); {1586#false} is VALID [2022-04-14 15:10:32,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {1586#false} assume true; {1586#false} is VALID [2022-04-14 15:10:32,573 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1586#false} {1586#false} #69#return; {1586#false} is VALID [2022-04-14 15:10:32,573 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:10:32,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-14 15:10:32,573 INFO L290 TraceCheckUtils]: 43: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2022-04-14 15:10:32,573 INFO L290 TraceCheckUtils]: 44: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2022-04-14 15:10:32,573 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:10:32,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:10:32,748 INFO L290 TraceCheckUtils]: 44: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2022-04-14 15:10:32,748 INFO L290 TraceCheckUtils]: 43: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2022-04-14 15:10:32,748 INFO L290 TraceCheckUtils]: 42: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-14 15:10:32,748 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:10:32,748 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1585#true} {1586#false} #69#return; {1586#false} is VALID [2022-04-14 15:10:32,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:10:32,748 INFO L290 TraceCheckUtils]: 38: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:10:32,748 INFO L290 TraceCheckUtils]: 37: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:10:32,748 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:10:32,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {1752#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {1586#false} is VALID [2022-04-14 15:10:32,749 INFO L290 TraceCheckUtils]: 34: Hoare triple {1756#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1752#(< |main_#t~post5| 20)} is VALID [2022-04-14 15:10:32,749 INFO L290 TraceCheckUtils]: 33: Hoare triple {1756#(< ~counter~0 20)} 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 20)} is VALID [2022-04-14 15:10:32,750 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1585#true} {1756#(< ~counter~0 20)} #67#return; {1756#(< ~counter~0 20)} is VALID [2022-04-14 15:10:32,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:10:32,750 INFO L290 TraceCheckUtils]: 30: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:10:32,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:10:32,750 INFO L272 TraceCheckUtils]: 28: Hoare triple {1756#(< ~counter~0 20)} 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:10:32,751 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1585#true} {1756#(< ~counter~0 20)} #65#return; {1756#(< ~counter~0 20)} is VALID [2022-04-14 15:10:32,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:10:32,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:10:32,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:10:32,751 INFO L272 TraceCheckUtils]: 23: Hoare triple {1756#(< ~counter~0 20)} 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:10:32,752 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1585#true} {1756#(< ~counter~0 20)} #63#return; {1756#(< ~counter~0 20)} is VALID [2022-04-14 15:10:32,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:10:32,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:10:32,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:10:32,752 INFO L272 TraceCheckUtils]: 18: Hoare triple {1756#(< ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-14 15:10:32,752 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1585#true} {1756#(< ~counter~0 20)} #61#return; {1756#(< ~counter~0 20)} is VALID [2022-04-14 15:10:32,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:10:32,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:10:32,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:10:32,753 INFO L272 TraceCheckUtils]: 13: Hoare triple {1756#(< ~counter~0 20)} 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:10:32,755 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1585#true} {1756#(< ~counter~0 20)} #59#return; {1756#(< ~counter~0 20)} is VALID [2022-04-14 15:10:32,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:10:32,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:10:32,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:10:32,755 INFO L272 TraceCheckUtils]: 8: Hoare triple {1756#(< ~counter~0 20)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-14 15:10:32,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {1756#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {1756#(< ~counter~0 20)} is VALID [2022-04-14 15:10:32,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {1841#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1756#(< ~counter~0 20)} is VALID [2022-04-14 15:10:32,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {1841#(< ~counter~0 19)} 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 19)} is VALID [2022-04-14 15:10:32,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {1841#(< ~counter~0 19)} call #t~ret6 := main(); {1841#(< ~counter~0 19)} is VALID [2022-04-14 15:10:32,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1841#(< ~counter~0 19)} {1585#true} #81#return; {1841#(< ~counter~0 19)} is VALID [2022-04-14 15:10:32,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {1841#(< ~counter~0 19)} assume true; {1841#(< ~counter~0 19)} is VALID [2022-04-14 15:10:32,760 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 19)} is VALID [2022-04-14 15:10:32,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2022-04-14 15:10:32,760 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:10:32,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:32,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748282937] [2022-04-14 15:10:32,760 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:10:32,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147745315] [2022-04-14 15:10:32,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147745315] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:10:32,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:10:32,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-14 15:10:32,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124722768] [2022-04-14 15:10:32,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:10:32,761 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:10:32,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:32,762 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:10:32,797 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:10:32,798 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:10:32,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:32,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:10:32,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:10:32,798 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:10:33,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:33,366 INFO L93 Difference]: Finished difference Result 120 states and 155 transitions. [2022-04-14 15:10:33,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 15:10:33,366 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:10:33,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:33,366 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:10:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2022-04-14 15:10:33,368 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:10:33,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2022-04-14 15:10:33,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 134 transitions. [2022-04-14 15:10:33,503 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:10:33,506 INFO L225 Difference]: With dead ends: 120 [2022-04-14 15:10:33,506 INFO L226 Difference]: Without dead ends: 104 [2022-04-14 15:10:33,506 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:10:33,507 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:10:33,507 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:10:33,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-14 15:10:33,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-04-14 15:10:33,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:33,546 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:10:33,546 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:10:33,546 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:10:33,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:33,551 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-14 15:10:33,551 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-14 15:10:33,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:33,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:33,552 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:10:33,552 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:10:33,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:33,556 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-14 15:10:33,556 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-14 15:10:33,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:33,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:33,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:33,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:33,558 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:10:33,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-04-14 15:10:33,562 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 45 [2022-04-14 15:10:33,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:33,562 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-04-14 15:10:33,562 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:10:33,562 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-04-14 15:10:33,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-14 15:10:33,563 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:33,563 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:10:33,586 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:10:33,784 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:10:33,784 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:33,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:33,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 1 times [2022-04-14 15:10:33,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:33,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540879175] [2022-04-14 15:10:33,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:33,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:33,794 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:10:33,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2002340577] [2022-04-14 15:10:33,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:33,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:33,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:10:33,795 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:10:33,796 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:10:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:33,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 15:10:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:33,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:10:34,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {2418#true} call ULTIMATE.init(); {2418#true} is VALID [2022-04-14 15:10:34,057 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:10:34,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:10:34,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#true} {2418#true} #81#return; {2418#true} is VALID [2022-04-14 15:10:34,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#true} call #t~ret6 := main(); {2418#true} is VALID [2022-04-14 15:10:34,057 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:10:34,058 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:10:34,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:34,059 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:10:34,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:10:34,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:10:34,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:10:34,060 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:10:34,060 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:10:34,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:10:34,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:10:34,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:10:34,060 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:10:34,060 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:10:34,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:10:34,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:10:34,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:10:34,061 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:10:34,061 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:10:34,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:10:34,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:10:34,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:10:34,062 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:10:34,062 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:10:34,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:10:34,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:10:34,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:10:34,063 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:10:34,063 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:10:34,064 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:10:34,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 15:10:34,064 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:10:34,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:10:34,064 INFO L290 TraceCheckUtils]: 38: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:10:34,064 INFO L290 TraceCheckUtils]: 39: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:10:34,065 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:10:34,065 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:10:34,066 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:10:34,070 INFO L290 TraceCheckUtils]: 43: Hoare triple {2552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2419#false} is VALID [2022-04-14 15:10:34,071 INFO L290 TraceCheckUtils]: 44: Hoare triple {2419#false} assume !false; {2419#false} is VALID [2022-04-14 15:10:34,071 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:10:34,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:10:34,263 INFO L290 TraceCheckUtils]: 44: Hoare triple {2419#false} assume !false; {2419#false} is VALID [2022-04-14 15:10:34,263 INFO L290 TraceCheckUtils]: 43: Hoare triple {2552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2419#false} is VALID [2022-04-14 15:10:34,264 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:10:34,266 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:10:34,266 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:10:34,267 INFO L290 TraceCheckUtils]: 39: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:10:34,267 INFO L290 TraceCheckUtils]: 38: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:10:34,267 INFO L290 TraceCheckUtils]: 37: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:10:34,267 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:10:34,268 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 < 20);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:10:34,270 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:10:34,287 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:10:34,288 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:10:34,288 INFO L290 TraceCheckUtils]: 31: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:10:34,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:10:34,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:10:34,288 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:10:34,289 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:10:34,289 INFO L290 TraceCheckUtils]: 26: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:10:34,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:10:34,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:10:34,289 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:10:34,289 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:10:34,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:10:34,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:10:34,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:10:34,290 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:10:34,290 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:10:34,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:10:34,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:10:34,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:10:34,290 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:10:34,291 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:10:34,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:10:34,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:10:34,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:10:34,291 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:10:34,292 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 < 20);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:10:34,292 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:10:34,293 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:10:34,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#true} call #t~ret6 := main(); {2418#true} is VALID [2022-04-14 15:10:34,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#true} {2418#true} #81#return; {2418#true} is VALID [2022-04-14 15:10:34,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:10:34,293 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:10:34,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {2418#true} call ULTIMATE.init(); {2418#true} is VALID [2022-04-14 15:10:34,293 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:10:34,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:34,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540879175] [2022-04-14 15:10:34,293 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:10:34,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002340577] [2022-04-14 15:10:34,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002340577] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:10:34,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:10:34,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 15:10:34,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421473074] [2022-04-14 15:10:34,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:10:34,294 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:10:34,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:34,295 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:10:34,338 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:10:34,338 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:10:34,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:34,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:10:34,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:10:34,339 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:10:35,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:35,175 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-14 15:10:35,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 15:10:35,175 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:10:35,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:35,176 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:10:35,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-14 15:10:35,177 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:10:35,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-14 15:10:35,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-14 15:10:35,271 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:10:35,273 INFO L225 Difference]: With dead ends: 118 [2022-04-14 15:10:35,274 INFO L226 Difference]: Without dead ends: 116 [2022-04-14 15:10:35,274 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-14 15:10:35,274 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-14 15:10:35,274 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.2s Time] [2022-04-14 15:10:35,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-14 15:10:35,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-14 15:10:35,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:35,338 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:10:35,339 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:10:35,339 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:10:35,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:35,342 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-14 15:10:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-14 15:10:35,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:35,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:35,343 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:10:35,344 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:10:35,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:35,347 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-14 15:10:35,347 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-14 15:10:35,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:35,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:35,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:35,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:35,356 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:10:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2022-04-14 15:10:35,359 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 45 [2022-04-14 15:10:35,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:35,359 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2022-04-14 15:10:35,359 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:10:35,359 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-14 15:10:35,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-14 15:10:35,361 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:35,361 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:10:35,377 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:10:35,577 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:10:35,578 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:35,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:35,578 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 2 times [2022-04-14 15:10:35,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:35,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219667037] [2022-04-14 15:10:35,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:35,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:35,592 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:10:35,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [355867538] [2022-04-14 15:10:35,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:10:35,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:35,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:10:35,621 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:10:35,663 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:10:35,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 15:10:35,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:10:35,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 15:10:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:35,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:10:35,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {3289#true} call ULTIMATE.init(); {3289#true} is VALID [2022-04-14 15:10:35,929 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:10:35,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:10:35,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3289#true} {3289#true} #81#return; {3289#true} is VALID [2022-04-14 15:10:35,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {3289#true} call #t~ret6 := main(); {3289#true} is VALID [2022-04-14 15:10:35,930 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:10:35,930 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:10:35,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:10:35,931 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:10:35,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:10:35,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:10:35,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:10:35,931 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:10:35,932 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:10:35,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:10:35,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:10:35,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:10:35,932 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:10:35,932 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:10:35,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:10:35,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:10:35,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:10:35,933 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:10:35,933 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:10:35,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:10:35,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:10:35,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:10:35,934 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:10:35,934 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:10:35,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:10:35,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:10:35,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:10:35,935 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:10:35,935 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:10:35,936 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:10:35,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-14 15:10:35,936 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:10:35,936 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:10:35,936 INFO L290 TraceCheckUtils]: 38: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:10:35,936 INFO L290 TraceCheckUtils]: 39: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:10:35,937 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:10:35,937 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:10:35,937 INFO L290 TraceCheckUtils]: 42: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:10:35,937 INFO L290 TraceCheckUtils]: 43: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:10:35,937 INFO L290 TraceCheckUtils]: 44: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:10:35,938 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:10:35,938 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:10:35,938 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:10:35,939 INFO L290 TraceCheckUtils]: 48: Hoare triple {3438#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3290#false} is VALID [2022-04-14 15:10:35,939 INFO L290 TraceCheckUtils]: 49: Hoare triple {3290#false} assume !false; {3290#false} is VALID [2022-04-14 15:10:35,939 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:10:35,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:10:36,149 INFO L290 TraceCheckUtils]: 49: Hoare triple {3290#false} assume !false; {3290#false} is VALID [2022-04-14 15:10:36,149 INFO L290 TraceCheckUtils]: 48: Hoare triple {3438#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3290#false} is VALID [2022-04-14 15:10:36,149 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:10:36,150 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:10:36,150 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:10:36,150 INFO L290 TraceCheckUtils]: 44: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:10:36,151 INFO L290 TraceCheckUtils]: 43: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:10:36,151 INFO L290 TraceCheckUtils]: 42: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:10:36,151 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:10:36,151 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:10:36,151 INFO L290 TraceCheckUtils]: 39: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:10:36,151 INFO L290 TraceCheckUtils]: 38: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:10:36,151 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:10:36,151 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:10:36,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !!(#t~post5 < 20);havoc #t~post5; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:10:36,152 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:10:36,154 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:10:36,154 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:10:36,155 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:10:36,155 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:10:36,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:10:36,155 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:10:36,155 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:10:36,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:10:36,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:10:36,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:10:36,156 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:10:36,156 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:10:36,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:10:36,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:10:36,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:10:36,156 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:10:36,157 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:10:36,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:10:36,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:10:36,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:10:36,158 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:10:36,162 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:10:36,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:10:36,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:10:36,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:10:36,163 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:10:36,163 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 < 20);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:10:36,163 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:10:36,164 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:10:36,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {3289#true} call #t~ret6 := main(); {3289#true} is VALID [2022-04-14 15:10:36,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3289#true} {3289#true} #81#return; {3289#true} is VALID [2022-04-14 15:10:36,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:10:36,164 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:10:36,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {3289#true} call ULTIMATE.init(); {3289#true} is VALID [2022-04-14 15:10:36,165 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:10:36,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:36,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219667037] [2022-04-14 15:10:36,165 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:10:36,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355867538] [2022-04-14 15:10:36,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355867538] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:10:36,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:10:36,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 15:10:36,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557846298] [2022-04-14 15:10:36,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:10:36,166 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:10:36,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:36,166 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:10:36,214 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:10:36,215 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:10:36,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:36,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:10:36,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:10:36,215 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:10:36,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:36,860 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2022-04-14 15:10:36,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 15:10:36,860 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:10:36,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:36,860 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:10:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-14 15:10:36,862 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:10:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-14 15:10:36,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-14 15:10:36,932 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:10:36,934 INFO L225 Difference]: With dead ends: 122 [2022-04-14 15:10:36,934 INFO L226 Difference]: Without dead ends: 120 [2022-04-14 15:10:36,934 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:10:36,934 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-14 15:10:36,934 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.2s Time] [2022-04-14 15:10:36,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-14 15:10:36,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-14 15:10:36,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:36,974 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:10:36,974 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:10:36,975 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:10:36,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:36,978 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-14 15:10:36,978 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-14 15:10:36,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:36,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:36,979 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:10:36,979 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:10:36,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:36,981 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-14 15:10:36,981 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-14 15:10:36,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:36,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:36,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:36,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:36,982 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:10:36,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-04-14 15:10:36,984 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 50 [2022-04-14 15:10:36,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:36,985 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-04-14 15:10:36,985 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:10:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-14 15:10:36,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-14 15:10:36,985 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:36,985 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:10:37,001 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:10:37,198 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:10:37,199 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:37,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:37,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1909341660, now seen corresponding path program 3 times [2022-04-14 15:10:37,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:37,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691372708] [2022-04-14 15:10:37,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:37,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:37,218 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:10:37,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1636740972] [2022-04-14 15:10:37,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 15:10:37,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:37,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:10:37,219 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:10:37,220 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:10:37,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-14 15:10:37,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:10:37,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-14 15:10:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:37,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:10:37,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {4204#true} call ULTIMATE.init(); {4204#true} is VALID [2022-04-14 15:10:37,530 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:10:37,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:10:37,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4204#true} {4204#true} #81#return; {4204#true} is VALID [2022-04-14 15:10:37,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {4204#true} call #t~ret6 := main(); {4204#true} is VALID [2022-04-14 15:10:37,530 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:10:37,531 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:10:37,531 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 < 20);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:10:37,531 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:10:37,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:10:37,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:10:37,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:10:37,536 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:10:37,536 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:10:37,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:10:37,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:10:37,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:10:37,537 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:10:37,537 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:10:37,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:10:37,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:10:37,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:10:37,538 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:10:37,538 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:10:37,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:10:37,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:10:37,538 INFO L290 TraceCheckUtils]: 26: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:10:37,538 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:10:37,538 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:10:37,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:10:37,539 INFO L290 TraceCheckUtils]: 30: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:10:37,539 INFO L290 TraceCheckUtils]: 31: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:10:37,539 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:10:37,540 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:10:37,540 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:10:37,540 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 < 20);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:10:37,540 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:10:37,540 INFO L290 TraceCheckUtils]: 37: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:10:37,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:10:37,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:10:37,541 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:10:37,541 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:10:37,541 INFO L290 TraceCheckUtils]: 42: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:10:37,541 INFO L290 TraceCheckUtils]: 43: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:10:37,541 INFO L290 TraceCheckUtils]: 44: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:10:37,542 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:10:37,542 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:10:37,542 INFO L290 TraceCheckUtils]: 47: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:10:37,542 INFO L290 TraceCheckUtils]: 48: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:10:37,542 INFO L290 TraceCheckUtils]: 49: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:10:37,544 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:10:37,545 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:10:37,545 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:10:37,545 INFO L290 TraceCheckUtils]: 53: Hoare triple {4368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4205#false} is VALID [2022-04-14 15:10:37,545 INFO L290 TraceCheckUtils]: 54: Hoare triple {4205#false} assume !false; {4205#false} is VALID [2022-04-14 15:10:37,546 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:10:37,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:10:37,817 INFO L290 TraceCheckUtils]: 54: Hoare triple {4205#false} assume !false; {4205#false} is VALID [2022-04-14 15:10:37,817 INFO L290 TraceCheckUtils]: 53: Hoare triple {4368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4205#false} is VALID [2022-04-14 15:10:37,818 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:10:37,819 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:10:37,819 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:10:37,819 INFO L290 TraceCheckUtils]: 49: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:10:37,819 INFO L290 TraceCheckUtils]: 48: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:10:37,819 INFO L290 TraceCheckUtils]: 47: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:10:37,819 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:10:37,820 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:10:37,820 INFO L290 TraceCheckUtils]: 44: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:10:37,820 INFO L290 TraceCheckUtils]: 43: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:10:37,820 INFO L290 TraceCheckUtils]: 42: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:10:37,820 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:10:37,821 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:10:37,821 INFO L290 TraceCheckUtils]: 39: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:10:37,821 INFO L290 TraceCheckUtils]: 38: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:10:37,821 INFO L290 TraceCheckUtils]: 37: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:10:37,821 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:10:37,821 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 < 20);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:10:37,822 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:10:37,824 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:10:37,825 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:10:37,825 INFO L290 TraceCheckUtils]: 31: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:10:37,825 INFO L290 TraceCheckUtils]: 30: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:10:37,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:10:37,825 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:10:37,826 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:10:37,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:10:37,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:10:37,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:10:37,826 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:10:37,826 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:10:37,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:10:37,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:10:37,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:10:37,827 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:10:37,827 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:10:37,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:10:37,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:10:37,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:10:37,827 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:10:37,828 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:10:37,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:10:37,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:10:37,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:10:37,828 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:10:37,828 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 < 20);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:10:37,829 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:10:37,829 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:10:37,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {4204#true} call #t~ret6 := main(); {4204#true} is VALID [2022-04-14 15:10:37,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4204#true} {4204#true} #81#return; {4204#true} is VALID [2022-04-14 15:10:37,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:10:37,830 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:10:37,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {4204#true} call ULTIMATE.init(); {4204#true} is VALID [2022-04-14 15:10:37,830 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:10:37,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:37,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691372708] [2022-04-14 15:10:37,830 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:10:37,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636740972] [2022-04-14 15:10:37,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636740972] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:10:37,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:10:37,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 15:10:37,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375959422] [2022-04-14 15:10:37,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:10:37,831 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:10:37,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:37,831 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:10:37,879 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:10:37,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:10:37,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:37,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:10:37,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:10:37,880 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:10:38,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:38,714 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2022-04-14 15:10:38,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 15:10:38,714 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:10:38,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:38,715 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:10:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-14 15:10:38,716 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:10:38,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-14 15:10:38,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-14 15:10:40,793 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:10:40,796 INFO L225 Difference]: With dead ends: 146 [2022-04-14 15:10:40,796 INFO L226 Difference]: Without dead ends: 135 [2022-04-14 15:10:40,796 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:10:40,797 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-14 15:10:40,797 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.4s Time] [2022-04-14 15:10:40,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-14 15:10:40,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-04-14 15:10:40,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:40,835 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:10:40,835 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:10:40,835 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:10:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:40,838 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-04-14 15:10:40,838 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-14 15:10:40,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:40,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:40,838 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:10:40,838 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:10:40,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:40,841 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-04-14 15:10:40,841 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-14 15:10:40,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:40,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:40,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:40,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:40,842 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:10:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-04-14 15:10:40,844 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 55 [2022-04-14 15:10:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:40,844 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-04-14 15:10:40,844 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:10:40,844 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-14 15:10:40,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-14 15:10:40,845 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:40,845 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:10:40,861 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:10:41,061 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:10:41,061 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:41,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:41,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 1 times [2022-04-14 15:10:41,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:41,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784004705] [2022-04-14 15:10:41,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:41,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:41,071 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:10:41,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1810026062] [2022-04-14 15:10:41,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:41,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:41,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:10:41,072 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:10:41,073 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:10:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:41,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-14 15:10:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:41,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:10:45,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {5223#true} call ULTIMATE.init(); {5223#true} is VALID [2022-04-14 15:10:45,288 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:10:45,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5223#true} {5223#true} #81#return; {5223#true} is VALID [2022-04-14 15:10:45,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {5223#true} call #t~ret6 := main(); {5223#true} is VALID [2022-04-14 15:10:45,290 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:10:45,291 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:10:45,291 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 < 20);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:10:45,292 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:10:45,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,292 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:10:45,292 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:10:45,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,293 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:10:45,293 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:10:45,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,294 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:10:45,294 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:10:45,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,295 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:10:45,295 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:10:45,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,295 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:10:45,296 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:10:45,296 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:10:45,297 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 < 20);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:10:45,297 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:10:45,297 INFO L290 TraceCheckUtils]: 37: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,297 INFO L290 TraceCheckUtils]: 38: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,297 INFO L290 TraceCheckUtils]: 39: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,298 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:10:45,298 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:10:45,298 INFO L290 TraceCheckUtils]: 42: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,298 INFO L290 TraceCheckUtils]: 43: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,298 INFO L290 TraceCheckUtils]: 44: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,298 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:10:45,299 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:10:45,299 INFO L290 TraceCheckUtils]: 47: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,299 INFO L290 TraceCheckUtils]: 48: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,299 INFO L290 TraceCheckUtils]: 49: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,299 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:10:45,299 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:10:45,299 INFO L290 TraceCheckUtils]: 52: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,299 INFO L290 TraceCheckUtils]: 53: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,300 INFO L290 TraceCheckUtils]: 54: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,300 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:10:45,300 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:10:45,300 INFO L290 TraceCheckUtils]: 57: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,300 INFO L290 TraceCheckUtils]: 58: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,300 INFO L290 TraceCheckUtils]: 59: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,301 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:10:45,301 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:10:45,302 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:10:45,302 INFO L290 TraceCheckUtils]: 63: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,302 INFO L290 TraceCheckUtils]: 64: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,302 INFO L290 TraceCheckUtils]: 65: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,302 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:10:45,303 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:10:45,303 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:10:45,304 INFO L290 TraceCheckUtils]: 69: Hoare triple {5436#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5224#false} is VALID [2022-04-14 15:10:45,304 INFO L290 TraceCheckUtils]: 70: Hoare triple {5224#false} assume !false; {5224#false} is VALID [2022-04-14 15:10:45,304 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:10:45,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:10:45,954 INFO L290 TraceCheckUtils]: 70: Hoare triple {5224#false} assume !false; {5224#false} is VALID [2022-04-14 15:10:45,956 INFO L290 TraceCheckUtils]: 69: Hoare triple {5436#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5224#false} is VALID [2022-04-14 15:10:45,956 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:10:45,956 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:10:45,957 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:10:45,957 INFO L290 TraceCheckUtils]: 65: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,957 INFO L290 TraceCheckUtils]: 64: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,957 INFO L290 TraceCheckUtils]: 63: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,957 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:10:45,957 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:10:45,958 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:10:45,958 INFO L290 TraceCheckUtils]: 59: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,958 INFO L290 TraceCheckUtils]: 58: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,958 INFO L290 TraceCheckUtils]: 57: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,958 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:10:45,958 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:10:45,958 INFO L290 TraceCheckUtils]: 54: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,959 INFO L290 TraceCheckUtils]: 53: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,959 INFO L290 TraceCheckUtils]: 52: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,959 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:10:45,959 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:10:45,959 INFO L290 TraceCheckUtils]: 49: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,959 INFO L290 TraceCheckUtils]: 48: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,959 INFO L290 TraceCheckUtils]: 47: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,959 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:10:45,960 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:10:45,960 INFO L290 TraceCheckUtils]: 44: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,960 INFO L290 TraceCheckUtils]: 43: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,960 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:10:45,960 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:10:45,960 INFO L290 TraceCheckUtils]: 39: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,960 INFO L290 TraceCheckUtils]: 38: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,960 INFO L290 TraceCheckUtils]: 37: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,960 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:10:45,961 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 < 20);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:10:45,961 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:10:45,963 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:10:45,964 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:10:45,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,964 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:10:45,964 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:10:45,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,965 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:10:45,965 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:10:45,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,965 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:10:45,966 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:10:45,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,967 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:10:45,967 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:10:45,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:10:45,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:10:45,967 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:10:45,968 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 < 20);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:10:45,968 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:10:45,969 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:10:45,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {5223#true} call #t~ret6 := main(); {5223#true} is VALID [2022-04-14 15:10:45,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5223#true} {5223#true} #81#return; {5223#true} is VALID [2022-04-14 15:10:45,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:10:45,969 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:10:45,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {5223#true} call ULTIMATE.init(); {5223#true} is VALID [2022-04-14 15:10:45,969 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:10:45,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:45,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784004705] [2022-04-14 15:10:45,970 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:10:45,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810026062] [2022-04-14 15:10:45,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810026062] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:10:45,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:10:45,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-14 15:10:45,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628049286] [2022-04-14 15:10:45,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:10:45,971 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:10:45,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:45,971 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:10:46,031 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:10:46,031 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 15:10:46,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:46,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 15:10:46,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:10:46,032 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:10:47,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:47,106 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2022-04-14 15:10:47,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 15:10:47,106 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:10:47,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:47,106 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:10:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-14 15:10:47,108 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:10:47,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-14 15:10:47,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 92 transitions. [2022-04-14 15:10:47,204 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:10:47,206 INFO L225 Difference]: With dead ends: 148 [2022-04-14 15:10:47,206 INFO L226 Difference]: Without dead ends: 144 [2022-04-14 15:10:47,206 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:10:47,207 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:10:47,207 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:10:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-14 15:10:47,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-04-14 15:10:47,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:47,288 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:10:47,288 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:10:47,288 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:10:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:47,291 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-04-14 15:10:47,291 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2022-04-14 15:10:47,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:47,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:47,291 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:10:47,291 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:10:47,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:47,294 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-04-14 15:10:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2022-04-14 15:10:47,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:47,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:47,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:47,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:47,294 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:10:47,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2022-04-14 15:10:47,296 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 71 [2022-04-14 15:10:47,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:47,297 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2022-04-14 15:10:47,297 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:10:47,297 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2022-04-14 15:10:47,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-14 15:10:47,298 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:47,298 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:10:47,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-14 15:10:47,510 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:10:47,510 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:47,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:47,511 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 1 times [2022-04-14 15:10:47,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:47,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341325554] [2022-04-14 15:10:47,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:47,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:47,519 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:10:47,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1478904258] [2022-04-14 15:10:47,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:47,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:47,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:10:47,524 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:10:47,525 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:10:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:47,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-14 15:10:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:47,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:10:48,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {6368#true} call ULTIMATE.init(); {6368#true} is VALID [2022-04-14 15:10:48,050 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:10:48,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:10:48,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6368#true} {6368#true} #81#return; {6368#true} is VALID [2022-04-14 15:10:48,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {6368#true} call #t~ret6 := main(); {6368#true} is VALID [2022-04-14 15:10:48,051 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:10:48,051 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:10:48,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(#t~post5 < 20);havoc #t~post5; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-14 15:10:48,052 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:10:48,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:10:48,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:10:48,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:10:48,052 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:10:48,052 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:10:48,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:10:48,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:10:48,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:10:48,053 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:10:48,053 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:10:48,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:10:48,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:10:48,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:10:48,053 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:10:48,053 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:10:48,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:10:48,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:10:48,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:10:48,054 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:10:48,054 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:10:48,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:10:48,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:10:48,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:10:48,054 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:10:48,055 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:10:48,056 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:10:48,056 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 < 20);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:10:48,056 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:10:48,056 INFO L290 TraceCheckUtils]: 37: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:10:48,056 INFO L290 TraceCheckUtils]: 38: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:10:48,056 INFO L290 TraceCheckUtils]: 39: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:10:48,056 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:10:48,057 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:10:48,057 INFO L290 TraceCheckUtils]: 42: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:10:48,057 INFO L290 TraceCheckUtils]: 43: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:10:48,057 INFO L290 TraceCheckUtils]: 44: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:10:48,057 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:10:48,057 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:10:48,057 INFO L290 TraceCheckUtils]: 47: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:10:48,057 INFO L290 TraceCheckUtils]: 48: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:10:48,057 INFO L290 TraceCheckUtils]: 49: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:10:48,058 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:10:48,058 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:10:48,058 INFO L290 TraceCheckUtils]: 52: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:10:48,058 INFO L290 TraceCheckUtils]: 53: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:10:48,058 INFO L290 TraceCheckUtils]: 54: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:10:48,058 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:10:48,058 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:10:48,058 INFO L290 TraceCheckUtils]: 57: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:10:48,059 INFO L290 TraceCheckUtils]: 58: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:10:48,059 INFO L290 TraceCheckUtils]: 59: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:10:48,059 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:10:48,059 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:10:48,059 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:10:48,060 INFO L290 TraceCheckUtils]: 63: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:10:48,060 INFO L290 TraceCheckUtils]: 64: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:10:48,060 INFO L290 TraceCheckUtils]: 65: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:10:48,060 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:10:48,060 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:10:48,060 INFO L290 TraceCheckUtils]: 68: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:10:48,060 INFO L290 TraceCheckUtils]: 69: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:10:48,060 INFO L290 TraceCheckUtils]: 70: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:10:48,061 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:10:48,076 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:10:48,076 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:10:48,077 INFO L290 TraceCheckUtils]: 74: Hoare triple {6596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6369#false} is VALID [2022-04-14 15:10:48,077 INFO L290 TraceCheckUtils]: 75: Hoare triple {6369#false} assume !false; {6369#false} is VALID [2022-04-14 15:10:48,077 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:10:48,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:10:52,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:52,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341325554] [2022-04-14 15:10:52,562 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:10:52,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478904258] [2022-04-14 15:10:52,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478904258] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:10:52,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:10:52,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-14 15:10:52,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303442589] [2022-04-14 15:10:52,563 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:10:52,565 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:10:52,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:52,565 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:10:52,624 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:10:52,625 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 15:10:52,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:52,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 15:10:52,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:10:52,626 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:10:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:53,148 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2022-04-14 15:10:53,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 15:10:53,149 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:10:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:53,149 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:10:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-14 15:10:53,150 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:10:53,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-14 15:10:53,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-14 15:10:53,213 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:10:53,215 INFO L225 Difference]: With dead ends: 143 [2022-04-14 15:10:53,215 INFO L226 Difference]: Without dead ends: 132 [2022-04-14 15:10:53,215 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:10:53,216 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:10:53,216 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:10:53,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-14 15:10:53,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-14 15:10:53,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:53,302 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:10:53,302 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:10:53,303 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:10:53,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:53,305 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-04-14 15:10:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-14 15:10:53,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:53,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:53,305 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:10:53,305 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:10:53,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:53,307 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-04-14 15:10:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-14 15:10:53,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:53,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:53,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:53,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:53,308 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:10:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2022-04-14 15:10:53,310 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 76 [2022-04-14 15:10:53,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:53,310 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2022-04-14 15:10:53,310 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:10:53,310 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-14 15:10:53,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-14 15:10:53,311 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:53,311 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:10:53,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-14 15:10:53,523 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:10:53,523 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:53,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1454229731, now seen corresponding path program 4 times [2022-04-14 15:10:53,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:53,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202738825] [2022-04-14 15:10:53,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:53,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:53,531 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:10:53,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1997099714] [2022-04-14 15:10:53,531 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-14 15:10:53,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:53,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:10:53,535 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:10:53,536 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:10:55,714 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-14 15:10:55,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:10:55,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-14 15:10:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:55,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:10:56,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-14 15:10:56,146 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:10:56,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:10:56,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #81#return; {7397#true} is VALID [2022-04-14 15:10:56,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret6 := main(); {7397#true} is VALID [2022-04-14 15:10:56,146 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:10:56,146 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:10:56,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {7397#true} assume !!(#t~post5 < 20);havoc #t~post5; {7397#true} is VALID [2022-04-14 15:10:56,146 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:10:56,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:10:56,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:10:56,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:10:56,147 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-14 15:10:56,147 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:10:56,147 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:10:56,147 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:10:56,148 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:10:56,148 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:10:56,148 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:10:56,149 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:10:56,149 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:10:56,149 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:10:56,150 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:10:56,150 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:10:56,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:10:56,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:10:56,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:10:56,150 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7397#true} {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; {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:10:56,151 INFO L272 TraceCheckUtils]: 28: 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 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-14 15:10:56,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:10:56,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:10:56,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:10:56,151 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7397#true} {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))} #67#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:10:56,156 INFO L290 TraceCheckUtils]: 33: 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))} 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; {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-14 15:10:56,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-14 15:10:56,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} assume !!(#t~post5 < 20);havoc #t~post5; {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-14 15:10:56,157 INFO L272 TraceCheckUtils]: 36: Hoare triple {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:10:56,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:10:56,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:10:56,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:10:56,158 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7397#true} {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #59#return; {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-14 15:10:56,158 INFO L272 TraceCheckUtils]: 41: Hoare triple {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~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:10:56,158 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:10:56,158 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:10:56,159 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:10:56,159 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #61#return; {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-14 15:10:56,159 INFO L272 TraceCheckUtils]: 46: Hoare triple {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~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:10:56,160 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:10:56,160 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:10:56,160 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:10:56,161 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #63#return; {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-14 15:10:56,161 INFO L272 TraceCheckUtils]: 51: Hoare triple {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~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:10:56,161 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:10:56,161 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:10:56,162 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:10:56,162 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #65#return; {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-14 15:10:56,162 INFO L272 TraceCheckUtils]: 56: Hoare triple {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~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:10:56,162 INFO L290 TraceCheckUtils]: 57: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:10:56,162 INFO L290 TraceCheckUtils]: 58: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:10:56,163 INFO L290 TraceCheckUtils]: 59: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:10:56,163 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7397#true} {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #67#return; {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-14 15:10:58,164 WARN L290 TraceCheckUtils]: 61: Hoare triple {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~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; {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is UNKNOWN [2022-04-14 15:10:58,165 INFO L290 TraceCheckUtils]: 62: Hoare triple {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-14 15:10:58,166 INFO L290 TraceCheckUtils]: 63: Hoare triple {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} assume !!(#t~post5 < 20);havoc #t~post5; {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-14 15:10:58,166 INFO L272 TraceCheckUtils]: 64: Hoare triple {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:10:58,166 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:10:58,166 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:10:58,167 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:10:58,168 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~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:10:58,168 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:10:58,168 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:10:58,168 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:10:58,168 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:10:58,169 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; {7627#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:10:58,170 INFO L272 TraceCheckUtils]: 74: Hoare triple {7627#(= (* 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)); {7631#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:10:58,170 INFO L290 TraceCheckUtils]: 75: Hoare triple {7631#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7635#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:10:58,170 INFO L290 TraceCheckUtils]: 76: Hoare triple {7635#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7398#false} is VALID [2022-04-14 15:10:58,170 INFO L290 TraceCheckUtils]: 77: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-14 15:10:58,171 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 104 proven. 43 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2022-04-14 15:10:58,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:10:58,990 INFO L290 TraceCheckUtils]: 77: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-14 15:10:58,990 INFO L290 TraceCheckUtils]: 76: Hoare triple {7635#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7398#false} is VALID [2022-04-14 15:10:58,990 INFO L290 TraceCheckUtils]: 75: Hoare triple {7631#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7635#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:10:58,991 INFO L272 TraceCheckUtils]: 74: Hoare triple {7627#(= (* 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)); {7631#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:10:58,991 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7654#(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; {7627#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:10:58,992 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:10:58,992 INFO L290 TraceCheckUtils]: 71: Hoare triple {7664#(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:10:58,992 INFO L290 TraceCheckUtils]: 70: Hoare triple {7397#true} ~cond := #in~cond; {7664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:10:58,992 INFO L272 TraceCheckUtils]: 69: Hoare triple {7654#(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:10:58,993 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7671#(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; {7654#(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:10:58,993 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:10:58,993 INFO L290 TraceCheckUtils]: 66: Hoare triple {7664#(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:10:58,994 INFO L290 TraceCheckUtils]: 65: Hoare triple {7397#true} ~cond := #in~cond; {7664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:10:58,994 INFO L272 TraceCheckUtils]: 64: Hoare triple {7671#(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:10:58,994 INFO L290 TraceCheckUtils]: 63: Hoare triple {7671#(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 < 20);havoc #t~post5; {7671#(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:10:58,994 INFO L290 TraceCheckUtils]: 62: Hoare triple {7671#(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; {7671#(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:10:59,000 INFO L290 TraceCheckUtils]: 61: Hoare triple {7671#(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; {7671#(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:10:59,001 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7397#true} {7671#(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; {7671#(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:10:59,001 INFO L290 TraceCheckUtils]: 59: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:10:59,001 INFO L290 TraceCheckUtils]: 58: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:10:59,001 INFO L290 TraceCheckUtils]: 57: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:10:59,001 INFO L272 TraceCheckUtils]: 56: Hoare triple {7671#(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:10:59,005 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7397#true} #65#return; {7671#(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:10:59,005 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:10:59,005 INFO L290 TraceCheckUtils]: 53: Hoare triple {7664#(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:10:59,006 INFO L290 TraceCheckUtils]: 52: Hoare triple {7397#true} ~cond := #in~cond; {7664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:10:59,006 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:10:59,006 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7397#true} {7397#true} #63#return; {7397#true} is VALID [2022-04-14 15:10:59,006 INFO L290 TraceCheckUtils]: 49: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:10:59,006 INFO L290 TraceCheckUtils]: 48: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:10:59,006 INFO L290 TraceCheckUtils]: 47: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:10:59,006 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:10:59,006 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7397#true} {7397#true} #61#return; {7397#true} is VALID [2022-04-14 15:10:59,006 INFO L290 TraceCheckUtils]: 44: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:10:59,006 INFO L290 TraceCheckUtils]: 43: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:10:59,006 INFO L290 TraceCheckUtils]: 42: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:10:59,006 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:10:59,006 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-14 15:10:59,006 INFO L290 TraceCheckUtils]: 39: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:10:59,006 INFO L290 TraceCheckUtils]: 38: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:10:59,007 INFO L290 TraceCheckUtils]: 37: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:10:59,007 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:10:59,007 INFO L290 TraceCheckUtils]: 35: Hoare triple {7397#true} assume !!(#t~post5 < 20);havoc #t~post5; {7397#true} is VALID [2022-04-14 15:10:59,007 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:10:59,007 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:10:59,007 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7397#true} {7397#true} #67#return; {7397#true} is VALID [2022-04-14 15:10:59,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:10:59,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:10:59,007 INFO L290 TraceCheckUtils]: 29: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:10:59,007 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:10:59,007 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7397#true} {7397#true} #65#return; {7397#true} is VALID [2022-04-14 15:10:59,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:10:59,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:10:59,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:10:59,007 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:10:59,007 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7397#true} {7397#true} #63#return; {7397#true} is VALID [2022-04-14 15:10:59,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:10:59,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:10:59,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:10:59,008 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:10:59,008 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7397#true} {7397#true} #61#return; {7397#true} is VALID [2022-04-14 15:10:59,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:10:59,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:10:59,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:10:59,008 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:10:59,008 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-14 15:10:59,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:10:59,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:10:59,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:10:59,008 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:10:59,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {7397#true} assume !!(#t~post5 < 20);havoc #t~post5; {7397#true} is VALID [2022-04-14 15:10:59,008 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:10:59,008 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:10:59,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret6 := main(); {7397#true} is VALID [2022-04-14 15:10:59,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #81#return; {7397#true} is VALID [2022-04-14 15:10:59,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:10:59,009 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:10:59,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-14 15:10:59,009 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:10:59,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:59,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202738825] [2022-04-14 15:10:59,009 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:10:59,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997099714] [2022-04-14 15:10:59,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997099714] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:10:59,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:10:59,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2022-04-14 15:10:59,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563513588] [2022-04-14 15:10:59,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:10:59,010 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) Word has length 78 [2022-04-14 15:10:59,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:59,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-14 15:10:59,087 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:10:59,088 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-14 15:10:59,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:59,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-14 15:10:59,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-14 15:10:59,088 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-14 15:10:59,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:59,740 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2022-04-14 15:10:59,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 15:10:59,741 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) Word has length 78 [2022-04-14 15:10:59,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:59,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-14 15:10:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-14 15:10:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-14 15:10:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-14 15:10:59,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-14 15:10:59,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:10:59,797 INFO L225 Difference]: With dead ends: 142 [2022-04-14 15:10:59,797 INFO L226 Difference]: Without dead ends: 138 [2022-04-14 15:10:59,797 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 138 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-14 15:10:59,797 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 23 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-14 15:10:59,798 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 88 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-14 15:10:59,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-14 15:10:59,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-04-14 15:10:59,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:59,879 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:10:59,879 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:10:59,880 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:10:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:59,882 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-04-14 15:10:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-14 15:10:59,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:59,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:59,882 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:10:59,882 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:10:59,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:59,884 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-04-14 15:10:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-14 15:10:59,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:59,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:59,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:59,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:59,885 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:10:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2022-04-14 15:10:59,887 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 78 [2022-04-14 15:10:59,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:59,887 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2022-04-14 15:10:59,887 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-14 15:10:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-14 15:10:59,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-14 15:10:59,888 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:59,888 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:10:59,900 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:11:00,097 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:11:00,097 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:00,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:00,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 2 times [2022-04-14 15:11:00,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:00,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998158738] [2022-04-14 15:11:00,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:00,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:00,114 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:00,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1216941190] [2022-04-14 15:11:00,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:11:00,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:00,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:00,115 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:11:00,116 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:11:00,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 15:11:00,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:11:00,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-14 15:11:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:00,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:00,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {8554#true} call ULTIMATE.init(); {8554#true} is VALID [2022-04-14 15:11:00,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {8554#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; {8554#true} is VALID [2022-04-14 15:11:00,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:11:00,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8554#true} {8554#true} #81#return; {8554#true} is VALID [2022-04-14 15:11:00,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {8554#true} call #t~ret6 := main(); {8554#true} is VALID [2022-04-14 15:11:00,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {8554#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; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:00,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:00,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:00,737 INFO L272 TraceCheckUtils]: 8: Hoare triple {8574#(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)); {8554#true} is VALID [2022-04-14 15:11:00,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:11:00,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:11:00,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:11:00,738 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8554#true} {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:00,738 INFO L272 TraceCheckUtils]: 13: Hoare triple {8574#(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)); {8554#true} is VALID [2022-04-14 15:11:00,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:11:00,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:11:00,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:11:00,739 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8554#true} {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:00,739 INFO L272 TraceCheckUtils]: 18: Hoare triple {8574#(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)); {8554#true} is VALID [2022-04-14 15:11:00,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:11:00,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:11:00,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:11:00,740 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8554#true} {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:00,740 INFO L272 TraceCheckUtils]: 23: Hoare triple {8574#(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)); {8554#true} is VALID [2022-04-14 15:11:00,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:11:00,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:11:00,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:11:00,741 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8554#true} {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:00,741 INFO L272 TraceCheckUtils]: 28: Hoare triple {8574#(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)); {8554#true} is VALID [2022-04-14 15:11:00,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:11:00,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:11:00,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:11:00,741 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8554#true} {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:00,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {8574#(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; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-14 15:11:00,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-14 15:11:00,743 INFO L290 TraceCheckUtils]: 35: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-14 15:11:00,743 INFO L272 TraceCheckUtils]: 36: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8554#true} is VALID [2022-04-14 15:11:00,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:11:00,743 INFO L290 TraceCheckUtils]: 38: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:11:00,743 INFO L290 TraceCheckUtils]: 39: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:11:00,743 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8554#true} {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #59#return; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-14 15:11:00,743 INFO L272 TraceCheckUtils]: 41: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8554#true} is VALID [2022-04-14 15:11:00,743 INFO L290 TraceCheckUtils]: 42: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:11:00,744 INFO L290 TraceCheckUtils]: 43: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:11:00,744 INFO L290 TraceCheckUtils]: 44: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:11:00,744 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8554#true} {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #61#return; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-14 15:11:00,744 INFO L272 TraceCheckUtils]: 46: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8554#true} is VALID [2022-04-14 15:11:00,744 INFO L290 TraceCheckUtils]: 47: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:11:00,744 INFO L290 TraceCheckUtils]: 48: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:11:00,744 INFO L290 TraceCheckUtils]: 49: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:11:00,745 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8554#true} {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #63#return; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-14 15:11:00,745 INFO L272 TraceCheckUtils]: 51: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) 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)); {8554#true} is VALID [2022-04-14 15:11:00,745 INFO L290 TraceCheckUtils]: 52: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:11:00,745 INFO L290 TraceCheckUtils]: 53: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:11:00,745 INFO L290 TraceCheckUtils]: 54: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:11:00,746 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8554#true} {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #65#return; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-14 15:11:00,746 INFO L272 TraceCheckUtils]: 56: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8554#true} is VALID [2022-04-14 15:11:00,746 INFO L290 TraceCheckUtils]: 57: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:11:00,746 INFO L290 TraceCheckUtils]: 58: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:11:00,746 INFO L290 TraceCheckUtils]: 59: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:11:00,746 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8554#true} {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #67#return; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-14 15:11:00,747 INFO L290 TraceCheckUtils]: 61: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 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; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:11:00,747 INFO L290 TraceCheckUtils]: 62: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:11:00,748 INFO L290 TraceCheckUtils]: 63: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:11:00,748 INFO L272 TraceCheckUtils]: 64: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8554#true} is VALID [2022-04-14 15:11:00,748 INFO L290 TraceCheckUtils]: 65: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:11:00,748 INFO L290 TraceCheckUtils]: 66: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:11:00,748 INFO L290 TraceCheckUtils]: 67: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:11:00,748 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8554#true} {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #59#return; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:11:00,748 INFO L272 TraceCheckUtils]: 69: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8554#true} is VALID [2022-04-14 15:11:00,748 INFO L290 TraceCheckUtils]: 70: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:11:00,749 INFO L290 TraceCheckUtils]: 71: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:11:00,749 INFO L290 TraceCheckUtils]: 72: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:11:00,749 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8554#true} {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #61#return; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:11:00,749 INFO L272 TraceCheckUtils]: 74: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8554#true} is VALID [2022-04-14 15:11:00,749 INFO L290 TraceCheckUtils]: 75: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:11:00,749 INFO L290 TraceCheckUtils]: 76: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:11:00,749 INFO L290 TraceCheckUtils]: 77: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:11:00,750 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {8554#true} {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #63#return; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:11:00,750 INFO L272 TraceCheckUtils]: 79: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 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)); {8554#true} is VALID [2022-04-14 15:11:00,750 INFO L290 TraceCheckUtils]: 80: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:11:00,750 INFO L290 TraceCheckUtils]: 81: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:11:00,750 INFO L290 TraceCheckUtils]: 82: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:11:00,751 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {8554#true} {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #65#return; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:11:00,751 INFO L272 TraceCheckUtils]: 84: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 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)); {8554#true} is VALID [2022-04-14 15:11:00,751 INFO L290 TraceCheckUtils]: 85: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:11:00,751 INFO L290 TraceCheckUtils]: 86: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:11:00,751 INFO L290 TraceCheckUtils]: 87: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:11:00,751 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {8554#true} {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #67#return; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:11:00,752 INFO L290 TraceCheckUtils]: 89: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} assume !(~n~0 <= ~a~0); {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} is VALID [2022-04-14 15:11:00,752 INFO L272 TraceCheckUtils]: 90: Hoare triple {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8554#true} is VALID [2022-04-14 15:11:00,752 INFO L290 TraceCheckUtils]: 91: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:11:00,752 INFO L290 TraceCheckUtils]: 92: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:11:00,752 INFO L290 TraceCheckUtils]: 93: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:11:00,752 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {8554#true} {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} #69#return; {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} is VALID [2022-04-14 15:11:00,753 INFO L272 TraceCheckUtils]: 95: Hoare triple {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {8554#true} is VALID [2022-04-14 15:11:00,753 INFO L290 TraceCheckUtils]: 96: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:11:00,753 INFO L290 TraceCheckUtils]: 97: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:11:00,753 INFO L290 TraceCheckUtils]: 98: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:11:00,753 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {8554#true} {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} #71#return; {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} is VALID [2022-04-14 15:11:00,754 INFO L272 TraceCheckUtils]: 100: Hoare triple {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {8863#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:00,754 INFO L290 TraceCheckUtils]: 101: Hoare triple {8863#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8867#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:00,754 INFO L290 TraceCheckUtils]: 102: Hoare triple {8867#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8555#false} is VALID [2022-04-14 15:11:00,754 INFO L290 TraceCheckUtils]: 103: Hoare triple {8555#false} assume !false; {8555#false} is VALID [2022-04-14 15:11:00,755 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:11:00,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:11:09,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:09,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998158738] [2022-04-14 15:11:09,607 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:09,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216941190] [2022-04-14 15:11:09,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216941190] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:11:09,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:11:09,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-14 15:11:09,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515652410] [2022-04-14 15:11:09,608 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:11:09,608 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:11:09,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:09,608 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:11:09,650 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:09,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:11:09,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:09,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:11:09,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-14 15:11:09,650 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:11:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:10,341 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2022-04-14 15:11:10,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 15:11:10,341 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:11:10,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:10,341 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:11:10,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-14 15:11:10,343 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:11:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-14 15:11:10,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2022-04-14 15:11:10,421 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:11:10,423 INFO L225 Difference]: With dead ends: 140 [2022-04-14 15:11:10,423 INFO L226 Difference]: Without dead ends: 129 [2022-04-14 15:11:10,423 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:11:10,423 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:11:10,424 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:11:10,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-14 15:11:10,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-14 15:11:10,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:10,506 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:11:10,506 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:11:10,506 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:11:10,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:10,508 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-14 15:11:10,508 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-14 15:11:10,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:10,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:10,511 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:11:10,511 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:11:10,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:10,513 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-14 15:11:10,513 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-14 15:11:10,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:10,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:10,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:10,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:10,514 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:11:10,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2022-04-14 15:11:10,516 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 104 [2022-04-14 15:11:10,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:10,516 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2022-04-14 15:11:10,516 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:11:10,516 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-14 15:11:10,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-14 15:11:10,518 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:10,518 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:11:10,541 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:11:10,721 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:11:10,721 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:10,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:10,721 INFO L85 PathProgramCache]: Analyzing trace with hash -813840784, now seen corresponding path program 2 times [2022-04-14 15:11:10,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:10,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432590946] [2022-04-14 15:11:10,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:10,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:10,730 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:10,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1741777700] [2022-04-14 15:11:10,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:11:10,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:10,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:10,748 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:11:10,764 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:11:10,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 15:11:10,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:11:10,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-14 15:11:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:10,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:11,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {9650#true} call ULTIMATE.init(); {9650#true} is VALID [2022-04-14 15:11:11,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {9650#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; {9650#true} is VALID [2022-04-14 15:11:11,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9650#true} {9650#true} #81#return; {9650#true} is VALID [2022-04-14 15:11:11,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {9650#true} call #t~ret6 := main(); {9650#true} is VALID [2022-04-14 15:11:11,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {9650#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; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:11,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {9670#(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; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:11,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:11,613 INFO L272 TraceCheckUtils]: 8: Hoare triple {9670#(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)); {9650#true} is VALID [2022-04-14 15:11:11,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:11:11,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:11:11,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,614 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9650#true} {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:11,614 INFO L272 TraceCheckUtils]: 13: Hoare triple {9670#(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)); {9650#true} is VALID [2022-04-14 15:11:11,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:11:11,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:11:11,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,615 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9650#true} {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:11,615 INFO L272 TraceCheckUtils]: 18: Hoare triple {9670#(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)); {9650#true} is VALID [2022-04-14 15:11:11,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:11:11,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:11:11,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,616 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9650#true} {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:11,616 INFO L272 TraceCheckUtils]: 23: Hoare triple {9670#(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)); {9650#true} is VALID [2022-04-14 15:11:11,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:11:11,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:11:11,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,616 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9650#true} {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:11,616 INFO L272 TraceCheckUtils]: 28: Hoare triple {9670#(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)); {9650#true} is VALID [2022-04-14 15:11:11,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:11:11,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:11:11,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,617 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9650#true} {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:11,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {9670#(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; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-14 15:11:11,618 INFO L290 TraceCheckUtils]: 34: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-14 15:11:11,618 INFO L290 TraceCheckUtils]: 35: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-14 15:11:11,619 INFO L272 TraceCheckUtils]: 36: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-14 15:11:11,619 INFO L290 TraceCheckUtils]: 37: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:11:11,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:11:11,619 INFO L290 TraceCheckUtils]: 39: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,619 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9650#true} {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #59#return; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-14 15:11:11,619 INFO L272 TraceCheckUtils]: 41: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9650#true} is VALID [2022-04-14 15:11:11,619 INFO L290 TraceCheckUtils]: 42: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:11:11,619 INFO L290 TraceCheckUtils]: 43: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:11:11,619 INFO L290 TraceCheckUtils]: 44: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,620 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9650#true} {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #61#return; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-14 15:11:11,620 INFO L272 TraceCheckUtils]: 46: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-14 15:11:11,620 INFO L290 TraceCheckUtils]: 47: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:11:11,620 INFO L290 TraceCheckUtils]: 48: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:11:11,620 INFO L290 TraceCheckUtils]: 49: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,621 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9650#true} {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #63#return; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-14 15:11:11,621 INFO L272 TraceCheckUtils]: 51: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~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)); {9650#true} is VALID [2022-04-14 15:11:11,621 INFO L290 TraceCheckUtils]: 52: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:11:11,621 INFO L290 TraceCheckUtils]: 53: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:11:11,621 INFO L290 TraceCheckUtils]: 54: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,621 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9650#true} {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #65#return; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-14 15:11:11,621 INFO L272 TraceCheckUtils]: 56: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9650#true} is VALID [2022-04-14 15:11:11,621 INFO L290 TraceCheckUtils]: 57: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:11:11,622 INFO L290 TraceCheckUtils]: 58: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:11:11,622 INFO L290 TraceCheckUtils]: 59: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,622 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9650#true} {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #67#return; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-14 15:11:11,623 INFO L290 TraceCheckUtils]: 61: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 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; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-14 15:11:11,623 INFO L290 TraceCheckUtils]: 62: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-14 15:11:11,623 INFO L290 TraceCheckUtils]: 63: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} assume !!(#t~post5 < 20);havoc #t~post5; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-14 15:11:11,623 INFO L272 TraceCheckUtils]: 64: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-14 15:11:11,623 INFO L290 TraceCheckUtils]: 65: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:11:11,624 INFO L290 TraceCheckUtils]: 66: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:11:11,624 INFO L290 TraceCheckUtils]: 67: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,624 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9650#true} {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #59#return; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-14 15:11:11,624 INFO L272 TraceCheckUtils]: 69: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9650#true} is VALID [2022-04-14 15:11:11,624 INFO L290 TraceCheckUtils]: 70: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:11:11,624 INFO L290 TraceCheckUtils]: 71: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:11:11,624 INFO L290 TraceCheckUtils]: 72: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,625 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9650#true} {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #61#return; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-14 15:11:11,625 INFO L272 TraceCheckUtils]: 74: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-14 15:11:11,625 INFO L290 TraceCheckUtils]: 75: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:11:11,625 INFO L290 TraceCheckUtils]: 76: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:11:11,625 INFO L290 TraceCheckUtils]: 77: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,625 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {9650#true} {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #63#return; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-14 15:11:11,626 INFO L272 TraceCheckUtils]: 79: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) 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)); {9650#true} is VALID [2022-04-14 15:11:11,626 INFO L290 TraceCheckUtils]: 80: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:11:11,626 INFO L290 TraceCheckUtils]: 81: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:11:11,626 INFO L290 TraceCheckUtils]: 82: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,626 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {9650#true} {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #65#return; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-14 15:11:11,626 INFO L272 TraceCheckUtils]: 84: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9650#true} is VALID [2022-04-14 15:11:11,626 INFO L290 TraceCheckUtils]: 85: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:11:11,626 INFO L290 TraceCheckUtils]: 86: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:11:11,626 INFO L290 TraceCheckUtils]: 87: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,627 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {9650#true} {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #67#return; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-14 15:11:11,627 INFO L290 TraceCheckUtils]: 89: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) 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; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-14 15:11:11,628 INFO L290 TraceCheckUtils]: 90: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-14 15:11:11,628 INFO L290 TraceCheckUtils]: 91: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} assume !!(#t~post5 < 20);havoc #t~post5; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-14 15:11:11,628 INFO L272 TraceCheckUtils]: 92: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-14 15:11:11,628 INFO L290 TraceCheckUtils]: 93: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:11:11,628 INFO L290 TraceCheckUtils]: 94: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:11:11,628 INFO L290 TraceCheckUtils]: 95: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,629 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {9650#true} {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} #59#return; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-14 15:11:11,629 INFO L272 TraceCheckUtils]: 97: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9650#true} is VALID [2022-04-14 15:11:11,629 INFO L290 TraceCheckUtils]: 98: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:11:11,629 INFO L290 TraceCheckUtils]: 99: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:11:11,629 INFO L290 TraceCheckUtils]: 100: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,629 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {9650#true} {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} #61#return; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-14 15:11:11,630 INFO L272 TraceCheckUtils]: 102: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-14 15:11:11,630 INFO L290 TraceCheckUtils]: 103: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:11:11,630 INFO L290 TraceCheckUtils]: 104: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:11:11,630 INFO L290 TraceCheckUtils]: 105: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,630 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {9650#true} {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} #63#return; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-14 15:11:11,630 INFO L272 TraceCheckUtils]: 107: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9650#true} is VALID [2022-04-14 15:11:11,630 INFO L290 TraceCheckUtils]: 108: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:11:11,630 INFO L290 TraceCheckUtils]: 109: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:11:11,630 INFO L290 TraceCheckUtils]: 110: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,631 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {9650#true} {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} #65#return; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-14 15:11:11,631 INFO L272 TraceCheckUtils]: 112: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9650#true} is VALID [2022-04-14 15:11:11,631 INFO L290 TraceCheckUtils]: 113: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:11:11,631 INFO L290 TraceCheckUtils]: 114: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:11:11,631 INFO L290 TraceCheckUtils]: 115: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,632 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {9650#true} {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} #67#return; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-14 15:11:11,632 INFO L290 TraceCheckUtils]: 117: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} assume !(~n~0 <= ~a~0); {10010#(and (= main_~z~0 24) (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-14 15:11:11,632 INFO L272 TraceCheckUtils]: 118: Hoare triple {10010#(and (= main_~z~0 24) (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-14 15:11:11,632 INFO L290 TraceCheckUtils]: 119: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:11:11,632 INFO L290 TraceCheckUtils]: 120: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:11:11,632 INFO L290 TraceCheckUtils]: 121: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:11:11,633 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {9650#true} {10010#(and (= main_~z~0 24) (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= main_~x~0 27))} #69#return; {10010#(and (= main_~z~0 24) (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-14 15:11:11,633 INFO L272 TraceCheckUtils]: 123: Hoare triple {10010#(and (= main_~z~0 24) (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10029#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:11,634 INFO L290 TraceCheckUtils]: 124: Hoare triple {10029#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10033#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:11,634 INFO L290 TraceCheckUtils]: 125: Hoare triple {10033#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9651#false} is VALID [2022-04-14 15:11:11,634 INFO L290 TraceCheckUtils]: 126: Hoare triple {9651#false} assume !false; {9651#false} is VALID [2022-04-14 15:11:11,635 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:11:11,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:11:11,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:11,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432590946] [2022-04-14 15:11:11,962 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:11,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741777700] [2022-04-14 15:11:11,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741777700] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:11:11,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:11:11,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-14 15:11:11,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880573831] [2022-04-14 15:11:11,963 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:11:11,963 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:11:11,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:11,963 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:11:12,019 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:12,020 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 15:11:12,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:12,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 15:11:12,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-14 15:11:12,020 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:11:12,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:12,881 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2022-04-14 15:11:12,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 15:11:12,881 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:11:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:12,881 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:11:12,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-14 15:11:12,885 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:11:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-14 15:11:12,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-14 15:11:12,982 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:11:12,983 INFO L225 Difference]: With dead ends: 152 [2022-04-14 15:11:12,984 INFO L226 Difference]: Without dead ends: 150 [2022-04-14 15:11:12,984 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:11:12,984 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:12,984 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.3s Time] [2022-04-14 15:11:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-14 15:11:13,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-04-14 15:11:13,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:13,073 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:11:13,073 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:11:13,073 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:11:13,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:13,075 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-04-14 15:11:13,075 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2022-04-14 15:11:13,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:13,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:13,076 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:11:13,076 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:11:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:13,078 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-04-14 15:11:13,078 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2022-04-14 15:11:13,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:13,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:13,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:13,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:13,079 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:11:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2022-04-14 15:11:13,081 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 127 [2022-04-14 15:11:13,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:13,082 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2022-04-14 15:11:13,082 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:11:13,082 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2022-04-14 15:11:13,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-14 15:11:13,082 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:13,083 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:11:13,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-14 15:11:13,299 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:11:13,299 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:13,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:13,299 INFO L85 PathProgramCache]: Analyzing trace with hash -167438485, now seen corresponding path program 2 times [2022-04-14 15:11:13,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:13,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241609580] [2022-04-14 15:11:13,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:13,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:13,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:13,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1299727322] [2022-04-14 15:11:13,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:11:13,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:13,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:13,312 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:11:13,315 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:11:13,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 15:11:13,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:11:13,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 15:11:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:13,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:13,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {10891#true} call ULTIMATE.init(); {10891#true} is VALID [2022-04-14 15:11:13,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {10891#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; {10899#(<= ~counter~0 0)} is VALID [2022-04-14 15:11:13,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {10899#(<= ~counter~0 0)} assume true; {10899#(<= ~counter~0 0)} is VALID [2022-04-14 15:11:13,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10899#(<= ~counter~0 0)} {10891#true} #81#return; {10899#(<= ~counter~0 0)} is VALID [2022-04-14 15:11:13,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {10899#(<= ~counter~0 0)} call #t~ret6 := main(); {10899#(<= ~counter~0 0)} is VALID [2022-04-14 15:11:13,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {10899#(<= ~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; {10899#(<= ~counter~0 0)} is VALID [2022-04-14 15:11:13,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {10899#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {10915#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,833 INFO L272 TraceCheckUtils]: 8: Hoare triple {10915#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,834 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10915#(<= ~counter~0 1)} {10915#(<= ~counter~0 1)} #59#return; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,835 INFO L272 TraceCheckUtils]: 13: Hoare triple {10915#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,836 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10915#(<= ~counter~0 1)} {10915#(<= ~counter~0 1)} #61#return; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,836 INFO L272 TraceCheckUtils]: 18: Hoare triple {10915#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,837 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10915#(<= ~counter~0 1)} {10915#(<= ~counter~0 1)} #63#return; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,837 INFO L272 TraceCheckUtils]: 23: Hoare triple {10915#(<= ~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)); {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,839 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10915#(<= ~counter~0 1)} {10915#(<= ~counter~0 1)} #65#return; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,839 INFO L272 TraceCheckUtils]: 28: Hoare triple {10915#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,840 INFO L290 TraceCheckUtils]: 31: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,840 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10915#(<= ~counter~0 1)} {10915#(<= ~counter~0 1)} #67#return; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,840 INFO L290 TraceCheckUtils]: 33: Hoare triple {10915#(<= ~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; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:13,840 INFO L290 TraceCheckUtils]: 34: Hoare triple {10915#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,841 INFO L290 TraceCheckUtils]: 35: Hoare triple {11000#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,841 INFO L272 TraceCheckUtils]: 36: Hoare triple {11000#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,841 INFO L290 TraceCheckUtils]: 37: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,855 INFO L290 TraceCheckUtils]: 38: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,867 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {11000#(<= ~counter~0 2)} {11000#(<= ~counter~0 2)} #59#return; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,868 INFO L272 TraceCheckUtils]: 41: Hoare triple {11000#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,868 INFO L290 TraceCheckUtils]: 42: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,868 INFO L290 TraceCheckUtils]: 43: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,868 INFO L290 TraceCheckUtils]: 44: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,869 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11000#(<= ~counter~0 2)} {11000#(<= ~counter~0 2)} #61#return; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,869 INFO L272 TraceCheckUtils]: 46: Hoare triple {11000#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,869 INFO L290 TraceCheckUtils]: 47: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,870 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11000#(<= ~counter~0 2)} {11000#(<= ~counter~0 2)} #63#return; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,871 INFO L272 TraceCheckUtils]: 51: Hoare triple {11000#(<= ~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)); {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,871 INFO L290 TraceCheckUtils]: 52: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,899 INFO L290 TraceCheckUtils]: 53: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,899 INFO L290 TraceCheckUtils]: 54: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,900 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11000#(<= ~counter~0 2)} {11000#(<= ~counter~0 2)} #65#return; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,900 INFO L272 TraceCheckUtils]: 56: Hoare triple {11000#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,900 INFO L290 TraceCheckUtils]: 57: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,901 INFO L290 TraceCheckUtils]: 58: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,901 INFO L290 TraceCheckUtils]: 59: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,901 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11000#(<= ~counter~0 2)} {11000#(<= ~counter~0 2)} #67#return; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,901 INFO L290 TraceCheckUtils]: 61: Hoare triple {11000#(<= ~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; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:11:13,902 INFO L290 TraceCheckUtils]: 62: Hoare triple {11000#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,902 INFO L290 TraceCheckUtils]: 63: Hoare triple {11085#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,902 INFO L272 TraceCheckUtils]: 64: Hoare triple {11085#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,903 INFO L290 TraceCheckUtils]: 65: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,903 INFO L290 TraceCheckUtils]: 66: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,903 INFO L290 TraceCheckUtils]: 67: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,903 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11085#(<= ~counter~0 3)} {11085#(<= ~counter~0 3)} #59#return; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,904 INFO L272 TraceCheckUtils]: 69: Hoare triple {11085#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,904 INFO L290 TraceCheckUtils]: 70: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,904 INFO L290 TraceCheckUtils]: 71: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,904 INFO L290 TraceCheckUtils]: 72: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,905 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11085#(<= ~counter~0 3)} {11085#(<= ~counter~0 3)} #61#return; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,905 INFO L272 TraceCheckUtils]: 74: Hoare triple {11085#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,905 INFO L290 TraceCheckUtils]: 75: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,906 INFO L290 TraceCheckUtils]: 76: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,906 INFO L290 TraceCheckUtils]: 77: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,906 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {11085#(<= ~counter~0 3)} {11085#(<= ~counter~0 3)} #63#return; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,907 INFO L272 TraceCheckUtils]: 79: Hoare triple {11085#(<= ~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)); {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,907 INFO L290 TraceCheckUtils]: 80: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,907 INFO L290 TraceCheckUtils]: 81: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,907 INFO L290 TraceCheckUtils]: 82: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,908 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {11085#(<= ~counter~0 3)} {11085#(<= ~counter~0 3)} #65#return; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,908 INFO L272 TraceCheckUtils]: 84: Hoare triple {11085#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,908 INFO L290 TraceCheckUtils]: 85: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,908 INFO L290 TraceCheckUtils]: 86: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,909 INFO L290 TraceCheckUtils]: 87: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,909 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11085#(<= ~counter~0 3)} {11085#(<= ~counter~0 3)} #67#return; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,909 INFO L290 TraceCheckUtils]: 89: Hoare triple {11085#(<= ~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; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:11:13,910 INFO L290 TraceCheckUtils]: 90: Hoare triple {11085#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,910 INFO L290 TraceCheckUtils]: 91: Hoare triple {11170#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,910 INFO L272 TraceCheckUtils]: 92: Hoare triple {11170#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,910 INFO L290 TraceCheckUtils]: 93: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,911 INFO L290 TraceCheckUtils]: 94: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,911 INFO L290 TraceCheckUtils]: 95: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,911 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {11170#(<= ~counter~0 4)} {11170#(<= ~counter~0 4)} #59#return; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,911 INFO L272 TraceCheckUtils]: 97: Hoare triple {11170#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,912 INFO L290 TraceCheckUtils]: 98: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,912 INFO L290 TraceCheckUtils]: 99: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,912 INFO L290 TraceCheckUtils]: 100: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,913 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11170#(<= ~counter~0 4)} {11170#(<= ~counter~0 4)} #61#return; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,913 INFO L272 TraceCheckUtils]: 102: Hoare triple {11170#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,913 INFO L290 TraceCheckUtils]: 103: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,913 INFO L290 TraceCheckUtils]: 104: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,913 INFO L290 TraceCheckUtils]: 105: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,914 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {11170#(<= ~counter~0 4)} {11170#(<= ~counter~0 4)} #63#return; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,914 INFO L272 TraceCheckUtils]: 107: Hoare triple {11170#(<= ~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)); {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,914 INFO L290 TraceCheckUtils]: 108: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,915 INFO L290 TraceCheckUtils]: 109: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,915 INFO L290 TraceCheckUtils]: 110: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,916 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {11170#(<= ~counter~0 4)} {11170#(<= ~counter~0 4)} #65#return; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,916 INFO L272 TraceCheckUtils]: 112: Hoare triple {11170#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,916 INFO L290 TraceCheckUtils]: 113: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,917 INFO L290 TraceCheckUtils]: 114: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,917 INFO L290 TraceCheckUtils]: 115: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,917 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {11170#(<= ~counter~0 4)} {11170#(<= ~counter~0 4)} #67#return; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,918 INFO L290 TraceCheckUtils]: 117: Hoare triple {11170#(<= ~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; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:11:13,918 INFO L290 TraceCheckUtils]: 118: Hoare triple {11170#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11255#(<= |main_#t~post5| 4)} is VALID [2022-04-14 15:11:13,918 INFO L290 TraceCheckUtils]: 119: Hoare triple {11255#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {10892#false} is VALID [2022-04-14 15:11:13,918 INFO L272 TraceCheckUtils]: 120: Hoare triple {10892#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10892#false} is VALID [2022-04-14 15:11:13,918 INFO L290 TraceCheckUtils]: 121: Hoare triple {10892#false} ~cond := #in~cond; {10892#false} is VALID [2022-04-14 15:11:13,919 INFO L290 TraceCheckUtils]: 122: Hoare triple {10892#false} assume !(0 == ~cond); {10892#false} is VALID [2022-04-14 15:11:13,919 INFO L290 TraceCheckUtils]: 123: Hoare triple {10892#false} assume true; {10892#false} is VALID [2022-04-14 15:11:13,919 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {10892#false} {10892#false} #69#return; {10892#false} is VALID [2022-04-14 15:11:13,919 INFO L272 TraceCheckUtils]: 125: Hoare triple {10892#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10892#false} is VALID [2022-04-14 15:11:13,919 INFO L290 TraceCheckUtils]: 126: Hoare triple {10892#false} ~cond := #in~cond; {10892#false} is VALID [2022-04-14 15:11:13,919 INFO L290 TraceCheckUtils]: 127: Hoare triple {10892#false} assume 0 == ~cond; {10892#false} is VALID [2022-04-14 15:11:13,919 INFO L290 TraceCheckUtils]: 128: Hoare triple {10892#false} assume !false; {10892#false} is VALID [2022-04-14 15:11:13,919 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:11:13,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:11:14,351 INFO L290 TraceCheckUtils]: 128: Hoare triple {10892#false} assume !false; {10892#false} is VALID [2022-04-14 15:11:14,351 INFO L290 TraceCheckUtils]: 127: Hoare triple {10892#false} assume 0 == ~cond; {10892#false} is VALID [2022-04-14 15:11:14,351 INFO L290 TraceCheckUtils]: 126: Hoare triple {10892#false} ~cond := #in~cond; {10892#false} is VALID [2022-04-14 15:11:14,351 INFO L272 TraceCheckUtils]: 125: Hoare triple {10892#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10892#false} is VALID [2022-04-14 15:11:14,351 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {10891#true} {10892#false} #69#return; {10892#false} is VALID [2022-04-14 15:11:14,351 INFO L290 TraceCheckUtils]: 123: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:11:14,352 INFO L290 TraceCheckUtils]: 122: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:11:14,352 INFO L290 TraceCheckUtils]: 121: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:11:14,352 INFO L272 TraceCheckUtils]: 120: Hoare triple {10892#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:11:14,352 INFO L290 TraceCheckUtils]: 119: Hoare triple {11313#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {10892#false} is VALID [2022-04-14 15:11:14,352 INFO L290 TraceCheckUtils]: 118: Hoare triple {11317#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11313#(< |main_#t~post5| 20)} is VALID [2022-04-14 15:11:14,353 INFO L290 TraceCheckUtils]: 117: Hoare triple {11317#(< ~counter~0 20)} 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; {11317#(< ~counter~0 20)} is VALID [2022-04-14 15:11:14,353 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {10891#true} {11317#(< ~counter~0 20)} #67#return; {11317#(< ~counter~0 20)} is VALID [2022-04-14 15:11:14,353 INFO L290 TraceCheckUtils]: 115: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:11:14,353 INFO L290 TraceCheckUtils]: 114: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:11:14,353 INFO L290 TraceCheckUtils]: 113: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:11:14,353 INFO L272 TraceCheckUtils]: 112: Hoare triple {11317#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10891#true} is VALID [2022-04-14 15:11:14,354 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {10891#true} {11317#(< ~counter~0 20)} #65#return; {11317#(< ~counter~0 20)} is VALID [2022-04-14 15:11:14,354 INFO L290 TraceCheckUtils]: 110: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:11:14,354 INFO L290 TraceCheckUtils]: 109: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:11:14,354 INFO L290 TraceCheckUtils]: 108: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:11:14,354 INFO L272 TraceCheckUtils]: 107: Hoare triple {11317#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:11:14,354 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {10891#true} {11317#(< ~counter~0 20)} #63#return; {11317#(< ~counter~0 20)} is VALID [2022-04-14 15:11:14,354 INFO L290 TraceCheckUtils]: 105: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:11:14,355 INFO L290 TraceCheckUtils]: 104: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:11:14,355 INFO L290 TraceCheckUtils]: 103: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:11:14,355 INFO L272 TraceCheckUtils]: 102: Hoare triple {11317#(< ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:11:14,355 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10891#true} {11317#(< ~counter~0 20)} #61#return; {11317#(< ~counter~0 20)} is VALID [2022-04-14 15:11:14,355 INFO L290 TraceCheckUtils]: 100: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:11:14,355 INFO L290 TraceCheckUtils]: 99: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:11:14,355 INFO L290 TraceCheckUtils]: 98: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:11:14,355 INFO L272 TraceCheckUtils]: 97: Hoare triple {11317#(< ~counter~0 20)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10891#true} is VALID [2022-04-14 15:11:14,356 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {10891#true} {11317#(< ~counter~0 20)} #59#return; {11317#(< ~counter~0 20)} is VALID [2022-04-14 15:11:14,356 INFO L290 TraceCheckUtils]: 95: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:11:14,356 INFO L290 TraceCheckUtils]: 94: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:11:14,356 INFO L290 TraceCheckUtils]: 93: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:11:14,356 INFO L272 TraceCheckUtils]: 92: Hoare triple {11317#(< ~counter~0 20)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:11:14,356 INFO L290 TraceCheckUtils]: 91: Hoare triple {11317#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {11317#(< ~counter~0 20)} is VALID [2022-04-14 15:11:14,357 INFO L290 TraceCheckUtils]: 90: Hoare triple {11402#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11317#(< ~counter~0 20)} is VALID [2022-04-14 15:11:14,357 INFO L290 TraceCheckUtils]: 89: Hoare triple {11402#(< ~counter~0 19)} 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; {11402#(< ~counter~0 19)} is VALID [2022-04-14 15:11:14,357 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10891#true} {11402#(< ~counter~0 19)} #67#return; {11402#(< ~counter~0 19)} is VALID [2022-04-14 15:11:14,358 INFO L290 TraceCheckUtils]: 87: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:11:14,358 INFO L290 TraceCheckUtils]: 86: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:11:14,358 INFO L290 TraceCheckUtils]: 85: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:11:14,358 INFO L272 TraceCheckUtils]: 84: Hoare triple {11402#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10891#true} is VALID [2022-04-14 15:11:14,358 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {10891#true} {11402#(< ~counter~0 19)} #65#return; {11402#(< ~counter~0 19)} is VALID [2022-04-14 15:11:14,358 INFO L290 TraceCheckUtils]: 82: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:11:14,358 INFO L290 TraceCheckUtils]: 81: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:11:14,358 INFO L290 TraceCheckUtils]: 80: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:11:14,358 INFO L272 TraceCheckUtils]: 79: Hoare triple {11402#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:11:14,359 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10891#true} {11402#(< ~counter~0 19)} #63#return; {11402#(< ~counter~0 19)} is VALID [2022-04-14 15:11:14,359 INFO L290 TraceCheckUtils]: 77: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:11:14,359 INFO L290 TraceCheckUtils]: 76: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:11:14,359 INFO L290 TraceCheckUtils]: 75: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:11:14,359 INFO L272 TraceCheckUtils]: 74: Hoare triple {11402#(< ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:11:14,359 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10891#true} {11402#(< ~counter~0 19)} #61#return; {11402#(< ~counter~0 19)} is VALID [2022-04-14 15:11:14,360 INFO L290 TraceCheckUtils]: 72: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:11:14,360 INFO L290 TraceCheckUtils]: 71: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:11:14,360 INFO L290 TraceCheckUtils]: 70: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:11:14,360 INFO L272 TraceCheckUtils]: 69: Hoare triple {11402#(< ~counter~0 19)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10891#true} is VALID [2022-04-14 15:11:14,360 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10891#true} {11402#(< ~counter~0 19)} #59#return; {11402#(< ~counter~0 19)} is VALID [2022-04-14 15:11:14,360 INFO L290 TraceCheckUtils]: 67: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:11:14,360 INFO L290 TraceCheckUtils]: 66: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:11:14,360 INFO L290 TraceCheckUtils]: 65: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:11:14,360 INFO L272 TraceCheckUtils]: 64: Hoare triple {11402#(< ~counter~0 19)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:11:14,361 INFO L290 TraceCheckUtils]: 63: Hoare triple {11402#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {11402#(< ~counter~0 19)} is VALID [2022-04-14 15:11:14,361 INFO L290 TraceCheckUtils]: 62: Hoare triple {11487#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11402#(< ~counter~0 19)} is VALID [2022-04-14 15:11:14,361 INFO L290 TraceCheckUtils]: 61: Hoare triple {11487#(< ~counter~0 18)} 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; {11487#(< ~counter~0 18)} is VALID [2022-04-14 15:11:14,362 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10891#true} {11487#(< ~counter~0 18)} #67#return; {11487#(< ~counter~0 18)} is VALID [2022-04-14 15:11:14,362 INFO L290 TraceCheckUtils]: 59: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:11:14,362 INFO L290 TraceCheckUtils]: 58: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:11:14,362 INFO L290 TraceCheckUtils]: 57: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:11:14,362 INFO L272 TraceCheckUtils]: 56: Hoare triple {11487#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10891#true} is VALID [2022-04-14 15:11:14,362 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10891#true} {11487#(< ~counter~0 18)} #65#return; {11487#(< ~counter~0 18)} is VALID [2022-04-14 15:11:14,363 INFO L290 TraceCheckUtils]: 54: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:11:14,363 INFO L290 TraceCheckUtils]: 53: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:11:14,363 INFO L290 TraceCheckUtils]: 52: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:11:14,363 INFO L272 TraceCheckUtils]: 51: Hoare triple {11487#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:11:14,363 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10891#true} {11487#(< ~counter~0 18)} #63#return; {11487#(< ~counter~0 18)} is VALID [2022-04-14 15:11:14,363 INFO L290 TraceCheckUtils]: 49: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:11:14,363 INFO L290 TraceCheckUtils]: 48: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:11:14,363 INFO L290 TraceCheckUtils]: 47: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:11:14,363 INFO L272 TraceCheckUtils]: 46: Hoare triple {11487#(< ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:11:14,364 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10891#true} {11487#(< ~counter~0 18)} #61#return; {11487#(< ~counter~0 18)} is VALID [2022-04-14 15:11:14,364 INFO L290 TraceCheckUtils]: 44: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:11:14,364 INFO L290 TraceCheckUtils]: 43: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:11:14,364 INFO L290 TraceCheckUtils]: 42: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:11:14,364 INFO L272 TraceCheckUtils]: 41: Hoare triple {11487#(< ~counter~0 18)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10891#true} is VALID [2022-04-14 15:11:14,364 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10891#true} {11487#(< ~counter~0 18)} #59#return; {11487#(< ~counter~0 18)} is VALID [2022-04-14 15:11:14,364 INFO L290 TraceCheckUtils]: 39: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:11:14,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:11:14,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:11:14,365 INFO L272 TraceCheckUtils]: 36: Hoare triple {11487#(< ~counter~0 18)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:11:14,365 INFO L290 TraceCheckUtils]: 35: Hoare triple {11487#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {11487#(< ~counter~0 18)} is VALID [2022-04-14 15:11:14,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {11572#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11487#(< ~counter~0 18)} is VALID [2022-04-14 15:11:14,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {11572#(< ~counter~0 17)} 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; {11572#(< ~counter~0 17)} is VALID [2022-04-14 15:11:14,366 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10891#true} {11572#(< ~counter~0 17)} #67#return; {11572#(< ~counter~0 17)} is VALID [2022-04-14 15:11:14,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:11:14,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:11:14,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:11:14,366 INFO L272 TraceCheckUtils]: 28: Hoare triple {11572#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10891#true} is VALID [2022-04-14 15:11:14,367 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10891#true} {11572#(< ~counter~0 17)} #65#return; {11572#(< ~counter~0 17)} is VALID [2022-04-14 15:11:14,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:11:14,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:11:14,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:11:14,367 INFO L272 TraceCheckUtils]: 23: Hoare triple {11572#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:11:14,367 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10891#true} {11572#(< ~counter~0 17)} #63#return; {11572#(< ~counter~0 17)} is VALID [2022-04-14 15:11:14,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:11:14,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:11:14,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:11:14,368 INFO L272 TraceCheckUtils]: 18: Hoare triple {11572#(< ~counter~0 17)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:11:14,368 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10891#true} {11572#(< ~counter~0 17)} #61#return; {11572#(< ~counter~0 17)} is VALID [2022-04-14 15:11:14,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:11:14,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:11:14,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:11:14,368 INFO L272 TraceCheckUtils]: 13: Hoare triple {11572#(< ~counter~0 17)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10891#true} is VALID [2022-04-14 15:11:14,369 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10891#true} {11572#(< ~counter~0 17)} #59#return; {11572#(< ~counter~0 17)} is VALID [2022-04-14 15:11:14,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:11:14,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:11:14,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:11:14,369 INFO L272 TraceCheckUtils]: 8: Hoare triple {11572#(< ~counter~0 17)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:11:14,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {11572#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {11572#(< ~counter~0 17)} is VALID [2022-04-14 15:11:14,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {11657#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11572#(< ~counter~0 17)} is VALID [2022-04-14 15:11:14,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {11657#(< ~counter~0 16)} 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; {11657#(< ~counter~0 16)} is VALID [2022-04-14 15:11:14,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {11657#(< ~counter~0 16)} call #t~ret6 := main(); {11657#(< ~counter~0 16)} is VALID [2022-04-14 15:11:14,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11657#(< ~counter~0 16)} {10891#true} #81#return; {11657#(< ~counter~0 16)} is VALID [2022-04-14 15:11:14,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {11657#(< ~counter~0 16)} assume true; {11657#(< ~counter~0 16)} is VALID [2022-04-14 15:11:14,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {10891#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; {11657#(< ~counter~0 16)} is VALID [2022-04-14 15:11:14,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {10891#true} call ULTIMATE.init(); {10891#true} is VALID [2022-04-14 15:11:14,372 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:11:14,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:14,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241609580] [2022-04-14 15:11:14,372 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:14,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299727322] [2022-04-14 15:11:14,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299727322] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:11:14,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:11:14,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-14 15:11:14,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561218095] [2022-04-14 15:11:14,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:11:14,373 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) Word has length 129 [2022-04-14 15:11:14,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:14,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-14 15:11:14,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:14,448 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-14 15:11:14,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:14,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-14 15:11:14,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-14 15:11:14,449 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-14 15:11:15,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:15,802 INFO L93 Difference]: Finished difference Result 368 states and 388 transitions. [2022-04-14 15:11:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-14 15:11:15,803 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) Word has length 129 [2022-04-14 15:11:15,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:15,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-14 15:11:15,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 241 transitions. [2022-04-14 15:11:15,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-14 15:11:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 241 transitions. [2022-04-14 15:11:15,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 241 transitions. [2022-04-14 15:11:16,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:16,040 INFO L225 Difference]: With dead ends: 368 [2022-04-14 15:11:16,040 INFO L226 Difference]: Without dead ends: 353 [2022-04-14 15:11:16,040 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-14 15:11:16,042 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 149 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:16,042 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 267 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 15:11:16,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-04-14 15:11:16,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 311. [2022-04-14 15:11:16,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:16,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-14 15:11:16,207 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-14 15:11:16,207 INFO L87 Difference]: Start difference. First operand 353 states. Second operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-14 15:11:16,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:16,213 INFO L93 Difference]: Finished difference Result 353 states and 367 transitions. [2022-04-14 15:11:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 367 transitions. [2022-04-14 15:11:16,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:16,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:16,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) Second operand 353 states. [2022-04-14 15:11:16,214 INFO L87 Difference]: Start difference. First operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) Second operand 353 states. [2022-04-14 15:11:16,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:16,220 INFO L93 Difference]: Finished difference Result 353 states and 367 transitions. [2022-04-14 15:11:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 367 transitions. [2022-04-14 15:11:16,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:16,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:16,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:16,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:16,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-14 15:11:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 326 transitions. [2022-04-14 15:11:16,226 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 326 transitions. Word has length 129 [2022-04-14 15:11:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:16,227 INFO L478 AbstractCegarLoop]: Abstraction has 311 states and 326 transitions. [2022-04-14 15:11:16,227 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-14 15:11:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 326 transitions. [2022-04-14 15:11:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-14 15:11:16,227 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:16,228 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:11:16,245 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:11:16,442 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:11:16,443 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:16,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:16,443 INFO L85 PathProgramCache]: Analyzing trace with hash 173938976, now seen corresponding path program 3 times [2022-04-14 15:11:16,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:16,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622346826] [2022-04-14 15:11:16,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:16,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:16,451 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:16,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1579840747] [2022-04-14 15:11:16,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 15:11:16,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:16,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:16,454 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:11:16,454 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:11:16,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-14 15:11:16,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:11:16,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-14 15:11:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:16,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:17,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {13359#true} call ULTIMATE.init(); {13359#true} is VALID [2022-04-14 15:11:17,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {13359#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; {13359#true} is VALID [2022-04-14 15:11:17,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13359#true} {13359#true} #81#return; {13359#true} is VALID [2022-04-14 15:11:17,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {13359#true} call #t~ret6 := main(); {13359#true} is VALID [2022-04-14 15:11:17,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {13359#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; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:17,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:17,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:17,312 INFO L272 TraceCheckUtils]: 8: Hoare triple {13379#(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)); {13359#true} is VALID [2022-04-14 15:11:17,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,312 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13359#true} {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:17,312 INFO L272 TraceCheckUtils]: 13: Hoare triple {13379#(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)); {13359#true} is VALID [2022-04-14 15:11:17,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,313 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13359#true} {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:17,313 INFO L272 TraceCheckUtils]: 18: Hoare triple {13379#(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)); {13359#true} is VALID [2022-04-14 15:11:17,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,313 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13359#true} {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:17,313 INFO L272 TraceCheckUtils]: 23: Hoare triple {13379#(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)); {13359#true} is VALID [2022-04-14 15:11:17,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,314 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13359#true} {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:17,314 INFO L272 TraceCheckUtils]: 28: Hoare triple {13379#(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)); {13359#true} is VALID [2022-04-14 15:11:17,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,314 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13359#true} {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:17,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {13379#(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; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-14 15:11:17,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-14 15:11:17,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-14 15:11:17,315 INFO L272 TraceCheckUtils]: 36: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-14 15:11:17,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,315 INFO L290 TraceCheckUtils]: 38: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,315 INFO L290 TraceCheckUtils]: 39: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,315 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13359#true} {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #59#return; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-14 15:11:17,315 INFO L272 TraceCheckUtils]: 41: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13359#true} is VALID [2022-04-14 15:11:17,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,316 INFO L290 TraceCheckUtils]: 43: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,316 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13359#true} {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #61#return; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-14 15:11:17,316 INFO L272 TraceCheckUtils]: 46: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-14 15:11:17,316 INFO L290 TraceCheckUtils]: 47: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,316 INFO L290 TraceCheckUtils]: 48: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,316 INFO L290 TraceCheckUtils]: 49: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,316 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13359#true} {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #63#return; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-14 15:11:17,316 INFO L272 TraceCheckUtils]: 51: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) 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)); {13359#true} is VALID [2022-04-14 15:11:17,317 INFO L290 TraceCheckUtils]: 52: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,317 INFO L290 TraceCheckUtils]: 53: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,317 INFO L290 TraceCheckUtils]: 54: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,317 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13359#true} {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #65#return; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-14 15:11:17,317 INFO L272 TraceCheckUtils]: 56: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13359#true} is VALID [2022-04-14 15:11:17,317 INFO L290 TraceCheckUtils]: 57: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,317 INFO L290 TraceCheckUtils]: 58: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,317 INFO L290 TraceCheckUtils]: 59: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,317 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13359#true} {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #67#return; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-14 15:11:17,318 INFO L290 TraceCheckUtils]: 61: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) 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; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:11:17,318 INFO L290 TraceCheckUtils]: 62: Hoare triple {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:11:17,318 INFO L290 TraceCheckUtils]: 63: Hoare triple {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:11:17,318 INFO L272 TraceCheckUtils]: 64: Hoare triple {13549#(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)); {13359#true} is VALID [2022-04-14 15:11:17,318 INFO L290 TraceCheckUtils]: 65: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,318 INFO L290 TraceCheckUtils]: 66: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,319 INFO L290 TraceCheckUtils]: 67: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,319 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13359#true} {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #59#return; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:11:17,319 INFO L272 TraceCheckUtils]: 69: Hoare triple {13549#(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)); {13359#true} is VALID [2022-04-14 15:11:17,319 INFO L290 TraceCheckUtils]: 70: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,319 INFO L290 TraceCheckUtils]: 71: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,319 INFO L290 TraceCheckUtils]: 72: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,319 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13359#true} {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #61#return; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:11:17,319 INFO L272 TraceCheckUtils]: 74: Hoare triple {13549#(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)); {13359#true} is VALID [2022-04-14 15:11:17,319 INFO L290 TraceCheckUtils]: 75: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,319 INFO L290 TraceCheckUtils]: 76: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,320 INFO L290 TraceCheckUtils]: 77: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,320 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {13359#true} {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #63#return; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:11:17,320 INFO L272 TraceCheckUtils]: 79: Hoare triple {13549#(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)); {13359#true} is VALID [2022-04-14 15:11:17,320 INFO L290 TraceCheckUtils]: 80: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,320 INFO L290 TraceCheckUtils]: 81: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,320 INFO L290 TraceCheckUtils]: 82: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,320 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {13359#true} {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #65#return; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:11:17,320 INFO L272 TraceCheckUtils]: 84: Hoare triple {13549#(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)); {13359#true} is VALID [2022-04-14 15:11:17,320 INFO L290 TraceCheckUtils]: 85: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,321 INFO L290 TraceCheckUtils]: 86: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,321 INFO L290 TraceCheckUtils]: 87: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,321 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13359#true} {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #67#return; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:11:17,321 INFO L290 TraceCheckUtils]: 89: Hoare triple {13549#(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; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-14 15:11:17,322 INFO L290 TraceCheckUtils]: 90: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-14 15:11:17,322 INFO L290 TraceCheckUtils]: 91: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-14 15:11:17,322 INFO L272 TraceCheckUtils]: 92: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-14 15:11:17,322 INFO L290 TraceCheckUtils]: 93: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,322 INFO L290 TraceCheckUtils]: 94: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,322 INFO L290 TraceCheckUtils]: 95: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,322 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13359#true} {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} #59#return; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-14 15:11:17,322 INFO L272 TraceCheckUtils]: 97: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13359#true} is VALID [2022-04-14 15:11:17,323 INFO L290 TraceCheckUtils]: 98: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,323 INFO L290 TraceCheckUtils]: 99: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,323 INFO L290 TraceCheckUtils]: 100: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,323 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {13359#true} {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} #61#return; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-14 15:11:17,323 INFO L272 TraceCheckUtils]: 102: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-14 15:11:17,323 INFO L290 TraceCheckUtils]: 103: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,323 INFO L290 TraceCheckUtils]: 104: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,323 INFO L290 TraceCheckUtils]: 105: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,323 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {13359#true} {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} #63#return; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-14 15:11:17,324 INFO L272 TraceCheckUtils]: 107: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) 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)); {13359#true} is VALID [2022-04-14 15:11:17,324 INFO L290 TraceCheckUtils]: 108: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,324 INFO L290 TraceCheckUtils]: 109: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,324 INFO L290 TraceCheckUtils]: 110: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,324 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {13359#true} {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} #65#return; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-14 15:11:17,324 INFO L272 TraceCheckUtils]: 112: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13359#true} is VALID [2022-04-14 15:11:17,324 INFO L290 TraceCheckUtils]: 113: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,324 INFO L290 TraceCheckUtils]: 114: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,324 INFO L290 TraceCheckUtils]: 115: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,324 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {13359#true} {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} #67#return; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-14 15:11:17,325 INFO L290 TraceCheckUtils]: 117: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} assume !(~n~0 <= ~a~0); {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} is VALID [2022-04-14 15:11:17,325 INFO L272 TraceCheckUtils]: 118: Hoare triple {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-14 15:11:17,325 INFO L290 TraceCheckUtils]: 119: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,325 INFO L290 TraceCheckUtils]: 120: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,325 INFO L290 TraceCheckUtils]: 121: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,325 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {13359#true} {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} #69#return; {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} is VALID [2022-04-14 15:11:17,325 INFO L272 TraceCheckUtils]: 123: Hoare triple {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 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)); {13359#true} is VALID [2022-04-14 15:11:17,325 INFO L290 TraceCheckUtils]: 124: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:11:17,326 INFO L290 TraceCheckUtils]: 125: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:11:17,326 INFO L290 TraceCheckUtils]: 126: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:11:17,326 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {13359#true} {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} #71#return; {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} is VALID [2022-04-14 15:11:17,326 INFO L272 TraceCheckUtils]: 128: Hoare triple {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {13753#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:17,327 INFO L290 TraceCheckUtils]: 129: Hoare triple {13753#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13757#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:17,327 INFO L290 TraceCheckUtils]: 130: Hoare triple {13757#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13360#false} is VALID [2022-04-14 15:11:17,327 INFO L290 TraceCheckUtils]: 131: Hoare triple {13360#false} assume !false; {13360#false} is VALID [2022-04-14 15:11:17,327 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:11:17,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:11:25,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:25,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622346826] [2022-04-14 15:11:25,131 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:25,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579840747] [2022-04-14 15:11:25,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579840747] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:11:25,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:11:25,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-14 15:11:25,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553848258] [2022-04-14 15:11:25,132 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:11:25,132 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:11:25,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:25,132 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:11:25,201 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:11:25,201 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 15:11:25,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:25,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 15:11:25,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-14 15:11:25,201 INFO L87 Difference]: Start difference. First operand 311 states and 326 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:11:26,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:26,056 INFO L93 Difference]: Finished difference Result 313 states and 327 transitions. [2022-04-14 15:11:26,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 15:11:26,056 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:11:26,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:26,056 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:11:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-14 15:11:26,058 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:11:26,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-14 15:11:26,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-14 15:11:26,175 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:11:26,180 INFO L225 Difference]: With dead ends: 313 [2022-04-14 15:11:26,180 INFO L226 Difference]: Without dead ends: 302 [2022-04-14 15:11:26,180 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:11:26,180 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:26,181 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.3s Time] [2022-04-14 15:11:26,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-04-14 15:11:26,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2022-04-14 15:11:26,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:26,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 302 states. Second operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-14 15:11:26,293 INFO L74 IsIncluded]: Start isIncluded. First operand 302 states. Second operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-14 15:11:26,293 INFO L87 Difference]: Start difference. First operand 302 states. Second operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-14 15:11:26,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:26,298 INFO L93 Difference]: Finished difference Result 302 states and 315 transitions. [2022-04-14 15:11:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-04-14 15:11:26,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:26,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:26,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) Second operand 302 states. [2022-04-14 15:11:26,299 INFO L87 Difference]: Start difference. First operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) Second operand 302 states. [2022-04-14 15:11:26,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:26,323 INFO L93 Difference]: Finished difference Result 302 states and 315 transitions. [2022-04-14 15:11:26,323 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-04-14 15:11:26,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:26,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:26,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:26,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-14 15:11:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 315 transitions. [2022-04-14 15:11:26,329 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 315 transitions. Word has length 132 [2022-04-14 15:11:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:26,329 INFO L478 AbstractCegarLoop]: Abstraction has 302 states and 315 transitions. [2022-04-14 15:11:26,330 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:11:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-04-14 15:11:26,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-14 15:11:26,331 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:26,331 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:11:26,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-14 15:11:26,536 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:11:26,536 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:26,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:26,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1020857049, now seen corresponding path program 3 times [2022-04-14 15:11:26,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:26,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941908412] [2022-04-14 15:11:26,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:26,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:26,551 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:26,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1698788677] [2022-04-14 15:11:26,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 15:11:26,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:26,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:26,552 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:11:26,595 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:11:27,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-14 15:11:27,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:11:27,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 15:11:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:27,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:31,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {15374#true} call ULTIMATE.init(); {15374#true} is VALID [2022-04-14 15:11:31,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {15374#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; {15374#true} is VALID [2022-04-14 15:11:31,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15374#true} {15374#true} #81#return; {15374#true} is VALID [2022-04-14 15:11:31,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {15374#true} call #t~ret6 := main(); {15374#true} is VALID [2022-04-14 15:11:31,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {15374#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; {15374#true} is VALID [2022-04-14 15:11:31,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-14 15:11:31,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {15374#true} assume !!(#t~post5 < 20);havoc #t~post5; {15374#true} is VALID [2022-04-14 15:11:31,778 INFO L272 TraceCheckUtils]: 8: Hoare triple {15374#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:11:31,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,779 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-14 15:11:31,779 INFO L272 TraceCheckUtils]: 13: Hoare triple {15374#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:11:31,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,779 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-14 15:11:31,779 INFO L272 TraceCheckUtils]: 18: Hoare triple {15374#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:11:31,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,779 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-14 15:11:31,779 INFO L272 TraceCheckUtils]: 23: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:11:31,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,779 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-14 15:11:31,779 INFO L272 TraceCheckUtils]: 28: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:11:31,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,780 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-14 15:11:31,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {15374#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; {15374#true} is VALID [2022-04-14 15:11:31,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-14 15:11:31,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {15374#true} assume !!(#t~post5 < 20);havoc #t~post5; {15374#true} is VALID [2022-04-14 15:11:31,780 INFO L272 TraceCheckUtils]: 36: Hoare triple {15374#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:11:31,780 INFO L290 TraceCheckUtils]: 37: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,780 INFO L290 TraceCheckUtils]: 38: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,780 INFO L290 TraceCheckUtils]: 39: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,780 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-14 15:11:31,780 INFO L272 TraceCheckUtils]: 41: Hoare triple {15374#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:11:31,780 INFO L290 TraceCheckUtils]: 42: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,780 INFO L290 TraceCheckUtils]: 43: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,781 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-14 15:11:31,781 INFO L272 TraceCheckUtils]: 46: Hoare triple {15374#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:11:31,781 INFO L290 TraceCheckUtils]: 47: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,781 INFO L290 TraceCheckUtils]: 48: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,781 INFO L290 TraceCheckUtils]: 49: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,781 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-14 15:11:31,781 INFO L272 TraceCheckUtils]: 51: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:11:31,781 INFO L290 TraceCheckUtils]: 52: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,781 INFO L290 TraceCheckUtils]: 53: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,781 INFO L290 TraceCheckUtils]: 54: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,781 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-14 15:11:31,781 INFO L272 TraceCheckUtils]: 56: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:11:31,781 INFO L290 TraceCheckUtils]: 57: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,781 INFO L290 TraceCheckUtils]: 58: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,781 INFO L290 TraceCheckUtils]: 59: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,781 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-14 15:11:31,781 INFO L290 TraceCheckUtils]: 61: Hoare triple {15374#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; {15374#true} is VALID [2022-04-14 15:11:31,782 INFO L290 TraceCheckUtils]: 62: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-14 15:11:31,782 INFO L290 TraceCheckUtils]: 63: Hoare triple {15374#true} assume !!(#t~post5 < 20);havoc #t~post5; {15374#true} is VALID [2022-04-14 15:11:31,782 INFO L272 TraceCheckUtils]: 64: Hoare triple {15374#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:11:31,782 INFO L290 TraceCheckUtils]: 65: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,782 INFO L290 TraceCheckUtils]: 66: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,782 INFO L290 TraceCheckUtils]: 67: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,782 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-14 15:11:31,782 INFO L272 TraceCheckUtils]: 69: Hoare triple {15374#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:11:31,782 INFO L290 TraceCheckUtils]: 70: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,782 INFO L290 TraceCheckUtils]: 71: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,782 INFO L290 TraceCheckUtils]: 72: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,782 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-14 15:11:31,782 INFO L272 TraceCheckUtils]: 74: Hoare triple {15374#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:11:31,782 INFO L290 TraceCheckUtils]: 75: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,782 INFO L290 TraceCheckUtils]: 76: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,782 INFO L290 TraceCheckUtils]: 77: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,782 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-14 15:11:31,783 INFO L272 TraceCheckUtils]: 79: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:11:31,783 INFO L290 TraceCheckUtils]: 80: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,783 INFO L290 TraceCheckUtils]: 81: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,783 INFO L290 TraceCheckUtils]: 82: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,783 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-14 15:11:31,783 INFO L272 TraceCheckUtils]: 84: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:11:31,783 INFO L290 TraceCheckUtils]: 85: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,783 INFO L290 TraceCheckUtils]: 86: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,783 INFO L290 TraceCheckUtils]: 87: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,783 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-14 15:11:31,783 INFO L290 TraceCheckUtils]: 89: Hoare triple {15374#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; {15374#true} is VALID [2022-04-14 15:11:31,783 INFO L290 TraceCheckUtils]: 90: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-14 15:11:31,783 INFO L290 TraceCheckUtils]: 91: Hoare triple {15374#true} assume !!(#t~post5 < 20);havoc #t~post5; {15374#true} is VALID [2022-04-14 15:11:31,783 INFO L272 TraceCheckUtils]: 92: Hoare triple {15374#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:11:31,783 INFO L290 TraceCheckUtils]: 93: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,783 INFO L290 TraceCheckUtils]: 94: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,783 INFO L290 TraceCheckUtils]: 95: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,784 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-14 15:11:31,784 INFO L272 TraceCheckUtils]: 97: Hoare triple {15374#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:11:31,784 INFO L290 TraceCheckUtils]: 98: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,784 INFO L290 TraceCheckUtils]: 99: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,784 INFO L290 TraceCheckUtils]: 100: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,784 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-14 15:11:31,784 INFO L272 TraceCheckUtils]: 102: Hoare triple {15374#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:11:31,784 INFO L290 TraceCheckUtils]: 103: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,784 INFO L290 TraceCheckUtils]: 104: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,784 INFO L290 TraceCheckUtils]: 105: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,784 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-14 15:11:31,784 INFO L272 TraceCheckUtils]: 107: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:11:31,784 INFO L290 TraceCheckUtils]: 108: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,784 INFO L290 TraceCheckUtils]: 109: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,784 INFO L290 TraceCheckUtils]: 110: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,784 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-14 15:11:31,784 INFO L272 TraceCheckUtils]: 112: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:11:31,785 INFO L290 TraceCheckUtils]: 113: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,785 INFO L290 TraceCheckUtils]: 114: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,785 INFO L290 TraceCheckUtils]: 115: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,785 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-14 15:11:31,785 INFO L290 TraceCheckUtils]: 117: Hoare triple {15374#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; {15730#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-14 15:11:31,786 INFO L290 TraceCheckUtils]: 118: Hoare triple {15730#(<= main_~n~0 (+ main_~a~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15730#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-14 15:11:31,786 INFO L290 TraceCheckUtils]: 119: Hoare triple {15730#(<= main_~n~0 (+ main_~a~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {15730#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-14 15:11:31,786 INFO L272 TraceCheckUtils]: 120: Hoare triple {15730#(<= main_~n~0 (+ main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:11:31,786 INFO L290 TraceCheckUtils]: 121: Hoare triple {15374#true} ~cond := #in~cond; {15743#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:31,787 INFO L290 TraceCheckUtils]: 122: Hoare triple {15743#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15747#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:11:31,787 INFO L290 TraceCheckUtils]: 123: Hoare triple {15747#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15747#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:11:31,787 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {15747#(not (= |__VERIFIER_assert_#in~cond| 0))} {15730#(<= main_~n~0 (+ main_~a~0 1))} #59#return; {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-14 15:11:31,788 INFO L272 TraceCheckUtils]: 125: Hoare triple {15754#(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)); {15374#true} is VALID [2022-04-14 15:11:31,788 INFO L290 TraceCheckUtils]: 126: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,788 INFO L290 TraceCheckUtils]: 127: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,788 INFO L290 TraceCheckUtils]: 128: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,788 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {15374#true} {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #61#return; {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-14 15:11:31,788 INFO L272 TraceCheckUtils]: 130: Hoare triple {15754#(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)); {15374#true} is VALID [2022-04-14 15:11:31,788 INFO L290 TraceCheckUtils]: 131: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,788 INFO L290 TraceCheckUtils]: 132: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,788 INFO L290 TraceCheckUtils]: 133: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,789 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {15374#true} {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #63#return; {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-14 15:11:31,789 INFO L272 TraceCheckUtils]: 135: Hoare triple {15754#(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)); {15374#true} is VALID [2022-04-14 15:11:31,789 INFO L290 TraceCheckUtils]: 136: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,789 INFO L290 TraceCheckUtils]: 137: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,789 INFO L290 TraceCheckUtils]: 138: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,790 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {15374#true} {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #65#return; {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-14 15:11:31,790 INFO L272 TraceCheckUtils]: 140: Hoare triple {15754#(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)); {15374#true} is VALID [2022-04-14 15:11:31,790 INFO L290 TraceCheckUtils]: 141: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,790 INFO L290 TraceCheckUtils]: 142: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,790 INFO L290 TraceCheckUtils]: 143: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,790 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {15374#true} {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #67#return; {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-14 15:11:31,791 INFO L290 TraceCheckUtils]: 145: Hoare triple {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} assume !(~n~0 <= ~a~0); {15818#(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:11:31,791 INFO L272 TraceCheckUtils]: 146: Hoare triple {15818#(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)); {15374#true} is VALID [2022-04-14 15:11:31,791 INFO L290 TraceCheckUtils]: 147: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:11:31,791 INFO L290 TraceCheckUtils]: 148: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:11:31,791 INFO L290 TraceCheckUtils]: 149: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:11:31,792 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {15374#true} {15818#(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; {15818#(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:11:33,794 WARN L272 TraceCheckUtils]: 151: Hoare triple {15818#(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)); {15837#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-14 15:11:33,794 INFO L290 TraceCheckUtils]: 152: Hoare triple {15837#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15841#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:33,794 INFO L290 TraceCheckUtils]: 153: Hoare triple {15841#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15375#false} is VALID [2022-04-14 15:11:33,794 INFO L290 TraceCheckUtils]: 154: Hoare triple {15375#false} assume !false; {15375#false} is VALID [2022-04-14 15:11:33,795 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:11:33,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:11:35,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:35,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941908412] [2022-04-14 15:11:35,863 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:35,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698788677] [2022-04-14 15:11:35,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698788677] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:11:35,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:11:35,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-14 15:11:35,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994158085] [2022-04-14 15:11:35,864 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:11:35,864 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:11:35,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:35,864 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:11:36,231 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:11:36,231 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 15:11:36,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:36,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 15:11:36,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=69, Unknown=1, NotChecked=0, Total=90 [2022-04-14 15:11:36,232 INFO L87 Difference]: Start difference. First operand 302 states and 315 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:11:38,526 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:11:46,974 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:11:48,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:48,933 INFO L93 Difference]: Finished difference Result 311 states and 325 transitions. [2022-04-14 15:11:48,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 15:11:48,933 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:11:48,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:48,933 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:11:48,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-14 15:11:48,934 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:11:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-14 15:11:48,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2022-04-14 15:11:50,108 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:11:50,113 INFO L225 Difference]: With dead ends: 311 [2022-04-14 15:11:50,113 INFO L226 Difference]: Without dead ends: 309 [2022-04-14 15:11:50,113 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:11:50,113 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:50,114 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 116 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 167 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-04-14 15:11:50,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-14 15:11:50,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2022-04-14 15:11:50,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:50,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-14 15:11:50,320 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-14 15:11:50,320 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-14 15:11:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:50,325 INFO L93 Difference]: Finished difference Result 309 states and 323 transitions. [2022-04-14 15:11:50,325 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 323 transitions. [2022-04-14 15:11:50,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:50,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:50,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) Second operand 309 states. [2022-04-14 15:11:50,327 INFO L87 Difference]: Start difference. First operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) Second operand 309 states. [2022-04-14 15:11:50,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:50,331 INFO L93 Difference]: Finished difference Result 309 states and 323 transitions. [2022-04-14 15:11:50,331 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 323 transitions. [2022-04-14 15:11:50,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:50,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:50,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:50,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:50,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-14 15:11:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 322 transitions. [2022-04-14 15:11:50,337 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 322 transitions. Word has length 155 [2022-04-14 15:11:50,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:50,337 INFO L478 AbstractCegarLoop]: Abstraction has 308 states and 322 transitions. [2022-04-14 15:11:50,337 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:11:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 322 transitions. [2022-04-14 15:11:50,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-14 15:11:50,338 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:50,338 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 27, 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, 1, 1] [2022-04-14 15:11:50,346 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:11:50,544 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:11:50,544 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:50,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:50,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2056924759, now seen corresponding path program 4 times [2022-04-14 15:11:50,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:50,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867896029] [2022-04-14 15:11:50,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:50,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:50,554 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:50,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [295571371] [2022-04-14 15:11:50,554 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-14 15:11:50,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:50,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:50,558 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:11:50,559 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:11:52,476 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-14 15:11:52,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:11:52,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-14 15:11:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:52,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:12:43,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {17361#true} call ULTIMATE.init(); {17361#true} is VALID [2022-04-14 15:12:43,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {17361#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; {17361#true} is VALID [2022-04-14 15:12:43,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:12:43,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17361#true} {17361#true} #81#return; {17361#true} is VALID [2022-04-14 15:12:43,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {17361#true} call #t~ret6 := main(); {17361#true} is VALID [2022-04-14 15:12:43,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {17361#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; {17361#true} is VALID [2022-04-14 15:12:43,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {17361#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17361#true} is VALID [2022-04-14 15:12:43,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {17361#true} assume !!(#t~post5 < 20);havoc #t~post5; {17361#true} is VALID [2022-04-14 15:12:43,258 INFO L272 TraceCheckUtils]: 8: Hoare triple {17361#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-14 15:12:43,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:12:43,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:12:43,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:12:43,259 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {17361#true} {17361#true} #59#return; {17361#true} is VALID [2022-04-14 15:12:43,259 INFO L272 TraceCheckUtils]: 13: Hoare triple {17361#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17361#true} is VALID [2022-04-14 15:12:43,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {17361#true} ~cond := #in~cond; {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:43,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:43,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:43,260 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17361#true} #61#return; {17419#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-14 15:12:43,260 INFO L272 TraceCheckUtils]: 18: Hoare triple {17419#(= (+ (* 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)); {17361#true} is VALID [2022-04-14 15:12:43,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {17361#true} ~cond := #in~cond; {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:43,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:43,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:43,261 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17419#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #63#return; {17435#(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:12:43,262 INFO L272 TraceCheckUtils]: 23: Hoare triple {17435#(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)); {17361#true} is VALID [2022-04-14 15:12:43,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {17361#true} ~cond := #in~cond; {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:43,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:43,262 INFO L290 TraceCheckUtils]: 26: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:43,263 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17435#(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; {17451#(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:12:43,263 INFO L272 TraceCheckUtils]: 28: Hoare triple {17451#(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)); {17361#true} is VALID [2022-04-14 15:12:43,263 INFO L290 TraceCheckUtils]: 29: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:12:43,263 INFO L290 TraceCheckUtils]: 30: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:12:43,263 INFO L290 TraceCheckUtils]: 31: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:12:43,264 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17361#true} {17451#(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; {17451#(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:12:45,265 WARN L290 TraceCheckUtils]: 33: Hoare triple {17451#(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; {17451#(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:12:45,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {17451#(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; {17451#(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:12:45,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {17451#(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 < 20);havoc #t~post5; {17451#(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:12:45,267 INFO L272 TraceCheckUtils]: 36: Hoare triple {17451#(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)); {17361#true} is VALID [2022-04-14 15:12:45,267 INFO L290 TraceCheckUtils]: 37: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:12:45,267 INFO L290 TraceCheckUtils]: 38: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:12:45,267 INFO L290 TraceCheckUtils]: 39: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:12:45,267 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {17361#true} {17451#(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; {17451#(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:12:45,267 INFO L272 TraceCheckUtils]: 41: Hoare triple {17451#(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)); {17361#true} is VALID [2022-04-14 15:12:45,268 INFO L290 TraceCheckUtils]: 42: Hoare triple {17361#true} ~cond := #in~cond; {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:45,268 INFO L290 TraceCheckUtils]: 43: Hoare triple {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:45,268 INFO L290 TraceCheckUtils]: 44: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:45,269 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17451#(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; {17451#(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:12:45,269 INFO L272 TraceCheckUtils]: 46: Hoare triple {17451#(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)); {17361#true} is VALID [2022-04-14 15:12:45,269 INFO L290 TraceCheckUtils]: 47: Hoare triple {17361#true} ~cond := #in~cond; {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:45,269 INFO L290 TraceCheckUtils]: 48: Hoare triple {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:45,270 INFO L290 TraceCheckUtils]: 49: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:45,271 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17451#(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; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:12:45,271 INFO L272 TraceCheckUtils]: 51: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 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)); {17361#true} is VALID [2022-04-14 15:12:45,271 INFO L290 TraceCheckUtils]: 52: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:12:45,271 INFO L290 TraceCheckUtils]: 53: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:12:45,271 INFO L290 TraceCheckUtils]: 54: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:12:45,271 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17361#true} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #65#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:12:45,271 INFO L272 TraceCheckUtils]: 56: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* 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)); {17361#true} is VALID [2022-04-14 15:12:45,272 INFO L290 TraceCheckUtils]: 57: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:12:45,272 INFO L290 TraceCheckUtils]: 58: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:12:45,272 INFO L290 TraceCheckUtils]: 59: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:12:45,272 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {17361#true} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #67#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:12:47,274 WARN L290 TraceCheckUtils]: 61: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* 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; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is UNKNOWN [2022-04-14 15:12:47,274 INFO L290 TraceCheckUtils]: 62: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:12:47,275 INFO L290 TraceCheckUtils]: 63: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} assume !!(#t~post5 < 20);havoc #t~post5; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:12:47,275 INFO L272 TraceCheckUtils]: 64: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 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)); {17361#true} is VALID [2022-04-14 15:12:47,275 INFO L290 TraceCheckUtils]: 65: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:12:47,275 INFO L290 TraceCheckUtils]: 66: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:12:47,275 INFO L290 TraceCheckUtils]: 67: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:12:47,276 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {17361#true} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #59#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:12:47,276 INFO L272 TraceCheckUtils]: 69: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 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)); {17361#true} is VALID [2022-04-14 15:12:47,276 INFO L290 TraceCheckUtils]: 70: Hoare triple {17361#true} ~cond := #in~cond; {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:47,276 INFO L290 TraceCheckUtils]: 71: Hoare triple {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:47,277 INFO L290 TraceCheckUtils]: 72: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:47,277 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #61#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:12:47,277 INFO L272 TraceCheckUtils]: 74: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 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)); {17361#true} is VALID [2022-04-14 15:12:47,277 INFO L290 TraceCheckUtils]: 75: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:12:47,277 INFO L290 TraceCheckUtils]: 76: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:12:47,277 INFO L290 TraceCheckUtils]: 77: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:12:47,278 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {17361#true} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #63#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:12:47,278 INFO L272 TraceCheckUtils]: 79: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 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)); {17361#true} is VALID [2022-04-14 15:12:47,278 INFO L290 TraceCheckUtils]: 80: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:12:47,278 INFO L290 TraceCheckUtils]: 81: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:12:47,278 INFO L290 TraceCheckUtils]: 82: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:12:47,278 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {17361#true} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #65#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:12:47,278 INFO L272 TraceCheckUtils]: 84: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* 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)); {17361#true} is VALID [2022-04-14 15:12:47,278 INFO L290 TraceCheckUtils]: 85: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:12:47,279 INFO L290 TraceCheckUtils]: 86: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:12:47,279 INFO L290 TraceCheckUtils]: 87: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:12:47,279 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {17361#true} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #67#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:12:48,737 INFO L290 TraceCheckUtils]: 89: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* 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; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:12:48,737 INFO L290 TraceCheckUtils]: 90: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:12:48,738 INFO L290 TraceCheckUtils]: 91: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} assume !!(#t~post5 < 20);havoc #t~post5; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:12:48,738 INFO L272 TraceCheckUtils]: 92: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 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)); {17361#true} is VALID [2022-04-14 15:12:48,738 INFO L290 TraceCheckUtils]: 93: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:12:48,738 INFO L290 TraceCheckUtils]: 94: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:12:48,738 INFO L290 TraceCheckUtils]: 95: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:12:48,739 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {17361#true} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #59#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:12:48,739 INFO L272 TraceCheckUtils]: 97: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 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)); {17361#true} is VALID [2022-04-14 15:12:48,739 INFO L290 TraceCheckUtils]: 98: Hoare triple {17361#true} ~cond := #in~cond; {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:48,739 INFO L290 TraceCheckUtils]: 99: Hoare triple {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:48,740 INFO L290 TraceCheckUtils]: 100: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:48,740 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #61#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:12:48,740 INFO L272 TraceCheckUtils]: 102: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 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)); {17361#true} is VALID [2022-04-14 15:12:48,740 INFO L290 TraceCheckUtils]: 103: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:12:48,740 INFO L290 TraceCheckUtils]: 104: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:12:48,740 INFO L290 TraceCheckUtils]: 105: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:12:48,741 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17361#true} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #63#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:12:48,741 INFO L272 TraceCheckUtils]: 107: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 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)); {17361#true} is VALID [2022-04-14 15:12:48,741 INFO L290 TraceCheckUtils]: 108: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:12:48,741 INFO L290 TraceCheckUtils]: 109: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:12:48,741 INFO L290 TraceCheckUtils]: 110: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:12:48,741 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {17361#true} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #65#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:12:48,741 INFO L272 TraceCheckUtils]: 112: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* 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)); {17361#true} is VALID [2022-04-14 15:12:48,742 INFO L290 TraceCheckUtils]: 113: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:12:48,742 INFO L290 TraceCheckUtils]: 114: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:12:48,742 INFO L290 TraceCheckUtils]: 115: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:12:48,742 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {17361#true} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #67#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:12:48,755 INFO L290 TraceCheckUtils]: 117: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* 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; {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-14 15:12:48,756 INFO L290 TraceCheckUtils]: 118: Hoare triple {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-14 15:12:48,757 INFO L290 TraceCheckUtils]: 119: Hoare triple {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} assume !!(#t~post5 < 20);havoc #t~post5; {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-14 15:12:48,757 INFO L272 TraceCheckUtils]: 120: Hoare triple {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-14 15:12:48,757 INFO L290 TraceCheckUtils]: 121: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:12:48,757 INFO L290 TraceCheckUtils]: 122: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:12:48,757 INFO L290 TraceCheckUtils]: 123: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:12:48,758 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17361#true} {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #59#return; {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-14 15:12:48,758 INFO L272 TraceCheckUtils]: 125: Hoare triple {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17361#true} is VALID [2022-04-14 15:12:48,758 INFO L290 TraceCheckUtils]: 126: Hoare triple {17361#true} ~cond := #in~cond; {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:48,758 INFO L290 TraceCheckUtils]: 127: Hoare triple {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:48,758 INFO L290 TraceCheckUtils]: 128: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:48,759 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #61#return; {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-14 15:12:48,759 INFO L272 TraceCheckUtils]: 130: Hoare triple {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-14 15:12:48,759 INFO L290 TraceCheckUtils]: 131: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:12:48,759 INFO L290 TraceCheckUtils]: 132: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:12:48,759 INFO L290 TraceCheckUtils]: 133: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:12:48,760 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {17361#true} {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #63#return; {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-14 15:12:48,760 INFO L272 TraceCheckUtils]: 135: Hoare triple {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17361#true} is VALID [2022-04-14 15:12:48,760 INFO L290 TraceCheckUtils]: 136: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:12:48,760 INFO L290 TraceCheckUtils]: 137: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:12:48,760 INFO L290 TraceCheckUtils]: 138: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:12:48,760 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {17361#true} {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #65#return; {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-14 15:12:48,761 INFO L272 TraceCheckUtils]: 140: Hoare triple {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17361#true} is VALID [2022-04-14 15:12:48,761 INFO L290 TraceCheckUtils]: 141: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:12:48,761 INFO L290 TraceCheckUtils]: 142: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:12:48,761 INFO L290 TraceCheckUtils]: 143: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:12:48,761 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {17361#true} {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #67#return; {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-14 15:12:48,762 INFO L290 TraceCheckUtils]: 145: Hoare triple {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} assume !(~n~0 <= ~a~0); {17808#(and (<= main_~n~0 (+ main_~a~0 1)) (not (<= main_~n~0 main_~a~0)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-14 15:12:48,762 INFO L272 TraceCheckUtils]: 146: Hoare triple {17808#(and (<= main_~n~0 (+ main_~a~0 1)) (not (<= main_~n~0 main_~a~0)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-14 15:12:48,762 INFO L290 TraceCheckUtils]: 147: Hoare triple {17361#true} ~cond := #in~cond; {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:48,762 INFO L290 TraceCheckUtils]: 148: Hoare triple {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:48,763 INFO L290 TraceCheckUtils]: 149: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:50,586 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17808#(and (<= main_~n~0 (+ main_~a~0 1)) (not (<= main_~n~0 main_~a~0)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #69#return; {17824#(and (= (+ 5 (* (div (+ main_~z~0 (- 6)) 6) 3) main_~y~0) (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-14 15:12:50,587 INFO L272 TraceCheckUtils]: 151: Hoare triple {17824#(and (= (+ 5 (* (div (+ main_~z~0 (- 6)) 6) 3) main_~y~0) (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (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)); {17361#true} is VALID [2022-04-14 15:12:50,587 INFO L290 TraceCheckUtils]: 152: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:12:50,587 INFO L290 TraceCheckUtils]: 153: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:12:50,587 INFO L290 TraceCheckUtils]: 154: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:12:50,587 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {17361#true} {17824#(and (= (+ 5 (* (div (+ main_~z~0 (- 6)) 6) 3) main_~y~0) (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} #71#return; {17824#(and (= (+ 5 (* (div (+ main_~z~0 (- 6)) 6) 3) main_~y~0) (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-14 15:12:50,799 INFO L272 TraceCheckUtils]: 156: Hoare triple {17824#(and (= (+ 5 (* (div (+ main_~z~0 (- 6)) 6) 3) main_~y~0) (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {17843#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:12:50,800 INFO L290 TraceCheckUtils]: 157: Hoare triple {17843#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17847#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:50,800 INFO L290 TraceCheckUtils]: 158: Hoare triple {17847#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17362#false} is VALID [2022-04-14 15:12:50,800 INFO L290 TraceCheckUtils]: 159: Hoare triple {17362#false} assume !false; {17362#false} is VALID [2022-04-14 15:12:50,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 252 proven. 354 refuted. 0 times theorem prover too weak. 932 trivial. 0 not checked. [2022-04-14 15:12:50,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:13:04,487 INFO L290 TraceCheckUtils]: 159: Hoare triple {17362#false} assume !false; {17362#false} is VALID [2022-04-14 15:13:04,488 INFO L290 TraceCheckUtils]: 158: Hoare triple {17847#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17362#false} is VALID [2022-04-14 15:13:04,489 INFO L290 TraceCheckUtils]: 157: Hoare triple {17843#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17847#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:13:04,489 INFO L272 TraceCheckUtils]: 156: Hoare triple {17863#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {17843#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:13:04,490 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {17361#true} {17863#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #71#return; {17863#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-14 15:13:04,490 INFO L290 TraceCheckUtils]: 154: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,490 INFO L290 TraceCheckUtils]: 153: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,490 INFO L290 TraceCheckUtils]: 152: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,490 INFO L272 TraceCheckUtils]: 151: Hoare triple {17863#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,490 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17882#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} #69#return; {17863#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-14 15:13:04,491 INFO L290 TraceCheckUtils]: 149: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:13:04,491 INFO L290 TraceCheckUtils]: 148: Hoare triple {17892#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:13:04,491 INFO L290 TraceCheckUtils]: 147: Hoare triple {17361#true} ~cond := #in~cond; {17892#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:13:04,491 INFO L272 TraceCheckUtils]: 146: Hoare triple {17882#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,492 INFO L290 TraceCheckUtils]: 145: Hoare triple {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} assume !(~n~0 <= ~a~0); {17882#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} is VALID [2022-04-14 15:13:04,492 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {17361#true} {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #67#return; {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-14 15:13:04,492 INFO L290 TraceCheckUtils]: 143: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,492 INFO L290 TraceCheckUtils]: 142: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,492 INFO L290 TraceCheckUtils]: 141: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,492 INFO L272 TraceCheckUtils]: 140: Hoare triple {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,493 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {17361#true} {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #65#return; {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-14 15:13:04,493 INFO L290 TraceCheckUtils]: 138: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,493 INFO L290 TraceCheckUtils]: 137: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,493 INFO L290 TraceCheckUtils]: 136: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,493 INFO L272 TraceCheckUtils]: 135: Hoare triple {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 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)); {17361#true} is VALID [2022-04-14 15:13:04,493 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {17361#true} {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #63#return; {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-14 15:13:04,494 INFO L290 TraceCheckUtils]: 133: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,494 INFO L290 TraceCheckUtils]: 132: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,494 INFO L290 TraceCheckUtils]: 131: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,494 INFO L272 TraceCheckUtils]: 130: Hoare triple {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,494 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17948#(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_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #61#return; {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-14 15:13:04,495 INFO L290 TraceCheckUtils]: 128: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:13:04,495 INFO L290 TraceCheckUtils]: 127: Hoare triple {17892#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:13:04,495 INFO L290 TraceCheckUtils]: 126: Hoare triple {17361#true} ~cond := #in~cond; {17892#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:13:04,495 INFO L272 TraceCheckUtils]: 125: Hoare triple {17948#(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_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,496 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17361#true} {17948#(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_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #59#return; {17948#(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_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-14 15:13:04,496 INFO L290 TraceCheckUtils]: 123: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,496 INFO L290 TraceCheckUtils]: 122: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,496 INFO L290 TraceCheckUtils]: 121: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,496 INFO L272 TraceCheckUtils]: 120: Hoare triple {17948#(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_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,496 INFO L290 TraceCheckUtils]: 119: Hoare triple {17948#(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_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} assume !!(#t~post5 < 20);havoc #t~post5; {17948#(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_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-14 15:13:04,497 INFO L290 TraceCheckUtils]: 118: Hoare triple {17948#(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_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17948#(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_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-14 15:13:04,499 INFO L290 TraceCheckUtils]: 117: Hoare triple {17361#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; {17948#(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_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-14 15:13:04,499 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {17361#true} {17361#true} #67#return; {17361#true} is VALID [2022-04-14 15:13:04,499 INFO L290 TraceCheckUtils]: 115: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,499 INFO L290 TraceCheckUtils]: 114: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,499 INFO L290 TraceCheckUtils]: 113: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,499 INFO L272 TraceCheckUtils]: 112: Hoare triple {17361#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,499 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {17361#true} {17361#true} #65#return; {17361#true} is VALID [2022-04-14 15:13:04,500 INFO L290 TraceCheckUtils]: 110: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,500 INFO L290 TraceCheckUtils]: 109: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,500 INFO L290 TraceCheckUtils]: 108: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,500 INFO L272 TraceCheckUtils]: 107: Hoare triple {17361#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,500 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17361#true} {17361#true} #63#return; {17361#true} is VALID [2022-04-14 15:13:04,500 INFO L290 TraceCheckUtils]: 105: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,500 INFO L290 TraceCheckUtils]: 104: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,500 INFO L290 TraceCheckUtils]: 103: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,500 INFO L272 TraceCheckUtils]: 102: Hoare triple {17361#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,500 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {17361#true} {17361#true} #61#return; {17361#true} is VALID [2022-04-14 15:13:04,500 INFO L290 TraceCheckUtils]: 100: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,500 INFO L290 TraceCheckUtils]: 99: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,500 INFO L290 TraceCheckUtils]: 98: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,500 INFO L272 TraceCheckUtils]: 97: Hoare triple {17361#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,500 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {17361#true} {17361#true} #59#return; {17361#true} is VALID [2022-04-14 15:13:04,500 INFO L290 TraceCheckUtils]: 95: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,500 INFO L290 TraceCheckUtils]: 94: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,501 INFO L290 TraceCheckUtils]: 93: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,501 INFO L272 TraceCheckUtils]: 92: Hoare triple {17361#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,501 INFO L290 TraceCheckUtils]: 91: Hoare triple {17361#true} assume !!(#t~post5 < 20);havoc #t~post5; {17361#true} is VALID [2022-04-14 15:13:04,501 INFO L290 TraceCheckUtils]: 90: Hoare triple {17361#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17361#true} is VALID [2022-04-14 15:13:04,501 INFO L290 TraceCheckUtils]: 89: Hoare triple {17361#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; {17361#true} is VALID [2022-04-14 15:13:04,501 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {17361#true} {17361#true} #67#return; {17361#true} is VALID [2022-04-14 15:13:04,501 INFO L290 TraceCheckUtils]: 87: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,501 INFO L290 TraceCheckUtils]: 86: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,501 INFO L290 TraceCheckUtils]: 85: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,501 INFO L272 TraceCheckUtils]: 84: Hoare triple {17361#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,501 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {17361#true} {17361#true} #65#return; {17361#true} is VALID [2022-04-14 15:13:04,501 INFO L290 TraceCheckUtils]: 82: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,501 INFO L290 TraceCheckUtils]: 81: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,501 INFO L290 TraceCheckUtils]: 80: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,501 INFO L272 TraceCheckUtils]: 79: Hoare triple {17361#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,501 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {17361#true} {17361#true} #63#return; {17361#true} is VALID [2022-04-14 15:13:04,501 INFO L290 TraceCheckUtils]: 77: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,502 INFO L290 TraceCheckUtils]: 76: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,502 INFO L290 TraceCheckUtils]: 75: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,502 INFO L272 TraceCheckUtils]: 74: Hoare triple {17361#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,502 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {17361#true} {17361#true} #61#return; {17361#true} is VALID [2022-04-14 15:13:04,502 INFO L290 TraceCheckUtils]: 72: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,502 INFO L290 TraceCheckUtils]: 71: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,502 INFO L290 TraceCheckUtils]: 70: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,502 INFO L272 TraceCheckUtils]: 69: Hoare triple {17361#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,502 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {17361#true} {17361#true} #59#return; {17361#true} is VALID [2022-04-14 15:13:04,502 INFO L290 TraceCheckUtils]: 67: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,502 INFO L290 TraceCheckUtils]: 66: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,502 INFO L290 TraceCheckUtils]: 65: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,502 INFO L272 TraceCheckUtils]: 64: Hoare triple {17361#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,502 INFO L290 TraceCheckUtils]: 63: Hoare triple {17361#true} assume !!(#t~post5 < 20);havoc #t~post5; {17361#true} is VALID [2022-04-14 15:13:04,502 INFO L290 TraceCheckUtils]: 62: Hoare triple {17361#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17361#true} is VALID [2022-04-14 15:13:04,502 INFO L290 TraceCheckUtils]: 61: Hoare triple {17361#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; {17361#true} is VALID [2022-04-14 15:13:04,502 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {17361#true} {17361#true} #67#return; {17361#true} is VALID [2022-04-14 15:13:04,502 INFO L290 TraceCheckUtils]: 59: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,503 INFO L290 TraceCheckUtils]: 58: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,503 INFO L290 TraceCheckUtils]: 57: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,503 INFO L272 TraceCheckUtils]: 56: Hoare triple {17361#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,503 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17361#true} {17361#true} #65#return; {17361#true} is VALID [2022-04-14 15:13:04,503 INFO L290 TraceCheckUtils]: 54: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,503 INFO L290 TraceCheckUtils]: 53: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,503 INFO L290 TraceCheckUtils]: 52: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,503 INFO L272 TraceCheckUtils]: 51: Hoare triple {17361#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,503 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17361#true} {17361#true} #63#return; {17361#true} is VALID [2022-04-14 15:13:04,503 INFO L290 TraceCheckUtils]: 49: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,503 INFO L290 TraceCheckUtils]: 48: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,503 INFO L290 TraceCheckUtils]: 47: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,503 INFO L272 TraceCheckUtils]: 46: Hoare triple {17361#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,503 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17361#true} {17361#true} #61#return; {17361#true} is VALID [2022-04-14 15:13:04,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,503 INFO L290 TraceCheckUtils]: 43: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,503 INFO L290 TraceCheckUtils]: 42: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,504 INFO L272 TraceCheckUtils]: 41: Hoare triple {17361#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,504 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {17361#true} {17361#true} #59#return; {17361#true} is VALID [2022-04-14 15:13:04,504 INFO L290 TraceCheckUtils]: 39: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,504 INFO L290 TraceCheckUtils]: 38: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,504 INFO L290 TraceCheckUtils]: 37: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,504 INFO L272 TraceCheckUtils]: 36: Hoare triple {17361#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,504 INFO L290 TraceCheckUtils]: 35: Hoare triple {17361#true} assume !!(#t~post5 < 20);havoc #t~post5; {17361#true} is VALID [2022-04-14 15:13:04,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {17361#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17361#true} is VALID [2022-04-14 15:13:04,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {17361#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; {17361#true} is VALID [2022-04-14 15:13:04,504 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17361#true} {17361#true} #67#return; {17361#true} is VALID [2022-04-14 15:13:04,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,504 INFO L290 TraceCheckUtils]: 30: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,504 INFO L290 TraceCheckUtils]: 29: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,504 INFO L272 TraceCheckUtils]: 28: Hoare triple {17361#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,504 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17361#true} {17361#true} #65#return; {17361#true} is VALID [2022-04-14 15:13:04,504 INFO L290 TraceCheckUtils]: 26: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,505 INFO L272 TraceCheckUtils]: 23: Hoare triple {17361#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,505 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17361#true} {17361#true} #63#return; {17361#true} is VALID [2022-04-14 15:13:04,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,505 INFO L272 TraceCheckUtils]: 18: Hoare triple {17361#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,505 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17361#true} {17361#true} #61#return; {17361#true} is VALID [2022-04-14 15:13:04,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,505 INFO L272 TraceCheckUtils]: 13: Hoare triple {17361#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,505 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {17361#true} {17361#true} #59#return; {17361#true} is VALID [2022-04-14 15:13:04,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-14 15:13:04,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-14 15:13:04,505 INFO L272 TraceCheckUtils]: 8: Hoare triple {17361#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-14 15:13:04,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {17361#true} assume !!(#t~post5 < 20);havoc #t~post5; {17361#true} is VALID [2022-04-14 15:13:04,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {17361#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17361#true} is VALID [2022-04-14 15:13:04,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {17361#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; {17361#true} is VALID [2022-04-14 15:13:04,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {17361#true} call #t~ret6 := main(); {17361#true} is VALID [2022-04-14 15:13:04,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17361#true} {17361#true} #81#return; {17361#true} is VALID [2022-04-14 15:13:04,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-14 15:13:04,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {17361#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; {17361#true} is VALID [2022-04-14 15:13:04,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {17361#true} call ULTIMATE.init(); {17361#true} is VALID [2022-04-14 15:13:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 219 proven. 17 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2022-04-14 15:13:04,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:13:04,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867896029] [2022-04-14 15:13:04,507 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:13:04,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295571371] [2022-04-14 15:13:04,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295571371] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:13:04,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:13:04,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-14 15:13:04,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674551651] [2022-04-14 15:13:04,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:13:04,508 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) Word has length 160 [2022-04-14 15:13:04,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:13:04,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-14 15:13:09,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 95 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 15:13:09,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-14 15:13:09,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:13:09,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-14 15:13:09,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=239, Unknown=4, NotChecked=0, Total=306 [2022-04-14 15:13:09,247 INFO L87 Difference]: Start difference. First operand 308 states and 322 transitions. Second operand has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-14 15:13:14,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:13:16,933 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:13:31,620 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:13:35,315 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:13:37,316 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:13:39,782 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:13:41,784 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:13:43,787 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:13:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:55,545 INFO L93 Difference]: Finished difference Result 315 states and 328 transitions. [2022-04-14 15:13:55,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 15:13:55,545 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) Word has length 160 [2022-04-14 15:13:55,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:13:55,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-14 15:13:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-14 15:13:55,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-14 15:13:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-14 15:13:55,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-14 15:13:58,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 53 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 15:13:58,976 INFO L225 Difference]: With dead ends: 315 [2022-04-14 15:13:58,976 INFO L226 Difference]: Without dead ends: 294 [2022-04-14 15:13:58,977 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 299 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=124, Invalid=422, Unknown=6, NotChecked=0, Total=552 [2022-04-14 15:13:58,977 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 30 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 75 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:13:58,977 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 126 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 250 Invalid, 5 Unknown, 0 Unchecked, 25.0s Time] [2022-04-14 15:13:58,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-04-14 15:13:59,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-04-14 15:13:59,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:13:59,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 294 states. Second operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-14 15:13:59,149 INFO L74 IsIncluded]: Start isIncluded. First operand 294 states. Second operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-14 15:13:59,149 INFO L87 Difference]: Start difference. First operand 294 states. Second operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-14 15:13:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:59,153 INFO L93 Difference]: Finished difference Result 294 states and 295 transitions. [2022-04-14 15:13:59,153 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2022-04-14 15:13:59,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:59,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:59,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 294 states. [2022-04-14 15:13:59,154 INFO L87 Difference]: Start difference. First operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 294 states. [2022-04-14 15:13:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:59,158 INFO L93 Difference]: Finished difference Result 294 states and 295 transitions. [2022-04-14 15:13:59,158 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2022-04-14 15:13:59,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:59,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:59,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:13:59,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:13:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-14 15:13:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 295 transitions. [2022-04-14 15:13:59,164 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 295 transitions. Word has length 160 [2022-04-14 15:13:59,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:13:59,164 INFO L478 AbstractCegarLoop]: Abstraction has 294 states and 295 transitions. [2022-04-14 15:13:59,164 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-14 15:13:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2022-04-14 15:13:59,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-04-14 15:13:59,166 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:13:59,167 INFO L499 BasicCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:13:59,175 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:59,375 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:59,375 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:13:59,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:13:59,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1533533153, now seen corresponding path program 3 times [2022-04-14 15:13:59,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:13:59,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093880923] [2022-04-14 15:13:59,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:13:59,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:13:59,393 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:13:59,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1245800191] [2022-04-14 15:13:59,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 15:13:59,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:13:59,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:13:59,395 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:13:59,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-14 15:13:59,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2022-04-14 15:13:59,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:13:59,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-14 15:13:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:59,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:14:00,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {19795#true} call ULTIMATE.init(); {19795#true} is VALID [2022-04-14 15:14:00,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {19795#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; {19803#(<= ~counter~0 0)} is VALID [2022-04-14 15:14:00,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {19803#(<= ~counter~0 0)} assume true; {19803#(<= ~counter~0 0)} is VALID [2022-04-14 15:14:00,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19803#(<= ~counter~0 0)} {19795#true} #81#return; {19803#(<= ~counter~0 0)} is VALID [2022-04-14 15:14:00,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {19803#(<= ~counter~0 0)} call #t~ret6 := main(); {19803#(<= ~counter~0 0)} is VALID [2022-04-14 15:14:00,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {19803#(<= ~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; {19803#(<= ~counter~0 0)} is VALID [2022-04-14 15:14:00,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {19803#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {19819#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,786 INFO L272 TraceCheckUtils]: 8: Hoare triple {19819#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {19819#(<= ~counter~0 1)} ~cond := #in~cond; {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {19819#(<= ~counter~0 1)} assume !(0 == ~cond); {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {19819#(<= ~counter~0 1)} assume true; {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,787 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {19819#(<= ~counter~0 1)} {19819#(<= ~counter~0 1)} #59#return; {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,787 INFO L272 TraceCheckUtils]: 13: Hoare triple {19819#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {19819#(<= ~counter~0 1)} ~cond := #in~cond; {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {19819#(<= ~counter~0 1)} assume !(0 == ~cond); {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {19819#(<= ~counter~0 1)} assume true; {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,788 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19819#(<= ~counter~0 1)} {19819#(<= ~counter~0 1)} #61#return; {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,788 INFO L272 TraceCheckUtils]: 18: Hoare triple {19819#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {19819#(<= ~counter~0 1)} ~cond := #in~cond; {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {19819#(<= ~counter~0 1)} assume !(0 == ~cond); {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {19819#(<= ~counter~0 1)} assume true; {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,789 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {19819#(<= ~counter~0 1)} {19819#(<= ~counter~0 1)} #63#return; {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,790 INFO L272 TraceCheckUtils]: 23: Hoare triple {19819#(<= ~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)); {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {19819#(<= ~counter~0 1)} ~cond := #in~cond; {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {19819#(<= ~counter~0 1)} assume !(0 == ~cond); {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {19819#(<= ~counter~0 1)} assume true; {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,791 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {19819#(<= ~counter~0 1)} {19819#(<= ~counter~0 1)} #65#return; {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,791 INFO L272 TraceCheckUtils]: 28: Hoare triple {19819#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {19819#(<= ~counter~0 1)} ~cond := #in~cond; {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {19819#(<= ~counter~0 1)} assume !(0 == ~cond); {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {19819#(<= ~counter~0 1)} assume true; {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,792 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19819#(<= ~counter~0 1)} {19819#(<= ~counter~0 1)} #67#return; {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {19819#(<= ~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; {19819#(<= ~counter~0 1)} is VALID [2022-04-14 15:14:00,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {19819#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {19904#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,793 INFO L272 TraceCheckUtils]: 36: Hoare triple {19904#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {19904#(<= ~counter~0 2)} ~cond := #in~cond; {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,793 INFO L290 TraceCheckUtils]: 38: Hoare triple {19904#(<= ~counter~0 2)} assume !(0 == ~cond); {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,794 INFO L290 TraceCheckUtils]: 39: Hoare triple {19904#(<= ~counter~0 2)} assume true; {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,794 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {19904#(<= ~counter~0 2)} {19904#(<= ~counter~0 2)} #59#return; {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,794 INFO L272 TraceCheckUtils]: 41: Hoare triple {19904#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,794 INFO L290 TraceCheckUtils]: 42: Hoare triple {19904#(<= ~counter~0 2)} ~cond := #in~cond; {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,795 INFO L290 TraceCheckUtils]: 43: Hoare triple {19904#(<= ~counter~0 2)} assume !(0 == ~cond); {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,795 INFO L290 TraceCheckUtils]: 44: Hoare triple {19904#(<= ~counter~0 2)} assume true; {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,795 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {19904#(<= ~counter~0 2)} {19904#(<= ~counter~0 2)} #61#return; {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,795 INFO L272 TraceCheckUtils]: 46: Hoare triple {19904#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,796 INFO L290 TraceCheckUtils]: 47: Hoare triple {19904#(<= ~counter~0 2)} ~cond := #in~cond; {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,796 INFO L290 TraceCheckUtils]: 48: Hoare triple {19904#(<= ~counter~0 2)} assume !(0 == ~cond); {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,796 INFO L290 TraceCheckUtils]: 49: Hoare triple {19904#(<= ~counter~0 2)} assume true; {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,796 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19904#(<= ~counter~0 2)} {19904#(<= ~counter~0 2)} #63#return; {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,797 INFO L272 TraceCheckUtils]: 51: Hoare triple {19904#(<= ~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)); {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,797 INFO L290 TraceCheckUtils]: 52: Hoare triple {19904#(<= ~counter~0 2)} ~cond := #in~cond; {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,797 INFO L290 TraceCheckUtils]: 53: Hoare triple {19904#(<= ~counter~0 2)} assume !(0 == ~cond); {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,797 INFO L290 TraceCheckUtils]: 54: Hoare triple {19904#(<= ~counter~0 2)} assume true; {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,798 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {19904#(<= ~counter~0 2)} {19904#(<= ~counter~0 2)} #65#return; {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,798 INFO L272 TraceCheckUtils]: 56: Hoare triple {19904#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,798 INFO L290 TraceCheckUtils]: 57: Hoare triple {19904#(<= ~counter~0 2)} ~cond := #in~cond; {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,798 INFO L290 TraceCheckUtils]: 58: Hoare triple {19904#(<= ~counter~0 2)} assume !(0 == ~cond); {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,799 INFO L290 TraceCheckUtils]: 59: Hoare triple {19904#(<= ~counter~0 2)} assume true; {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,799 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {19904#(<= ~counter~0 2)} {19904#(<= ~counter~0 2)} #67#return; {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,799 INFO L290 TraceCheckUtils]: 61: Hoare triple {19904#(<= ~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; {19904#(<= ~counter~0 2)} is VALID [2022-04-14 15:14:00,799 INFO L290 TraceCheckUtils]: 62: Hoare triple {19904#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,800 INFO L290 TraceCheckUtils]: 63: Hoare triple {19989#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,800 INFO L272 TraceCheckUtils]: 64: Hoare triple {19989#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,800 INFO L290 TraceCheckUtils]: 65: Hoare triple {19989#(<= ~counter~0 3)} ~cond := #in~cond; {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,800 INFO L290 TraceCheckUtils]: 66: Hoare triple {19989#(<= ~counter~0 3)} assume !(0 == ~cond); {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,801 INFO L290 TraceCheckUtils]: 67: Hoare triple {19989#(<= ~counter~0 3)} assume true; {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,801 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {19989#(<= ~counter~0 3)} {19989#(<= ~counter~0 3)} #59#return; {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,801 INFO L272 TraceCheckUtils]: 69: Hoare triple {19989#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,801 INFO L290 TraceCheckUtils]: 70: Hoare triple {19989#(<= ~counter~0 3)} ~cond := #in~cond; {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,802 INFO L290 TraceCheckUtils]: 71: Hoare triple {19989#(<= ~counter~0 3)} assume !(0 == ~cond); {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,802 INFO L290 TraceCheckUtils]: 72: Hoare triple {19989#(<= ~counter~0 3)} assume true; {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,802 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {19989#(<= ~counter~0 3)} {19989#(<= ~counter~0 3)} #61#return; {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,802 INFO L272 TraceCheckUtils]: 74: Hoare triple {19989#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,803 INFO L290 TraceCheckUtils]: 75: Hoare triple {19989#(<= ~counter~0 3)} ~cond := #in~cond; {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,803 INFO L290 TraceCheckUtils]: 76: Hoare triple {19989#(<= ~counter~0 3)} assume !(0 == ~cond); {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,803 INFO L290 TraceCheckUtils]: 77: Hoare triple {19989#(<= ~counter~0 3)} assume true; {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,803 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {19989#(<= ~counter~0 3)} {19989#(<= ~counter~0 3)} #63#return; {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,804 INFO L272 TraceCheckUtils]: 79: Hoare triple {19989#(<= ~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)); {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,804 INFO L290 TraceCheckUtils]: 80: Hoare triple {19989#(<= ~counter~0 3)} ~cond := #in~cond; {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,804 INFO L290 TraceCheckUtils]: 81: Hoare triple {19989#(<= ~counter~0 3)} assume !(0 == ~cond); {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,804 INFO L290 TraceCheckUtils]: 82: Hoare triple {19989#(<= ~counter~0 3)} assume true; {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,805 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {19989#(<= ~counter~0 3)} {19989#(<= ~counter~0 3)} #65#return; {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,805 INFO L272 TraceCheckUtils]: 84: Hoare triple {19989#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,805 INFO L290 TraceCheckUtils]: 85: Hoare triple {19989#(<= ~counter~0 3)} ~cond := #in~cond; {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,805 INFO L290 TraceCheckUtils]: 86: Hoare triple {19989#(<= ~counter~0 3)} assume !(0 == ~cond); {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,806 INFO L290 TraceCheckUtils]: 87: Hoare triple {19989#(<= ~counter~0 3)} assume true; {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,806 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {19989#(<= ~counter~0 3)} {19989#(<= ~counter~0 3)} #67#return; {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,806 INFO L290 TraceCheckUtils]: 89: Hoare triple {19989#(<= ~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; {19989#(<= ~counter~0 3)} is VALID [2022-04-14 15:14:00,807 INFO L290 TraceCheckUtils]: 90: Hoare triple {19989#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,807 INFO L290 TraceCheckUtils]: 91: Hoare triple {20074#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,807 INFO L272 TraceCheckUtils]: 92: Hoare triple {20074#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,807 INFO L290 TraceCheckUtils]: 93: Hoare triple {20074#(<= ~counter~0 4)} ~cond := #in~cond; {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,807 INFO L290 TraceCheckUtils]: 94: Hoare triple {20074#(<= ~counter~0 4)} assume !(0 == ~cond); {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,808 INFO L290 TraceCheckUtils]: 95: Hoare triple {20074#(<= ~counter~0 4)} assume true; {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,808 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {20074#(<= ~counter~0 4)} {20074#(<= ~counter~0 4)} #59#return; {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,808 INFO L272 TraceCheckUtils]: 97: Hoare triple {20074#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,809 INFO L290 TraceCheckUtils]: 98: Hoare triple {20074#(<= ~counter~0 4)} ~cond := #in~cond; {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,809 INFO L290 TraceCheckUtils]: 99: Hoare triple {20074#(<= ~counter~0 4)} assume !(0 == ~cond); {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,809 INFO L290 TraceCheckUtils]: 100: Hoare triple {20074#(<= ~counter~0 4)} assume true; {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,809 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {20074#(<= ~counter~0 4)} {20074#(<= ~counter~0 4)} #61#return; {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,810 INFO L272 TraceCheckUtils]: 102: Hoare triple {20074#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,810 INFO L290 TraceCheckUtils]: 103: Hoare triple {20074#(<= ~counter~0 4)} ~cond := #in~cond; {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,810 INFO L290 TraceCheckUtils]: 104: Hoare triple {20074#(<= ~counter~0 4)} assume !(0 == ~cond); {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,810 INFO L290 TraceCheckUtils]: 105: Hoare triple {20074#(<= ~counter~0 4)} assume true; {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,810 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20074#(<= ~counter~0 4)} {20074#(<= ~counter~0 4)} #63#return; {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,811 INFO L272 TraceCheckUtils]: 107: Hoare triple {20074#(<= ~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)); {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,811 INFO L290 TraceCheckUtils]: 108: Hoare triple {20074#(<= ~counter~0 4)} ~cond := #in~cond; {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,811 INFO L290 TraceCheckUtils]: 109: Hoare triple {20074#(<= ~counter~0 4)} assume !(0 == ~cond); {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,811 INFO L290 TraceCheckUtils]: 110: Hoare triple {20074#(<= ~counter~0 4)} assume true; {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,812 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {20074#(<= ~counter~0 4)} {20074#(<= ~counter~0 4)} #65#return; {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,812 INFO L272 TraceCheckUtils]: 112: Hoare triple {20074#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,812 INFO L290 TraceCheckUtils]: 113: Hoare triple {20074#(<= ~counter~0 4)} ~cond := #in~cond; {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,812 INFO L290 TraceCheckUtils]: 114: Hoare triple {20074#(<= ~counter~0 4)} assume !(0 == ~cond); {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,813 INFO L290 TraceCheckUtils]: 115: Hoare triple {20074#(<= ~counter~0 4)} assume true; {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,813 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {20074#(<= ~counter~0 4)} {20074#(<= ~counter~0 4)} #67#return; {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,813 INFO L290 TraceCheckUtils]: 117: Hoare triple {20074#(<= ~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; {20074#(<= ~counter~0 4)} is VALID [2022-04-14 15:14:00,814 INFO L290 TraceCheckUtils]: 118: Hoare triple {20074#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,814 INFO L290 TraceCheckUtils]: 119: Hoare triple {20159#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,814 INFO L272 TraceCheckUtils]: 120: Hoare triple {20159#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,814 INFO L290 TraceCheckUtils]: 121: Hoare triple {20159#(<= ~counter~0 5)} ~cond := #in~cond; {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,815 INFO L290 TraceCheckUtils]: 122: Hoare triple {20159#(<= ~counter~0 5)} assume !(0 == ~cond); {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,815 INFO L290 TraceCheckUtils]: 123: Hoare triple {20159#(<= ~counter~0 5)} assume true; {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,815 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {20159#(<= ~counter~0 5)} {20159#(<= ~counter~0 5)} #59#return; {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,815 INFO L272 TraceCheckUtils]: 125: Hoare triple {20159#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,816 INFO L290 TraceCheckUtils]: 126: Hoare triple {20159#(<= ~counter~0 5)} ~cond := #in~cond; {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,816 INFO L290 TraceCheckUtils]: 127: Hoare triple {20159#(<= ~counter~0 5)} assume !(0 == ~cond); {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,816 INFO L290 TraceCheckUtils]: 128: Hoare triple {20159#(<= ~counter~0 5)} assume true; {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,816 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {20159#(<= ~counter~0 5)} {20159#(<= ~counter~0 5)} #61#return; {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,817 INFO L272 TraceCheckUtils]: 130: Hoare triple {20159#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,817 INFO L290 TraceCheckUtils]: 131: Hoare triple {20159#(<= ~counter~0 5)} ~cond := #in~cond; {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,817 INFO L290 TraceCheckUtils]: 132: Hoare triple {20159#(<= ~counter~0 5)} assume !(0 == ~cond); {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,817 INFO L290 TraceCheckUtils]: 133: Hoare triple {20159#(<= ~counter~0 5)} assume true; {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,818 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {20159#(<= ~counter~0 5)} {20159#(<= ~counter~0 5)} #63#return; {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,818 INFO L272 TraceCheckUtils]: 135: Hoare triple {20159#(<= ~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)); {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,818 INFO L290 TraceCheckUtils]: 136: Hoare triple {20159#(<= ~counter~0 5)} ~cond := #in~cond; {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,818 INFO L290 TraceCheckUtils]: 137: Hoare triple {20159#(<= ~counter~0 5)} assume !(0 == ~cond); {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,818 INFO L290 TraceCheckUtils]: 138: Hoare triple {20159#(<= ~counter~0 5)} assume true; {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,819 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {20159#(<= ~counter~0 5)} {20159#(<= ~counter~0 5)} #65#return; {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,819 INFO L272 TraceCheckUtils]: 140: Hoare triple {20159#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,819 INFO L290 TraceCheckUtils]: 141: Hoare triple {20159#(<= ~counter~0 5)} ~cond := #in~cond; {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,820 INFO L290 TraceCheckUtils]: 142: Hoare triple {20159#(<= ~counter~0 5)} assume !(0 == ~cond); {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,820 INFO L290 TraceCheckUtils]: 143: Hoare triple {20159#(<= ~counter~0 5)} assume true; {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,820 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {20159#(<= ~counter~0 5)} {20159#(<= ~counter~0 5)} #67#return; {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,820 INFO L290 TraceCheckUtils]: 145: Hoare triple {20159#(<= ~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; {20159#(<= ~counter~0 5)} is VALID [2022-04-14 15:14:00,821 INFO L290 TraceCheckUtils]: 146: Hoare triple {20159#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,821 INFO L290 TraceCheckUtils]: 147: Hoare triple {20244#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,821 INFO L272 TraceCheckUtils]: 148: Hoare triple {20244#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,821 INFO L290 TraceCheckUtils]: 149: Hoare triple {20244#(<= ~counter~0 6)} ~cond := #in~cond; {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,822 INFO L290 TraceCheckUtils]: 150: Hoare triple {20244#(<= ~counter~0 6)} assume !(0 == ~cond); {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,822 INFO L290 TraceCheckUtils]: 151: Hoare triple {20244#(<= ~counter~0 6)} assume true; {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,822 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {20244#(<= ~counter~0 6)} {20244#(<= ~counter~0 6)} #59#return; {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,822 INFO L272 TraceCheckUtils]: 153: Hoare triple {20244#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,823 INFO L290 TraceCheckUtils]: 154: Hoare triple {20244#(<= ~counter~0 6)} ~cond := #in~cond; {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,823 INFO L290 TraceCheckUtils]: 155: Hoare triple {20244#(<= ~counter~0 6)} assume !(0 == ~cond); {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,823 INFO L290 TraceCheckUtils]: 156: Hoare triple {20244#(<= ~counter~0 6)} assume true; {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,823 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {20244#(<= ~counter~0 6)} {20244#(<= ~counter~0 6)} #61#return; {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,824 INFO L272 TraceCheckUtils]: 158: Hoare triple {20244#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,824 INFO L290 TraceCheckUtils]: 159: Hoare triple {20244#(<= ~counter~0 6)} ~cond := #in~cond; {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,824 INFO L290 TraceCheckUtils]: 160: Hoare triple {20244#(<= ~counter~0 6)} assume !(0 == ~cond); {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,824 INFO L290 TraceCheckUtils]: 161: Hoare triple {20244#(<= ~counter~0 6)} assume true; {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,825 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {20244#(<= ~counter~0 6)} {20244#(<= ~counter~0 6)} #63#return; {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,825 INFO L272 TraceCheckUtils]: 163: Hoare triple {20244#(<= ~counter~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)); {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,825 INFO L290 TraceCheckUtils]: 164: Hoare triple {20244#(<= ~counter~0 6)} ~cond := #in~cond; {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,825 INFO L290 TraceCheckUtils]: 165: Hoare triple {20244#(<= ~counter~0 6)} assume !(0 == ~cond); {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,826 INFO L290 TraceCheckUtils]: 166: Hoare triple {20244#(<= ~counter~0 6)} assume true; {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,826 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {20244#(<= ~counter~0 6)} {20244#(<= ~counter~0 6)} #65#return; {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,826 INFO L272 TraceCheckUtils]: 168: Hoare triple {20244#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,826 INFO L290 TraceCheckUtils]: 169: Hoare triple {20244#(<= ~counter~0 6)} ~cond := #in~cond; {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,827 INFO L290 TraceCheckUtils]: 170: Hoare triple {20244#(<= ~counter~0 6)} assume !(0 == ~cond); {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,827 INFO L290 TraceCheckUtils]: 171: Hoare triple {20244#(<= ~counter~0 6)} assume true; {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,827 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {20244#(<= ~counter~0 6)} {20244#(<= ~counter~0 6)} #67#return; {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,827 INFO L290 TraceCheckUtils]: 173: Hoare triple {20244#(<= ~counter~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; {20244#(<= ~counter~0 6)} is VALID [2022-04-14 15:14:00,828 INFO L290 TraceCheckUtils]: 174: Hoare triple {20244#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,828 INFO L290 TraceCheckUtils]: 175: Hoare triple {20329#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,828 INFO L272 TraceCheckUtils]: 176: Hoare triple {20329#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,828 INFO L290 TraceCheckUtils]: 177: Hoare triple {20329#(<= ~counter~0 7)} ~cond := #in~cond; {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,829 INFO L290 TraceCheckUtils]: 178: Hoare triple {20329#(<= ~counter~0 7)} assume !(0 == ~cond); {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,829 INFO L290 TraceCheckUtils]: 179: Hoare triple {20329#(<= ~counter~0 7)} assume true; {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,829 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {20329#(<= ~counter~0 7)} {20329#(<= ~counter~0 7)} #59#return; {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,829 INFO L272 TraceCheckUtils]: 181: Hoare triple {20329#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,830 INFO L290 TraceCheckUtils]: 182: Hoare triple {20329#(<= ~counter~0 7)} ~cond := #in~cond; {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,830 INFO L290 TraceCheckUtils]: 183: Hoare triple {20329#(<= ~counter~0 7)} assume !(0 == ~cond); {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,830 INFO L290 TraceCheckUtils]: 184: Hoare triple {20329#(<= ~counter~0 7)} assume true; {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,830 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {20329#(<= ~counter~0 7)} {20329#(<= ~counter~0 7)} #61#return; {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,831 INFO L272 TraceCheckUtils]: 186: Hoare triple {20329#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,831 INFO L290 TraceCheckUtils]: 187: Hoare triple {20329#(<= ~counter~0 7)} ~cond := #in~cond; {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,831 INFO L290 TraceCheckUtils]: 188: Hoare triple {20329#(<= ~counter~0 7)} assume !(0 == ~cond); {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,831 INFO L290 TraceCheckUtils]: 189: Hoare triple {20329#(<= ~counter~0 7)} assume true; {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,832 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {20329#(<= ~counter~0 7)} {20329#(<= ~counter~0 7)} #63#return; {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,832 INFO L272 TraceCheckUtils]: 191: Hoare triple {20329#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,832 INFO L290 TraceCheckUtils]: 192: Hoare triple {20329#(<= ~counter~0 7)} ~cond := #in~cond; {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,832 INFO L290 TraceCheckUtils]: 193: Hoare triple {20329#(<= ~counter~0 7)} assume !(0 == ~cond); {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,833 INFO L290 TraceCheckUtils]: 194: Hoare triple {20329#(<= ~counter~0 7)} assume true; {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,833 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {20329#(<= ~counter~0 7)} {20329#(<= ~counter~0 7)} #65#return; {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,833 INFO L272 TraceCheckUtils]: 196: Hoare triple {20329#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,833 INFO L290 TraceCheckUtils]: 197: Hoare triple {20329#(<= ~counter~0 7)} ~cond := #in~cond; {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,834 INFO L290 TraceCheckUtils]: 198: Hoare triple {20329#(<= ~counter~0 7)} assume !(0 == ~cond); {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,834 INFO L290 TraceCheckUtils]: 199: Hoare triple {20329#(<= ~counter~0 7)} assume true; {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,834 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {20329#(<= ~counter~0 7)} {20329#(<= ~counter~0 7)} #67#return; {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,834 INFO L290 TraceCheckUtils]: 201: Hoare triple {20329#(<= ~counter~0 7)} 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; {20329#(<= ~counter~0 7)} is VALID [2022-04-14 15:14:00,835 INFO L290 TraceCheckUtils]: 202: Hoare triple {20329#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,835 INFO L290 TraceCheckUtils]: 203: Hoare triple {20414#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,835 INFO L272 TraceCheckUtils]: 204: Hoare triple {20414#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,835 INFO L290 TraceCheckUtils]: 205: Hoare triple {20414#(<= ~counter~0 8)} ~cond := #in~cond; {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,836 INFO L290 TraceCheckUtils]: 206: Hoare triple {20414#(<= ~counter~0 8)} assume !(0 == ~cond); {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,836 INFO L290 TraceCheckUtils]: 207: Hoare triple {20414#(<= ~counter~0 8)} assume true; {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,836 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {20414#(<= ~counter~0 8)} {20414#(<= ~counter~0 8)} #59#return; {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,837 INFO L272 TraceCheckUtils]: 209: Hoare triple {20414#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,837 INFO L290 TraceCheckUtils]: 210: Hoare triple {20414#(<= ~counter~0 8)} ~cond := #in~cond; {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,837 INFO L290 TraceCheckUtils]: 211: Hoare triple {20414#(<= ~counter~0 8)} assume !(0 == ~cond); {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,837 INFO L290 TraceCheckUtils]: 212: Hoare triple {20414#(<= ~counter~0 8)} assume true; {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,837 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {20414#(<= ~counter~0 8)} {20414#(<= ~counter~0 8)} #61#return; {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,838 INFO L272 TraceCheckUtils]: 214: Hoare triple {20414#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,838 INFO L290 TraceCheckUtils]: 215: Hoare triple {20414#(<= ~counter~0 8)} ~cond := #in~cond; {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,838 INFO L290 TraceCheckUtils]: 216: Hoare triple {20414#(<= ~counter~0 8)} assume !(0 == ~cond); {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,838 INFO L290 TraceCheckUtils]: 217: Hoare triple {20414#(<= ~counter~0 8)} assume true; {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,839 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {20414#(<= ~counter~0 8)} {20414#(<= ~counter~0 8)} #63#return; {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,839 INFO L272 TraceCheckUtils]: 219: Hoare triple {20414#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,839 INFO L290 TraceCheckUtils]: 220: Hoare triple {20414#(<= ~counter~0 8)} ~cond := #in~cond; {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,839 INFO L290 TraceCheckUtils]: 221: Hoare triple {20414#(<= ~counter~0 8)} assume !(0 == ~cond); {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,840 INFO L290 TraceCheckUtils]: 222: Hoare triple {20414#(<= ~counter~0 8)} assume true; {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,840 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {20414#(<= ~counter~0 8)} {20414#(<= ~counter~0 8)} #65#return; {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,840 INFO L272 TraceCheckUtils]: 224: Hoare triple {20414#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,840 INFO L290 TraceCheckUtils]: 225: Hoare triple {20414#(<= ~counter~0 8)} ~cond := #in~cond; {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,841 INFO L290 TraceCheckUtils]: 226: Hoare triple {20414#(<= ~counter~0 8)} assume !(0 == ~cond); {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,841 INFO L290 TraceCheckUtils]: 227: Hoare triple {20414#(<= ~counter~0 8)} assume true; {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,841 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {20414#(<= ~counter~0 8)} {20414#(<= ~counter~0 8)} #67#return; {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,841 INFO L290 TraceCheckUtils]: 229: Hoare triple {20414#(<= ~counter~0 8)} 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; {20414#(<= ~counter~0 8)} is VALID [2022-04-14 15:14:00,842 INFO L290 TraceCheckUtils]: 230: Hoare triple {20414#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,842 INFO L290 TraceCheckUtils]: 231: Hoare triple {20499#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,842 INFO L272 TraceCheckUtils]: 232: Hoare triple {20499#(<= ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,843 INFO L290 TraceCheckUtils]: 233: Hoare triple {20499#(<= ~counter~0 9)} ~cond := #in~cond; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,843 INFO L290 TraceCheckUtils]: 234: Hoare triple {20499#(<= ~counter~0 9)} assume !(0 == ~cond); {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,843 INFO L290 TraceCheckUtils]: 235: Hoare triple {20499#(<= ~counter~0 9)} assume true; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,843 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {20499#(<= ~counter~0 9)} {20499#(<= ~counter~0 9)} #59#return; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,844 INFO L272 TraceCheckUtils]: 237: Hoare triple {20499#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,844 INFO L290 TraceCheckUtils]: 238: Hoare triple {20499#(<= ~counter~0 9)} ~cond := #in~cond; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,844 INFO L290 TraceCheckUtils]: 239: Hoare triple {20499#(<= ~counter~0 9)} assume !(0 == ~cond); {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,844 INFO L290 TraceCheckUtils]: 240: Hoare triple {20499#(<= ~counter~0 9)} assume true; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,845 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {20499#(<= ~counter~0 9)} {20499#(<= ~counter~0 9)} #61#return; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,845 INFO L272 TraceCheckUtils]: 242: Hoare triple {20499#(<= ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,845 INFO L290 TraceCheckUtils]: 243: Hoare triple {20499#(<= ~counter~0 9)} ~cond := #in~cond; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,845 INFO L290 TraceCheckUtils]: 244: Hoare triple {20499#(<= ~counter~0 9)} assume !(0 == ~cond); {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,846 INFO L290 TraceCheckUtils]: 245: Hoare triple {20499#(<= ~counter~0 9)} assume true; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,846 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {20499#(<= ~counter~0 9)} {20499#(<= ~counter~0 9)} #63#return; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,846 INFO L272 TraceCheckUtils]: 247: Hoare triple {20499#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,846 INFO L290 TraceCheckUtils]: 248: Hoare triple {20499#(<= ~counter~0 9)} ~cond := #in~cond; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,847 INFO L290 TraceCheckUtils]: 249: Hoare triple {20499#(<= ~counter~0 9)} assume !(0 == ~cond); {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,847 INFO L290 TraceCheckUtils]: 250: Hoare triple {20499#(<= ~counter~0 9)} assume true; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,847 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {20499#(<= ~counter~0 9)} {20499#(<= ~counter~0 9)} #65#return; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,847 INFO L272 TraceCheckUtils]: 252: Hoare triple {20499#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,848 INFO L290 TraceCheckUtils]: 253: Hoare triple {20499#(<= ~counter~0 9)} ~cond := #in~cond; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,848 INFO L290 TraceCheckUtils]: 254: Hoare triple {20499#(<= ~counter~0 9)} assume !(0 == ~cond); {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,848 INFO L290 TraceCheckUtils]: 255: Hoare triple {20499#(<= ~counter~0 9)} assume true; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,848 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {20499#(<= ~counter~0 9)} {20499#(<= ~counter~0 9)} #67#return; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,849 INFO L290 TraceCheckUtils]: 257: Hoare triple {20499#(<= ~counter~0 9)} 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; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:00,849 INFO L290 TraceCheckUtils]: 258: Hoare triple {20499#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,849 INFO L290 TraceCheckUtils]: 259: Hoare triple {20584#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,849 INFO L272 TraceCheckUtils]: 260: Hoare triple {20584#(<= ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,850 INFO L290 TraceCheckUtils]: 261: Hoare triple {20584#(<= ~counter~0 10)} ~cond := #in~cond; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,850 INFO L290 TraceCheckUtils]: 262: Hoare triple {20584#(<= ~counter~0 10)} assume !(0 == ~cond); {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,850 INFO L290 TraceCheckUtils]: 263: Hoare triple {20584#(<= ~counter~0 10)} assume true; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,850 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {20584#(<= ~counter~0 10)} {20584#(<= ~counter~0 10)} #59#return; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,851 INFO L272 TraceCheckUtils]: 265: Hoare triple {20584#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,851 INFO L290 TraceCheckUtils]: 266: Hoare triple {20584#(<= ~counter~0 10)} ~cond := #in~cond; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,851 INFO L290 TraceCheckUtils]: 267: Hoare triple {20584#(<= ~counter~0 10)} assume !(0 == ~cond); {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,851 INFO L290 TraceCheckUtils]: 268: Hoare triple {20584#(<= ~counter~0 10)} assume true; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,852 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {20584#(<= ~counter~0 10)} {20584#(<= ~counter~0 10)} #61#return; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,852 INFO L272 TraceCheckUtils]: 270: Hoare triple {20584#(<= ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,852 INFO L290 TraceCheckUtils]: 271: Hoare triple {20584#(<= ~counter~0 10)} ~cond := #in~cond; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,852 INFO L290 TraceCheckUtils]: 272: Hoare triple {20584#(<= ~counter~0 10)} assume !(0 == ~cond); {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,853 INFO L290 TraceCheckUtils]: 273: Hoare triple {20584#(<= ~counter~0 10)} assume true; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,853 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {20584#(<= ~counter~0 10)} {20584#(<= ~counter~0 10)} #63#return; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,853 INFO L272 TraceCheckUtils]: 275: Hoare triple {20584#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,853 INFO L290 TraceCheckUtils]: 276: Hoare triple {20584#(<= ~counter~0 10)} ~cond := #in~cond; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,854 INFO L290 TraceCheckUtils]: 277: Hoare triple {20584#(<= ~counter~0 10)} assume !(0 == ~cond); {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,854 INFO L290 TraceCheckUtils]: 278: Hoare triple {20584#(<= ~counter~0 10)} assume true; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,854 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {20584#(<= ~counter~0 10)} {20584#(<= ~counter~0 10)} #65#return; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,854 INFO L272 TraceCheckUtils]: 280: Hoare triple {20584#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,855 INFO L290 TraceCheckUtils]: 281: Hoare triple {20584#(<= ~counter~0 10)} ~cond := #in~cond; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,855 INFO L290 TraceCheckUtils]: 282: Hoare triple {20584#(<= ~counter~0 10)} assume !(0 == ~cond); {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,855 INFO L290 TraceCheckUtils]: 283: Hoare triple {20584#(<= ~counter~0 10)} assume true; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,855 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {20584#(<= ~counter~0 10)} {20584#(<= ~counter~0 10)} #67#return; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,856 INFO L290 TraceCheckUtils]: 285: Hoare triple {20584#(<= ~counter~0 10)} 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; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:00,856 INFO L290 TraceCheckUtils]: 286: Hoare triple {20584#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20669#(<= |main_#t~post5| 10)} is VALID [2022-04-14 15:14:00,856 INFO L290 TraceCheckUtils]: 287: Hoare triple {20669#(<= |main_#t~post5| 10)} assume !(#t~post5 < 20);havoc #t~post5; {19796#false} is VALID [2022-04-14 15:14:00,856 INFO L272 TraceCheckUtils]: 288: Hoare triple {19796#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19796#false} is VALID [2022-04-14 15:14:00,856 INFO L290 TraceCheckUtils]: 289: Hoare triple {19796#false} ~cond := #in~cond; {19796#false} is VALID [2022-04-14 15:14:00,856 INFO L290 TraceCheckUtils]: 290: Hoare triple {19796#false} assume !(0 == ~cond); {19796#false} is VALID [2022-04-14 15:14:00,856 INFO L290 TraceCheckUtils]: 291: Hoare triple {19796#false} assume true; {19796#false} is VALID [2022-04-14 15:14:00,856 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {19796#false} {19796#false} #69#return; {19796#false} is VALID [2022-04-14 15:14:00,857 INFO L272 TraceCheckUtils]: 293: Hoare triple {19796#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {19796#false} is VALID [2022-04-14 15:14:00,857 INFO L290 TraceCheckUtils]: 294: Hoare triple {19796#false} ~cond := #in~cond; {19796#false} is VALID [2022-04-14 15:14:00,857 INFO L290 TraceCheckUtils]: 295: Hoare triple {19796#false} assume 0 == ~cond; {19796#false} is VALID [2022-04-14 15:14:00,857 INFO L290 TraceCheckUtils]: 296: Hoare triple {19796#false} assume !false; {19796#false} is VALID [2022-04-14 15:14:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 300 proven. 4880 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2022-04-14 15:14:00,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:14:01,649 INFO L290 TraceCheckUtils]: 296: Hoare triple {19796#false} assume !false; {19796#false} is VALID [2022-04-14 15:14:01,649 INFO L290 TraceCheckUtils]: 295: Hoare triple {19796#false} assume 0 == ~cond; {19796#false} is VALID [2022-04-14 15:14:01,649 INFO L290 TraceCheckUtils]: 294: Hoare triple {19796#false} ~cond := #in~cond; {19796#false} is VALID [2022-04-14 15:14:01,649 INFO L272 TraceCheckUtils]: 293: Hoare triple {19796#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {19796#false} is VALID [2022-04-14 15:14:01,649 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {19795#true} {19796#false} #69#return; {19796#false} is VALID [2022-04-14 15:14:01,649 INFO L290 TraceCheckUtils]: 291: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,649 INFO L290 TraceCheckUtils]: 290: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,650 INFO L290 TraceCheckUtils]: 289: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,650 INFO L272 TraceCheckUtils]: 288: Hoare triple {19796#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,650 INFO L290 TraceCheckUtils]: 287: Hoare triple {20727#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {19796#false} is VALID [2022-04-14 15:14:01,650 INFO L290 TraceCheckUtils]: 286: Hoare triple {20731#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20727#(< |main_#t~post5| 20)} is VALID [2022-04-14 15:14:01,650 INFO L290 TraceCheckUtils]: 285: Hoare triple {20731#(< ~counter~0 20)} 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; {20731#(< ~counter~0 20)} is VALID [2022-04-14 15:14:01,651 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {19795#true} {20731#(< ~counter~0 20)} #67#return; {20731#(< ~counter~0 20)} is VALID [2022-04-14 15:14:01,651 INFO L290 TraceCheckUtils]: 283: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,651 INFO L290 TraceCheckUtils]: 282: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,651 INFO L290 TraceCheckUtils]: 281: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,651 INFO L272 TraceCheckUtils]: 280: Hoare triple {20731#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,651 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {19795#true} {20731#(< ~counter~0 20)} #65#return; {20731#(< ~counter~0 20)} is VALID [2022-04-14 15:14:01,651 INFO L290 TraceCheckUtils]: 278: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,651 INFO L290 TraceCheckUtils]: 277: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,651 INFO L290 TraceCheckUtils]: 276: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,651 INFO L272 TraceCheckUtils]: 275: Hoare triple {20731#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,652 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {19795#true} {20731#(< ~counter~0 20)} #63#return; {20731#(< ~counter~0 20)} is VALID [2022-04-14 15:14:01,652 INFO L290 TraceCheckUtils]: 273: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,652 INFO L290 TraceCheckUtils]: 272: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,652 INFO L290 TraceCheckUtils]: 271: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,652 INFO L272 TraceCheckUtils]: 270: Hoare triple {20731#(< ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,652 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {19795#true} {20731#(< ~counter~0 20)} #61#return; {20731#(< ~counter~0 20)} is VALID [2022-04-14 15:14:01,652 INFO L290 TraceCheckUtils]: 268: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,652 INFO L290 TraceCheckUtils]: 267: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,653 INFO L290 TraceCheckUtils]: 266: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,653 INFO L272 TraceCheckUtils]: 265: Hoare triple {20731#(< ~counter~0 20)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,653 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {19795#true} {20731#(< ~counter~0 20)} #59#return; {20731#(< ~counter~0 20)} is VALID [2022-04-14 15:14:01,653 INFO L290 TraceCheckUtils]: 263: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,653 INFO L290 TraceCheckUtils]: 262: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,653 INFO L290 TraceCheckUtils]: 261: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,653 INFO L272 TraceCheckUtils]: 260: Hoare triple {20731#(< ~counter~0 20)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,653 INFO L290 TraceCheckUtils]: 259: Hoare triple {20731#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {20731#(< ~counter~0 20)} is VALID [2022-04-14 15:14:01,654 INFO L290 TraceCheckUtils]: 258: Hoare triple {20816#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20731#(< ~counter~0 20)} is VALID [2022-04-14 15:14:01,654 INFO L290 TraceCheckUtils]: 257: Hoare triple {20816#(< ~counter~0 19)} 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; {20816#(< ~counter~0 19)} is VALID [2022-04-14 15:14:01,654 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {19795#true} {20816#(< ~counter~0 19)} #67#return; {20816#(< ~counter~0 19)} is VALID [2022-04-14 15:14:01,655 INFO L290 TraceCheckUtils]: 255: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,655 INFO L290 TraceCheckUtils]: 254: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,655 INFO L290 TraceCheckUtils]: 253: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,655 INFO L272 TraceCheckUtils]: 252: Hoare triple {20816#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,655 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {19795#true} {20816#(< ~counter~0 19)} #65#return; {20816#(< ~counter~0 19)} is VALID [2022-04-14 15:14:01,655 INFO L290 TraceCheckUtils]: 250: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,655 INFO L290 TraceCheckUtils]: 249: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,655 INFO L290 TraceCheckUtils]: 248: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,655 INFO L272 TraceCheckUtils]: 247: Hoare triple {20816#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,656 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {19795#true} {20816#(< ~counter~0 19)} #63#return; {20816#(< ~counter~0 19)} is VALID [2022-04-14 15:14:01,656 INFO L290 TraceCheckUtils]: 245: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,656 INFO L290 TraceCheckUtils]: 244: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,656 INFO L290 TraceCheckUtils]: 243: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,656 INFO L272 TraceCheckUtils]: 242: Hoare triple {20816#(< ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,656 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {19795#true} {20816#(< ~counter~0 19)} #61#return; {20816#(< ~counter~0 19)} is VALID [2022-04-14 15:14:01,656 INFO L290 TraceCheckUtils]: 240: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,656 INFO L290 TraceCheckUtils]: 239: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,656 INFO L290 TraceCheckUtils]: 238: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,656 INFO L272 TraceCheckUtils]: 237: Hoare triple {20816#(< ~counter~0 19)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,657 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {19795#true} {20816#(< ~counter~0 19)} #59#return; {20816#(< ~counter~0 19)} is VALID [2022-04-14 15:14:01,657 INFO L290 TraceCheckUtils]: 235: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,657 INFO L290 TraceCheckUtils]: 234: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,657 INFO L290 TraceCheckUtils]: 233: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,657 INFO L272 TraceCheckUtils]: 232: Hoare triple {20816#(< ~counter~0 19)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,662 INFO L290 TraceCheckUtils]: 231: Hoare triple {20816#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {20816#(< ~counter~0 19)} is VALID [2022-04-14 15:14:01,663 INFO L290 TraceCheckUtils]: 230: Hoare triple {20901#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20816#(< ~counter~0 19)} is VALID [2022-04-14 15:14:01,663 INFO L290 TraceCheckUtils]: 229: Hoare triple {20901#(< ~counter~0 18)} 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; {20901#(< ~counter~0 18)} is VALID [2022-04-14 15:14:01,663 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {19795#true} {20901#(< ~counter~0 18)} #67#return; {20901#(< ~counter~0 18)} is VALID [2022-04-14 15:14:01,663 INFO L290 TraceCheckUtils]: 227: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,663 INFO L290 TraceCheckUtils]: 226: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,663 INFO L290 TraceCheckUtils]: 225: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,663 INFO L272 TraceCheckUtils]: 224: Hoare triple {20901#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,664 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {19795#true} {20901#(< ~counter~0 18)} #65#return; {20901#(< ~counter~0 18)} is VALID [2022-04-14 15:14:01,664 INFO L290 TraceCheckUtils]: 222: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,664 INFO L290 TraceCheckUtils]: 221: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,664 INFO L290 TraceCheckUtils]: 220: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,664 INFO L272 TraceCheckUtils]: 219: Hoare triple {20901#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,664 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {19795#true} {20901#(< ~counter~0 18)} #63#return; {20901#(< ~counter~0 18)} is VALID [2022-04-14 15:14:01,664 INFO L290 TraceCheckUtils]: 217: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,664 INFO L290 TraceCheckUtils]: 216: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,665 INFO L290 TraceCheckUtils]: 215: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,665 INFO L272 TraceCheckUtils]: 214: Hoare triple {20901#(< ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,665 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {19795#true} {20901#(< ~counter~0 18)} #61#return; {20901#(< ~counter~0 18)} is VALID [2022-04-14 15:14:01,665 INFO L290 TraceCheckUtils]: 212: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,665 INFO L290 TraceCheckUtils]: 211: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,665 INFO L290 TraceCheckUtils]: 210: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,665 INFO L272 TraceCheckUtils]: 209: Hoare triple {20901#(< ~counter~0 18)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,665 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {19795#true} {20901#(< ~counter~0 18)} #59#return; {20901#(< ~counter~0 18)} is VALID [2022-04-14 15:14:01,665 INFO L290 TraceCheckUtils]: 207: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,666 INFO L290 TraceCheckUtils]: 206: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,666 INFO L290 TraceCheckUtils]: 205: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,666 INFO L272 TraceCheckUtils]: 204: Hoare triple {20901#(< ~counter~0 18)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,666 INFO L290 TraceCheckUtils]: 203: Hoare triple {20901#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {20901#(< ~counter~0 18)} is VALID [2022-04-14 15:14:01,666 INFO L290 TraceCheckUtils]: 202: Hoare triple {20986#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20901#(< ~counter~0 18)} is VALID [2022-04-14 15:14:01,666 INFO L290 TraceCheckUtils]: 201: Hoare triple {20986#(< ~counter~0 17)} 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; {20986#(< ~counter~0 17)} is VALID [2022-04-14 15:14:01,667 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {19795#true} {20986#(< ~counter~0 17)} #67#return; {20986#(< ~counter~0 17)} is VALID [2022-04-14 15:14:01,667 INFO L290 TraceCheckUtils]: 199: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,667 INFO L290 TraceCheckUtils]: 198: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,667 INFO L290 TraceCheckUtils]: 197: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,667 INFO L272 TraceCheckUtils]: 196: Hoare triple {20986#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,667 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {19795#true} {20986#(< ~counter~0 17)} #65#return; {20986#(< ~counter~0 17)} is VALID [2022-04-14 15:14:01,667 INFO L290 TraceCheckUtils]: 194: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,667 INFO L290 TraceCheckUtils]: 193: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,668 INFO L290 TraceCheckUtils]: 192: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,668 INFO L272 TraceCheckUtils]: 191: Hoare triple {20986#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,668 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {19795#true} {20986#(< ~counter~0 17)} #63#return; {20986#(< ~counter~0 17)} is VALID [2022-04-14 15:14:01,668 INFO L290 TraceCheckUtils]: 189: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,668 INFO L290 TraceCheckUtils]: 188: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,668 INFO L290 TraceCheckUtils]: 187: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,668 INFO L272 TraceCheckUtils]: 186: Hoare triple {20986#(< ~counter~0 17)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,668 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {19795#true} {20986#(< ~counter~0 17)} #61#return; {20986#(< ~counter~0 17)} is VALID [2022-04-14 15:14:01,669 INFO L290 TraceCheckUtils]: 184: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,669 INFO L290 TraceCheckUtils]: 183: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,669 INFO L290 TraceCheckUtils]: 182: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,669 INFO L272 TraceCheckUtils]: 181: Hoare triple {20986#(< ~counter~0 17)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,669 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {19795#true} {20986#(< ~counter~0 17)} #59#return; {20986#(< ~counter~0 17)} is VALID [2022-04-14 15:14:01,669 INFO L290 TraceCheckUtils]: 179: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,669 INFO L290 TraceCheckUtils]: 178: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,669 INFO L290 TraceCheckUtils]: 177: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,669 INFO L272 TraceCheckUtils]: 176: Hoare triple {20986#(< ~counter~0 17)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,669 INFO L290 TraceCheckUtils]: 175: Hoare triple {20986#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {20986#(< ~counter~0 17)} is VALID [2022-04-14 15:14:01,670 INFO L290 TraceCheckUtils]: 174: Hoare triple {21071#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20986#(< ~counter~0 17)} is VALID [2022-04-14 15:14:01,670 INFO L290 TraceCheckUtils]: 173: Hoare triple {21071#(< ~counter~0 16)} 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; {21071#(< ~counter~0 16)} is VALID [2022-04-14 15:14:01,670 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {19795#true} {21071#(< ~counter~0 16)} #67#return; {21071#(< ~counter~0 16)} is VALID [2022-04-14 15:14:01,670 INFO L290 TraceCheckUtils]: 171: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,670 INFO L290 TraceCheckUtils]: 170: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,671 INFO L290 TraceCheckUtils]: 169: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,671 INFO L272 TraceCheckUtils]: 168: Hoare triple {21071#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,671 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {19795#true} {21071#(< ~counter~0 16)} #65#return; {21071#(< ~counter~0 16)} is VALID [2022-04-14 15:14:01,671 INFO L290 TraceCheckUtils]: 166: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,671 INFO L290 TraceCheckUtils]: 165: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,671 INFO L290 TraceCheckUtils]: 164: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,671 INFO L272 TraceCheckUtils]: 163: Hoare triple {21071#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,671 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {19795#true} {21071#(< ~counter~0 16)} #63#return; {21071#(< ~counter~0 16)} is VALID [2022-04-14 15:14:01,672 INFO L290 TraceCheckUtils]: 161: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,672 INFO L290 TraceCheckUtils]: 160: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,672 INFO L290 TraceCheckUtils]: 159: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,672 INFO L272 TraceCheckUtils]: 158: Hoare triple {21071#(< ~counter~0 16)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,672 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {19795#true} {21071#(< ~counter~0 16)} #61#return; {21071#(< ~counter~0 16)} is VALID [2022-04-14 15:14:01,672 INFO L290 TraceCheckUtils]: 156: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,672 INFO L290 TraceCheckUtils]: 155: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,672 INFO L290 TraceCheckUtils]: 154: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,672 INFO L272 TraceCheckUtils]: 153: Hoare triple {21071#(< ~counter~0 16)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,673 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {19795#true} {21071#(< ~counter~0 16)} #59#return; {21071#(< ~counter~0 16)} is VALID [2022-04-14 15:14:01,673 INFO L290 TraceCheckUtils]: 151: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,673 INFO L290 TraceCheckUtils]: 150: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,673 INFO L290 TraceCheckUtils]: 149: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,673 INFO L272 TraceCheckUtils]: 148: Hoare triple {21071#(< ~counter~0 16)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,673 INFO L290 TraceCheckUtils]: 147: Hoare triple {21071#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {21071#(< ~counter~0 16)} is VALID [2022-04-14 15:14:01,673 INFO L290 TraceCheckUtils]: 146: Hoare triple {21156#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21071#(< ~counter~0 16)} is VALID [2022-04-14 15:14:01,674 INFO L290 TraceCheckUtils]: 145: Hoare triple {21156#(< ~counter~0 15)} 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; {21156#(< ~counter~0 15)} is VALID [2022-04-14 15:14:01,674 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {19795#true} {21156#(< ~counter~0 15)} #67#return; {21156#(< ~counter~0 15)} is VALID [2022-04-14 15:14:01,674 INFO L290 TraceCheckUtils]: 143: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,674 INFO L290 TraceCheckUtils]: 142: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,674 INFO L290 TraceCheckUtils]: 141: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,674 INFO L272 TraceCheckUtils]: 140: Hoare triple {21156#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,674 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {19795#true} {21156#(< ~counter~0 15)} #65#return; {21156#(< ~counter~0 15)} is VALID [2022-04-14 15:14:01,675 INFO L290 TraceCheckUtils]: 138: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,675 INFO L290 TraceCheckUtils]: 137: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,675 INFO L290 TraceCheckUtils]: 136: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,675 INFO L272 TraceCheckUtils]: 135: Hoare triple {21156#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,675 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {19795#true} {21156#(< ~counter~0 15)} #63#return; {21156#(< ~counter~0 15)} is VALID [2022-04-14 15:14:01,675 INFO L290 TraceCheckUtils]: 133: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,675 INFO L290 TraceCheckUtils]: 132: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,675 INFO L290 TraceCheckUtils]: 131: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,675 INFO L272 TraceCheckUtils]: 130: Hoare triple {21156#(< ~counter~0 15)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,676 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {19795#true} {21156#(< ~counter~0 15)} #61#return; {21156#(< ~counter~0 15)} is VALID [2022-04-14 15:14:01,676 INFO L290 TraceCheckUtils]: 128: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,676 INFO L290 TraceCheckUtils]: 127: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,676 INFO L290 TraceCheckUtils]: 126: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,676 INFO L272 TraceCheckUtils]: 125: Hoare triple {21156#(< ~counter~0 15)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,676 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {19795#true} {21156#(< ~counter~0 15)} #59#return; {21156#(< ~counter~0 15)} is VALID [2022-04-14 15:14:01,676 INFO L290 TraceCheckUtils]: 123: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,676 INFO L290 TraceCheckUtils]: 122: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,676 INFO L290 TraceCheckUtils]: 121: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,676 INFO L272 TraceCheckUtils]: 120: Hoare triple {21156#(< ~counter~0 15)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,677 INFO L290 TraceCheckUtils]: 119: Hoare triple {21156#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {21156#(< ~counter~0 15)} is VALID [2022-04-14 15:14:01,677 INFO L290 TraceCheckUtils]: 118: Hoare triple {21241#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21156#(< ~counter~0 15)} is VALID [2022-04-14 15:14:01,677 INFO L290 TraceCheckUtils]: 117: Hoare triple {21241#(< ~counter~0 14)} 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; {21241#(< ~counter~0 14)} is VALID [2022-04-14 15:14:01,677 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {19795#true} {21241#(< ~counter~0 14)} #67#return; {21241#(< ~counter~0 14)} is VALID [2022-04-14 15:14:01,678 INFO L290 TraceCheckUtils]: 115: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,678 INFO L290 TraceCheckUtils]: 114: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,678 INFO L290 TraceCheckUtils]: 113: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,678 INFO L272 TraceCheckUtils]: 112: Hoare triple {21241#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,678 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {19795#true} {21241#(< ~counter~0 14)} #65#return; {21241#(< ~counter~0 14)} is VALID [2022-04-14 15:14:01,678 INFO L290 TraceCheckUtils]: 110: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,678 INFO L290 TraceCheckUtils]: 109: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,678 INFO L290 TraceCheckUtils]: 108: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,678 INFO L272 TraceCheckUtils]: 107: Hoare triple {21241#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,679 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {19795#true} {21241#(< ~counter~0 14)} #63#return; {21241#(< ~counter~0 14)} is VALID [2022-04-14 15:14:01,679 INFO L290 TraceCheckUtils]: 105: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,679 INFO L290 TraceCheckUtils]: 104: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,679 INFO L290 TraceCheckUtils]: 103: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,679 INFO L272 TraceCheckUtils]: 102: Hoare triple {21241#(< ~counter~0 14)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,679 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {19795#true} {21241#(< ~counter~0 14)} #61#return; {21241#(< ~counter~0 14)} is VALID [2022-04-14 15:14:01,679 INFO L290 TraceCheckUtils]: 100: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,679 INFO L290 TraceCheckUtils]: 99: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,679 INFO L290 TraceCheckUtils]: 98: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,679 INFO L272 TraceCheckUtils]: 97: Hoare triple {21241#(< ~counter~0 14)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,680 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {19795#true} {21241#(< ~counter~0 14)} #59#return; {21241#(< ~counter~0 14)} is VALID [2022-04-14 15:14:01,680 INFO L290 TraceCheckUtils]: 95: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,680 INFO L290 TraceCheckUtils]: 94: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,680 INFO L290 TraceCheckUtils]: 93: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,680 INFO L272 TraceCheckUtils]: 92: Hoare triple {21241#(< ~counter~0 14)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,680 INFO L290 TraceCheckUtils]: 91: Hoare triple {21241#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {21241#(< ~counter~0 14)} is VALID [2022-04-14 15:14:01,680 INFO L290 TraceCheckUtils]: 90: Hoare triple {21326#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21241#(< ~counter~0 14)} is VALID [2022-04-14 15:14:01,681 INFO L290 TraceCheckUtils]: 89: Hoare triple {21326#(< ~counter~0 13)} 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; {21326#(< ~counter~0 13)} is VALID [2022-04-14 15:14:01,681 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {19795#true} {21326#(< ~counter~0 13)} #67#return; {21326#(< ~counter~0 13)} is VALID [2022-04-14 15:14:01,681 INFO L290 TraceCheckUtils]: 87: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,681 INFO L290 TraceCheckUtils]: 86: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,681 INFO L290 TraceCheckUtils]: 85: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,681 INFO L272 TraceCheckUtils]: 84: Hoare triple {21326#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,682 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {19795#true} {21326#(< ~counter~0 13)} #65#return; {21326#(< ~counter~0 13)} is VALID [2022-04-14 15:14:01,682 INFO L290 TraceCheckUtils]: 82: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,682 INFO L290 TraceCheckUtils]: 81: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,682 INFO L290 TraceCheckUtils]: 80: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,682 INFO L272 TraceCheckUtils]: 79: Hoare triple {21326#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,703 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {19795#true} {21326#(< ~counter~0 13)} #63#return; {21326#(< ~counter~0 13)} is VALID [2022-04-14 15:14:01,703 INFO L290 TraceCheckUtils]: 77: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,703 INFO L290 TraceCheckUtils]: 76: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,704 INFO L290 TraceCheckUtils]: 75: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,704 INFO L272 TraceCheckUtils]: 74: Hoare triple {21326#(< ~counter~0 13)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,704 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {19795#true} {21326#(< ~counter~0 13)} #61#return; {21326#(< ~counter~0 13)} is VALID [2022-04-14 15:14:01,704 INFO L290 TraceCheckUtils]: 72: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,704 INFO L290 TraceCheckUtils]: 71: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,704 INFO L290 TraceCheckUtils]: 70: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,704 INFO L272 TraceCheckUtils]: 69: Hoare triple {21326#(< ~counter~0 13)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,705 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {19795#true} {21326#(< ~counter~0 13)} #59#return; {21326#(< ~counter~0 13)} is VALID [2022-04-14 15:14:01,705 INFO L290 TraceCheckUtils]: 67: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,705 INFO L290 TraceCheckUtils]: 66: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,705 INFO L290 TraceCheckUtils]: 65: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,705 INFO L272 TraceCheckUtils]: 64: Hoare triple {21326#(< ~counter~0 13)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,705 INFO L290 TraceCheckUtils]: 63: Hoare triple {21326#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {21326#(< ~counter~0 13)} is VALID [2022-04-14 15:14:01,706 INFO L290 TraceCheckUtils]: 62: Hoare triple {21411#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21326#(< ~counter~0 13)} is VALID [2022-04-14 15:14:01,706 INFO L290 TraceCheckUtils]: 61: Hoare triple {21411#(< ~counter~0 12)} 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; {21411#(< ~counter~0 12)} is VALID [2022-04-14 15:14:01,706 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {19795#true} {21411#(< ~counter~0 12)} #67#return; {21411#(< ~counter~0 12)} is VALID [2022-04-14 15:14:01,706 INFO L290 TraceCheckUtils]: 59: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,706 INFO L290 TraceCheckUtils]: 58: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,706 INFO L290 TraceCheckUtils]: 57: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,707 INFO L272 TraceCheckUtils]: 56: Hoare triple {21411#(< ~counter~0 12)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,707 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {19795#true} {21411#(< ~counter~0 12)} #65#return; {21411#(< ~counter~0 12)} is VALID [2022-04-14 15:14:01,707 INFO L290 TraceCheckUtils]: 54: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,707 INFO L290 TraceCheckUtils]: 53: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,707 INFO L290 TraceCheckUtils]: 52: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,707 INFO L272 TraceCheckUtils]: 51: Hoare triple {21411#(< ~counter~0 12)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,707 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19795#true} {21411#(< ~counter~0 12)} #63#return; {21411#(< ~counter~0 12)} is VALID [2022-04-14 15:14:01,707 INFO L290 TraceCheckUtils]: 49: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,708 INFO L290 TraceCheckUtils]: 48: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,708 INFO L290 TraceCheckUtils]: 47: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,708 INFO L272 TraceCheckUtils]: 46: Hoare triple {21411#(< ~counter~0 12)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,708 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {19795#true} {21411#(< ~counter~0 12)} #61#return; {21411#(< ~counter~0 12)} is VALID [2022-04-14 15:14:01,708 INFO L290 TraceCheckUtils]: 44: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,708 INFO L290 TraceCheckUtils]: 43: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,708 INFO L290 TraceCheckUtils]: 42: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,708 INFO L272 TraceCheckUtils]: 41: Hoare triple {21411#(< ~counter~0 12)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,709 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {19795#true} {21411#(< ~counter~0 12)} #59#return; {21411#(< ~counter~0 12)} is VALID [2022-04-14 15:14:01,709 INFO L290 TraceCheckUtils]: 39: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,709 INFO L290 TraceCheckUtils]: 38: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,709 INFO L290 TraceCheckUtils]: 37: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,709 INFO L272 TraceCheckUtils]: 36: Hoare triple {21411#(< ~counter~0 12)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,709 INFO L290 TraceCheckUtils]: 35: Hoare triple {21411#(< ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {21411#(< ~counter~0 12)} is VALID [2022-04-14 15:14:01,709 INFO L290 TraceCheckUtils]: 34: Hoare triple {20584#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21411#(< ~counter~0 12)} is VALID [2022-04-14 15:14:01,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {20584#(<= ~counter~0 10)} 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; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:01,710 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19795#true} {20584#(<= ~counter~0 10)} #67#return; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:01,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,710 INFO L290 TraceCheckUtils]: 30: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,710 INFO L272 TraceCheckUtils]: 28: Hoare triple {20584#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,710 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {19795#true} {20584#(<= ~counter~0 10)} #65#return; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:01,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,711 INFO L272 TraceCheckUtils]: 23: Hoare triple {20584#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,711 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {19795#true} {20584#(<= ~counter~0 10)} #63#return; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:01,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,711 INFO L272 TraceCheckUtils]: 18: Hoare triple {20584#(<= ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,712 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19795#true} {20584#(<= ~counter~0 10)} #61#return; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:01,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,712 INFO L272 TraceCheckUtils]: 13: Hoare triple {20584#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,712 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {19795#true} {20584#(<= ~counter~0 10)} #59#return; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:01,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-14 15:14:01,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-14 15:14:01,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-14 15:14:01,712 INFO L272 TraceCheckUtils]: 8: Hoare triple {20584#(<= ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-14 15:14:01,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {20584#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:01,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {20499#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20584#(<= ~counter~0 10)} is VALID [2022-04-14 15:14:01,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {20499#(<= ~counter~0 9)} 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; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:01,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {20499#(<= ~counter~0 9)} call #t~ret6 := main(); {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:01,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20499#(<= ~counter~0 9)} {19795#true} #81#return; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:01,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {20499#(<= ~counter~0 9)} assume true; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:01,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {19795#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; {20499#(<= ~counter~0 9)} is VALID [2022-04-14 15:14:01,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {19795#true} call ULTIMATE.init(); {19795#true} is VALID [2022-04-14 15:14:01,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2022-04-14 15:14:01,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:14:01,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093880923] [2022-04-14 15:14:01,716 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:14:01,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245800191] [2022-04-14 15:14:01,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245800191] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:14:01,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:14:01,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-14 15:14:01,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663899415] [2022-04-14 15:14:01,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:14:01,717 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) Word has length 297 [2022-04-14 15:14:01,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:14:01,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) [2022-04-14 15:14:01,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 315 edges. 315 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:14:01,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-14 15:14:01,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:14:01,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-14 15:14:01,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-14 15:14:01,931 INFO L87 Difference]: Start difference. First operand 294 states and 295 transitions. Second operand has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) [2022-04-14 15:14:05,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:14:05,341 INFO L93 Difference]: Finished difference Result 584 states and 594 transitions. [2022-04-14 15:14:05,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-14 15:14:05,342 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) Word has length 297 [2022-04-14 15:14:05,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:14:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) [2022-04-14 15:14:05,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 352 transitions. [2022-04-14 15:14:05,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) [2022-04-14 15:14:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 352 transitions. [2022-04-14 15:14:05,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 352 transitions. [2022-04-14 15:14:05,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:14:05,667 INFO L225 Difference]: With dead ends: 584 [2022-04-14 15:14:05,667 INFO L226 Difference]: Without dead ends: 574 [2022-04-14 15:14:05,668 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 570 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2022-04-14 15:14:05,670 INFO L913 BasicCegarLoop]: 121 mSDtfsCounter, 215 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-14 15:14:05,670 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 470 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-14 15:14:05,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-04-14 15:14:05,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2022-04-14 15:14:05,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:14:05,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 574 states. Second operand has 574 states, 368 states have (on average 1.002717391304348) internal successors, (369), 368 states have internal predecessors, (369), 104 states have call successors, (104), 103 states have call predecessors, (104), 101 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2022-04-14 15:14:05,937 INFO L74 IsIncluded]: Start isIncluded. First operand 574 states. Second operand has 574 states, 368 states have (on average 1.002717391304348) internal successors, (369), 368 states have internal predecessors, (369), 104 states have call successors, (104), 103 states have call predecessors, (104), 101 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2022-04-14 15:14:05,938 INFO L87 Difference]: Start difference. First operand 574 states. Second operand has 574 states, 368 states have (on average 1.002717391304348) internal successors, (369), 368 states have internal predecessors, (369), 104 states have call successors, (104), 103 states have call predecessors, (104), 101 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2022-04-14 15:14:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:14:05,948 INFO L93 Difference]: Finished difference Result 574 states and 575 transitions. [2022-04-14 15:14:05,948 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 575 transitions. [2022-04-14 15:14:05,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:14:05,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:14:05,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 574 states, 368 states have (on average 1.002717391304348) internal successors, (369), 368 states have internal predecessors, (369), 104 states have call successors, (104), 103 states have call predecessors, (104), 101 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) Second operand 574 states. [2022-04-14 15:14:05,950 INFO L87 Difference]: Start difference. First operand has 574 states, 368 states have (on average 1.002717391304348) internal successors, (369), 368 states have internal predecessors, (369), 104 states have call successors, (104), 103 states have call predecessors, (104), 101 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) Second operand 574 states. [2022-04-14 15:14:05,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:14:05,960 INFO L93 Difference]: Finished difference Result 574 states and 575 transitions. [2022-04-14 15:14:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 575 transitions. [2022-04-14 15:14:05,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:14:05,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:14:05,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:14:05,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:14:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 368 states have (on average 1.002717391304348) internal successors, (369), 368 states have internal predecessors, (369), 104 states have call successors, (104), 103 states have call predecessors, (104), 101 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2022-04-14 15:14:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 575 transitions. [2022-04-14 15:14:05,974 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 575 transitions. Word has length 297 [2022-04-14 15:14:05,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:14:05,974 INFO L478 AbstractCegarLoop]: Abstraction has 574 states and 575 transitions. [2022-04-14 15:14:05,974 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) [2022-04-14 15:14:05,975 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 575 transitions. [2022-04-14 15:14:05,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2022-04-14 15:14:05,980 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:14:05,981 INFO L499 BasicCegarLoop]: trace histogram [102, 101, 101, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:14:05,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-14 15:14:06,185 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:14:06,186 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:14:06,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:14:06,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1184532997, now seen corresponding path program 4 times [2022-04-14 15:14:06,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:14:06,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552112730] [2022-04-14 15:14:06,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:14:06,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:14:06,211 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:14:06,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1547146218] [2022-04-14 15:14:06,211 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-14 15:14:06,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:14:06,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:14:06,212 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:14:06,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-14 15:14:06,654 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-14 15:14:06,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-14 15:14:06,654 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-14 15:14:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 15:14:07,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-14 15:14:07,004 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-14 15:14:07,004 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 15:14:07,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-14 15:14:07,213 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:14:07,216 INFO L719 BasicCegarLoop]: Path program histogram: [4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2022-04-14 15:14:07,218 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 15:14:07,349 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 15:14:07,349 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-14 15:14:07,349 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-14 15:14:07,349 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-14 15:14:07,349 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-14 15:14:07,349 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-14 15:14:07,349 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-14 15:14:07,349 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-14 15:14:07,349 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 15:14:07,349 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-14 15:14:07,349 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-14 15:14:07,349 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 15:14:07,349 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 15:14:07,349 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-14 15:14:07,349 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-14 15:14:07,349 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-14 15:14:07,349 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:14:07,350 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-14 15:14:07,351 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-14 15:14:07,351 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:14:07,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 03:14:07 BoogieIcfgContainer [2022-04-14 15:14:07,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 15:14:07,367 INFO L158 Benchmark]: Toolchain (without parser) took 221989.36ms. Allocated memory was 195.0MB in the beginning and 405.8MB in the end (delta: 210.8MB). Free memory was 138.9MB in the beginning and 228.4MB in the end (delta: -89.6MB). Peak memory consumption was 121.2MB. Max. memory is 8.0GB. [2022-04-14 15:14:07,367 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 195.0MB. Free memory is still 155.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 15:14:07,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.06ms. Allocated memory was 195.0MB in the beginning and 281.0MB in the end (delta: 86.0MB). Free memory was 138.6MB in the beginning and 251.5MB in the end (delta: -112.8MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. [2022-04-14 15:14:07,368 INFO L158 Benchmark]: Boogie Preprocessor took 18.27ms. Allocated memory is still 281.0MB. Free memory was 251.5MB in the beginning and 249.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 15:14:07,368 INFO L158 Benchmark]: RCFGBuilder took 257.95ms. Allocated memory is still 281.0MB. Free memory was 249.9MB in the beginning and 238.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 15:14:07,368 INFO L158 Benchmark]: TraceAbstraction took 221482.81ms. Allocated memory was 281.0MB in the beginning and 405.8MB in the end (delta: 124.8MB). Free memory was 237.9MB in the beginning and 228.4MB in the end (delta: 9.5MB). Peak memory consumption was 135.1MB. Max. memory is 8.0GB. [2022-04-14 15:14:07,368 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.10ms. Allocated memory is still 195.0MB. Free memory is still 155.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.06ms. Allocated memory was 195.0MB in the beginning and 281.0MB in the end (delta: 86.0MB). Free memory was 138.6MB in the beginning and 251.5MB in the end (delta: -112.8MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.27ms. Allocated memory is still 281.0MB. Free memory was 251.5MB in the beginning and 249.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 257.95ms. Allocated memory is still 281.0MB. Free memory was 249.9MB in the beginning and 238.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 221482.81ms. Allocated memory was 281.0MB in the beginning and 405.8MB in the end (delta: 124.8MB). Free memory was 237.9MB in the beginning and 228.4MB in the end (delta: 9.5MB). Peak memory consumption was 135.1MB. 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)=26, 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=20, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<20 [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=20, 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=20, 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=20, 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=20, 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=20, 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=20, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<20 [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=20, 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=20, 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=20, 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=20, 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=20, 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=20, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<20 [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=20, 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=20, 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=20, 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=20, 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=20, 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=20, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=4, counter++=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<20 [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=20, 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=20, 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=20, 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=20, 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=20, 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=20, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=5, counter++=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<20 [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=20, 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=20, 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=20, 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=20, 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=20, 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=20, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=6, counter++=5, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<20 [L34] 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] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [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=20, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=7, counter++=6, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [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=20, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=8, counter++=7, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [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=20, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=9, counter++=8, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [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=20, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=10, counter++=9, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [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=20, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=11, counter++=10, n=10, x=1000, y=331, z=66] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [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=20, counter=11, n=11, x=1331, y=397, z=72] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=12, counter++=11, n=11, x=1331, y=397, z=72] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [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=20, counter=12, n=12, x=1728, y=469, z=78] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=13, counter++=12, n=12, x=1728, y=469, z=78] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [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=20, counter=13, n=13, x=2197, y=547, z=84] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=14, counter++=13, n=13, x=2197, y=547, z=84] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [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=20, counter=14, n=14, x=2744, y=631, z=90] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=15, counter++=14, n=14, x=2744, y=631, z=90] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [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=20, counter=15, n=15, x=3375, y=721, z=96] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=16, counter++=15, n=15, x=3375, y=721, z=96] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [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=20, counter=16, n=16, x=4096, y=817, z=102] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=17, counter++=16, n=16, x=4096, y=817, z=102] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [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=20, counter=17, n=17, x=4913, y=919, z=108] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=18, counter++=17, n=17, x=4913, y=919, z=108] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [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=20, counter=18, n=18, x=5832, y=1027, z=114] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=19, counter++=18, n=18, x=5832, y=1027, z=114] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [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=20, counter=19, n=19, x=6859, y=1141, z=120] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=20, counter++=19, n=19, x=6859, y=1141, z=120] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [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=20, counter=20, n=20, x=8000, y=1261, z=126] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=21, counter++=20, n=20, x=8000, y=1261, z=126] [L33] COND FALSE !(counter++<20) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [\old(counter)=0, a=20, counter=21, n=20, x=8000, y=1261, z=126] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, \old(counter)=0, counter=21] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 221.3s, OverallIterations: 21, TraceHistogramMax: 102, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 84.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 665 SdHoareTripleChecker+Valid, 33.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 608 mSDsluCounter, 3325 SdHoareTripleChecker+Invalid, 33.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2342 mSDsCounter, 723 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3331 IncrementalHoareTripleChecker+Invalid, 4060 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 723 mSolverCounterUnsat, 983 mSDtfsCounter, 3331 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2765 GetRequests, 2521 SyntacticMatches, 20 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 22.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=574occurred in iteration=20, InterpolantAutomatonStates: 195, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 66 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 5.9s SatisfiabilityAnalysisTime, 118.3s InterpolantComputationTime, 2202 NumberOfCodeBlocks, 1931 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 2526 ConstructedInterpolants, 0 QuantifiedInterpolants, 10625 SizeOfPredicates, 62 NumberOfNonLiveVariables, 3444 ConjunctsInSsa, 378 ConjunctsInUnsatCore, 29 InterpolantComputations, 6 PerfectInterpolantSequences, 15720/22306 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:14:07,408 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...